Boolean Bounding Predicates for Spatial Access Methods
DEXA '02 Proceedings of the 13th International Conference on Database and Expert Systems Applications
| Hi-index | 0.00 |
Designing and tuning access methods (AMs) has always been more of a black art than a rigorous discipline, with performance assessments being mostly reduced to presenting bottom-line runtime or I/O numbers. This paper presents an analysis framework for AMs that defines performance metrics which are more meaningful than bottom-line numbers and thereby allow the AM designer to detect and isolate deficiencies in an AM design. The analysis process takes a workload--a tree and a set of queries--as input and provides metrics that characterize the performance of each query as well as that of the tree structure and the structure-shaping aspects of the AM implementation. Central to the framework is the use of the optimal behavior--which can be approximated relatively efficiently--as a point of reference against which the actual observed performance is measured. The performance metrics themselves reflect the fundamental performance-relevant properties of the input tree. The framework applies to most balanced tree-structured AMs and is not restricted to particular types of of data or queries. It is implemented in "amdb," a comprehensive graphical design tool for AMs that are constructed on top of the Generalized Search Tree abstraction. Amdb complements the analysis framework with visualization and debugging functionality, allowing the AM designer to investigate the source of those deficiencies that were brought to light with the help of the analysis framework.