A Lower Bound for the Query Phase of Contraction Hierarchies and Hub Labels and a Provably Optimal Instance-Based Schema.
Tobias RuppStefan FunkePublished in: Algorithms (2021)
Keyphrases
- lower bound
- class hierarchies
- upper bound
- database
- xpath queries
- query processing
- data model
- semistructured data
- database objects
- query interface
- response time
- lower and upper bounds
- branch and bound algorithm
- instance level
- query evaluation
- data sources
- relevance feedback
- retrieval systems
- user queries
- databases
- query expansion
- knn
- training data
- np hard
- data structure
- branch and bound
- training set
- optimal solution
- answering queries
- structured queries
- objective function
- category labels
- information retrieval
- sufficiently accurate
- query rewriting
- database schema
- xml schema
- worst case
- hierarchical structure