Hardness of Exact Distance Queries in Sparse Graphs Through Hub Labeling.
Adrian KosowskiPrzemyslaw UznanskiLaurent ViennotPublished in: PODC (2019)
Keyphrases
- reachability queries
- query processing
- query language
- range queries
- exact match
- high dimensional
- efficient processing
- distance measure
- np complete
- data sources
- learning theory
- graph databases
- labeling scheme
- distance function
- response time
- active learning
- query evaluation
- graph matching
- exact answers
- database queries
- query graph
- database
- data objects
- directed graph
- retrieval systems
- user queries
- sparse representation
- np hard
- image segmentation
- query answering
- graph mining
- web search engines
- random graphs
- approximate answers
- computational complexity
- disk resident
- search engine