Branch-and-bound algorithm for reverse top-k queries.
Akrivi VlachouChristos DoulkeridisKjetil NørvågYannis KotidisPublished in: SIGMOD Conference (2013)
Keyphrases
- branch and bound algorithm
- query processing
- lower bound
- branch and bound
- upper bound
- np hard
- optimal solution
- upper bounding
- result set
- combinatorial optimization
- lower bounding
- precedence constraints
- user defined
- branch and bound method
- mixed integer linear programming
- randomly generated problems
- skyline queries
- finding an optimal solution
- max sat
- lagrangian relaxation
- query language
- range queries
- approximate answers
- single machine scheduling problem
- aggregation queries
- response time
- search algorithm
- user queries
- index structure
- maximum clique
- approximation algorithms
- aggregate queries
- np complete
- database systems