Boolean Bounding Predicates for Spatial Access Methods
Purchase on Springer.com
$29.95 / €24.95 / £19.95*
* Final gross prices may vary according to local VAT.
Tree-based multidimensional indexes are integral to efficient queryingin multimedia and GIS applications. These indexes frequently use shapes in internal tree nodes to describe the data stored in a subtree below. We show that the standard Minimum Bounding Rectangle descriptor can lead to significant inefficiency during tree traversal, due to false positives. We also observe that there is often space in internal nodes for richer, more accurate descriptors than rectangles.We propose exploitingt his free space to form subtree predicates based on simple boolean combinations of standard descriptors such as rectangles. Since the problem of choosing these boolean bounding predicates is NP-complete, we implemented and tested several heuristics for tuningthe bounding predicates on an index node, and several heuristics for decidingwh ich nodes in the index to improve when available tuning time is limited. We present experiments over a variety of real and synthetic data sets, examiningth e performance benefit of the various tuninghe uristics. Our experiments show that up to 50% of the unnecessary I/Os caused by imprecise subtree predicates can be eliminated usingthe boolean bounding predicates chosen by our algorithms.
- N. Beckmann, Kriegel H.-P., R. Schneider, and B. Seeger. The R-tree: An efficient and robust access method for points and rectangles. In Proc. of the ACM-SIGMOD Int’l Conference on Management of Data, pages 322–331, 1990.
- M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Algorithms and Applications, 2nd Ed. Springer-Verlag, 2000.
- J. M. Hellerstein, J. Naughton, and A. Pfeffer. Generalized search trees for database systems. In Proc. of the 21st VLDB Conference, Zurich, Switzerland, 1995.
- K. Hildrum and M. Thomas. Jagged bite problem NP-complete construction. Technical Report UCB//CSD-99-1060, University of California at Berkeley, 1999.
- T. Johnson and D. Shasha. B-trees with inserts and deletes: Why free-at-empty is better than merge-at-half. Journal of Computer and System Sciences, 47:45–76, August 1993.
- N. Katayama and S. Satoh. The SR-tree: An index structure for high dimensional nearest neighbor queries. In Proc. of the ACM-SIGMOD Int’l Conference on Management of Data, pages 369–380, Tucson, AZ, May 1997.
- M. Kornacker, M. Shah, and J. M. Hellerstein. An analysis framework for access methods. Technical Report UCB//CSD-99-1051, University of California at Berkeley, 1999.
- S. T. Leutenegger, M. A. Lopez, and J. Edgington. STR: A simple and efficient algorithm for R-tree packing. In Proc. of the 12th Int’l Conference on Data Engineering, pages 497–506, New Orleans, LA, April 1997.
- D. Lomet and B. Salzberg. The hB-tree: A multiattribute indexing method with good guaranteed performance. ACM Transactions on Database Systems, 15(4):625–658, December 1990. CrossRef
- W. Press, S. Teukolsky, W. Vettering, and B. Flannery. Numerical Recipes in C: The Art of Scientific Computing, 2nd Ed. Cambridge University Press, 1992.
- M. Thomas and J. M. Hellerstein. Boolean boundingpre dicates for spatial access methods. Technical Report UCB//CSD-01-1174, University of California at Berkeley, 2002.
- C. Zou and B. Salzberg. On-line reorganization of sparsely-populated B+-trees. In Proc. of the ACM-SIGMOD Int’l Conference on Management of Data, Montreal, Canada, June 1996.
- Boolean Bounding Predicates for Spatial Access Methods
- Book Title
- Database and Expert Systems Applications
- Book Subtitle
- 13th International Conference, DEXA 2002 Aix-en-Provence, France, September 2–6, 2002 Proceedings
- pp 925-934
- Print ISBN
- Online ISBN
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- Series ISSN
- Springer Berlin Heidelberg
- Copyright Holder
- Springer-Verlag Berlin Heidelberg
- Additional Links
- Industry Sectors
- eBook Packages
- Editor Affiliations
- 4. Université Paul Sabatier, IRIT
- 5. Département Informatique, Université Aix-Marseille II, IUT
- 6. Institute of Applied Computer Science, University of Linz
- Author Affiliations
- 7. Computer Science Division, University of California, Berkeley
To view the rest of this content please follow the download PDF link above.