Optimal Multidimensional Query Processing Using Tree Striping
Stefan Berchtold, Christian Böhm, Daniel A. Keim et al. · Lecture notes in computer science · 2000
Cited by 31 works. doi:10.1007/3-540-44466-1_24 Open-access PDF
Authors
References
- R-trees
- The R*-tree: an efficient and robust access method for points and rectangles
- Organization and maintenance of large ordered indexes
- The Grid File
- Efficient and effective Querying by Image Content
- The X-tree: An Index Structure for High-Dimensional Data Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the VLDB copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Very Large Data Base Endowment. To copy otherwise, or to republish, requires a fee and/or special permission from the Endowment.
- An effective way to represent quadtrees
- Spatial search with polyhedra
- Similarity indexing with the SS-tree
- The TV-tree: An index structure for high-dimensional data