Faster Approximate Distance Queries and Compact Routing in Sparse Graphs
Rachit AgarwalBrighten GodfreySariel Har-PeledPublished in: CoRR (2012)
Keyphrases
- distance computation
- query evaluation
- exact and approximate
- query language
- response time
- query processing
- pre computed
- user queries
- exact answers
- database queries
- graph mining
- retrieval systems
- approximate answers
- web search engines
- disk resident
- routing algorithm
- real world graphs
- pruning power
- approximate functional dependencies
- range queries
- distance measure
- data sources
- graph matching
- directed graph
- complex queries
- routing problem
- random graphs
- euclidean distance
- sparse representation
- distance function
- similarity search
- relational databases
- similarity measure
- database