Lower Bounds on the Query Times of Hub Labeling, Contraction Hierarchies, and Transit Node Routing.
Colin WhitePublished in: CoRR (2015)
Keyphrases
- lower bound
- node selection
- response time
- database
- upper bound
- user queries
- query processing
- range queries
- query expansion
- network nodes
- routing algorithm
- destination node
- belief change
- query routing
- class hierarchies
- active learning
- node density
- branch and bound
- tree nodes
- distributed hash table
- labeling scheme
- lower and upper bounds
- network topology
- branch and bound algorithm
- retrieval systems
- shortest path
- relevance feedback
- data sources
- objective function