Abstract
Our thesis investigates the UB-Tree, a multidimensional access method, and its applicability for relational database management systems (RDBMS). In the thesis, we introduce a formal model for multidimensional partitioned relations and discuss several typical query patterns. The model identifies the significance of multidimensional range queries and sort operations. After describing the UB-Tree and its standard algorithms for insertion, deletion, point queries, and range queries, we introduce the spiral algorithm for nearest neighbour queries with UB-Trees and the Tetris algorithm for efficient access to a table in arbitrary sort order. We then describe the complexity of the involved algorithms and give solutions to selected algorithmic problems for a prototype implementation of UB-Trees on top of several RDBMSs. A cost model for sort operations with and without range restrictions is used both for analyzing our algorithms and for comparing UB-Trees with state-of-the-art query processing. Performance comparisons with traditional access methods practically confirm the theoretically expected superiority of UB-Trees and our algorithms over traditional access methods: Query processing in RDBMS is accelerated by several orders of magnitude, while the resource requirements in main memory space and disk space are substantially reduced. Benchmarks on some queries of the TPC-D benchmark as well as the data warehousing scenario of a fruit juice company illustrate the potential impact of our work on relational algebra, SQL, and commercial applications.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
R. Bayer. The universal B-Tree for multidimensional Indexing. Technical Report TUM-I9637, Institut für Informatik, TU München, 1996
S. Chaudhuri and U. Dayal. An Overview of Data Warehousing and OLAP Technologies. ACM SIGMOD Record 26(1),1997
C. Chan and Y. Ioannidis. Bitmap Index Design and Evaluation. Proc. ACM SIGMOD Intl. Conf. On Management of Data, 1998.
V. Gaede and O. Günther. Multidimensional Access Methods. Humboldt Universität, Berlin, 1997.
H. Gupta, V. Harinarayan, A. Rajaraman, and D. Ullman. Index Selection for OLAP. Proc. Intl. Conf. on Data Engineering, 1997
H.V. Jagadish. Linear Clustering of Objects with multiple Attributes. ACM SIGMOD Intl. Conference on Management of Data, pp. 332 – 342. 1990.
R. Kimball. The Data Warehouse Toolkit. John Wiley & Sons, New York. 1996.
V. Markl. MISTRAL: Processing Relational Queries using a Multidimensional Access Method. Ph.D. Thesis, Technische Universität München, 1999.
V. Markl, M. Zirkel, and R. Bayer. Processing Operations with Restrictions in Relational Database Management Systems without external Sorting. Proc. ICDE, Sydney, 1999.
J. A. Orenstein and T.H. Merret. A Class of Data Structures for Associate Searching. Proc. ACM SIGMOD Intl. Conf. on Management of Data, Portland, Oregon, pp. 294–305, 1984.
P. O’Neill and D. Quass. Improved Query Performance with Variant Indexes. ACM SIGMOD Intl. Conf. On Management of Data, Tucson, Arizona, pp. 38–49, 1997.
S. Sarawagi. Indexing OLAP data. Data Engineering Bulletin 20 (1), pp. 36–43, 1997.
A. Shukla, P. Deshpande, and J. Naughton. Materialized View Selection for Multidimensional Datasets. Proc. ACM SIGMOD Intl. Conf. On Management of Data, 1998.
M.C.Wu and A.P. Buchmann. Encoded Bitmap Indexing for Data Warehouses. ICDE, Orlando, 1998.
J. Widom. Research Problems in Data Warehousing. Proc. of 4th CIKM, November 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 B. G. Teubner GmbH, Stuttgart/Leipzig/Wiesbaden
About this chapter
Cite this chapter
Markl, V. (2000). MISTRAL: Processing Relational Queries using a Multidimensional Access Technique. In: Fiedler, H., et al. Ausgezeichnete Informatikdissertationen 1999. GI-Dissertationspreis. Vieweg+Teubner Verlag. https://doi.org/10.1007/978-3-322-84823-9_15
Download citation
DOI: https://doi.org/10.1007/978-3-322-84823-9_15
Publisher Name: Vieweg+Teubner Verlag
Print ISBN: 978-3-519-02650-1
Online ISBN: 978-3-322-84823-9
eBook Packages: Springer Book Archive