Hardness of exact distance queries in sparse graphs through hub labeling.
Adrian KosowskiPrzemyslaw UznanskiLaurent ViennotPublished in: CoRR (2019)
Keyphrases
- reachability queries
- query language
- query processing
- disk resident
- data sources
- response time
- query evaluation
- active learning
- database queries
- learning theory
- high dimensional
- distance measure
- exact and approximate
- phase transition
- np complete
- worst case
- user queries
- euclidean distance
- retrieval systems
- directed graph
- data objects
- graph data
- graph structure
- exact match
- gaussian graphical models
- data structure
- tree patterns
- efficient processing
- graph databases
- web search engines
- distance function
- similarity search
- computational complexity