A Declustering Scheme With Guaranteed Worst-Case Additive Error O(k\frac{1}{{d - 1}}).
Fouad B. ChedidPublished in: ICPADS (2) (2005)
Keyphrases
- additive error
- worst case
- declustering schemes
- range queries
- asymptotically optimal
- lower bound
- partial match queries
- storage systems
- multiple disks
- index structure
- multi dimensional
- upper bound
- response time
- data cube
- multidimensional data
- query processing
- r tree
- np hard
- metric space
- spatial data
- range searching
- related problems
- database
- arrival rate
- power consumption
- similarity searching
- computational complexity
- optimal solution
- databases