Database and Expert Systems Applications

Volume 2453 of the series Lecture Notes in Computer Science pp 925-934


Boolean Bounding Predicates for Spatial Access Methods

Extended Abstract
  • Megan ThomasAffiliated withComputer Science Division, University of California
  • , Joseph M. HellersteinAffiliated withComputer Science Division, University of California

* Final gross prices may vary according to local VAT.

Get Access


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.