Approximate distance queries and compact routing in sparse graphs.
Rachit AgarwalPhilip Brighten GodfreySariel Har-PeledPublished in: INFOCOM (2011)
Keyphrases
- query language
- distance computation
- query processing
- response time
- disk resident
- distance measure
- database
- approximate answers
- range queries
- user queries
- graph databases
- web search engines
- euclidean distance
- retrieval systems
- aggregate queries
- complex queries
- routing algorithm
- database queries
- exact answers
- high dimensional
- gaussian graphical models
- hamming distance
- graph structure
- bipartite graph
- sparse representation
- query evaluation
- directed graph
- routing protocol
- reachability queries
- data objects
- reverse k nearest neighbor
- tree edit distance
- pre computed
- graph data
- query optimization
- distance function
- information retrieval