Multidimensional segment trees can do range queries and updates in logarithmic time.
Nabil IbtehazM. KaykobadM. Sohel RahmanPublished in: CoRR (2018)
Keyphrases
- range queries
- multi dimensional
- multidimensional data
- data cube
- index structure
- aggregate data
- efficient processing
- r tree
- metric space
- range searching
- knn
- decision trees
- multi dimensional data
- query processing
- query types
- spatial queries
- database
- range query processing
- tree structure
- worst case
- data sets
- locality sensitive hashing
- similarity queries
- indexing techniques
- upper bound
- disk accesses