A new lower bound for the list update problem in the partial cost model.
Christoph AmbühlBernd GärtnerBernhard von StengelPublished in: Theor. Comput. Sci. (2001)
Keyphrases
- cost model
- lower bound
- incremental maintenance
- complex queries
- query optimization
- upper bound
- query processing
- query execution
- range queries
- objective function
- np hard
- join algorithms
- worst case
- spatial join
- optimal solution
- query optimizers
- regular expressions
- query cost
- horizontal fragmentation
- query optimizer
- nearest neighbor search
- parallel execution
- databases
- database systems
- data integration
- data structure