Multidimensional Index Structures in Relational Databases

Abstract. Efficient query processing is one of the basic needs for data mining algorithms. Clustering algorithms, association rule mining algorithms and OLAP tools all rely on efficient query processors being able to deal with high-dimensional data. Inside such a query processor, multidimensional index structures are used as a basic technique. As the implementation of such an index structure is a difficult and time-consuming task, we propose a new approach to implement an index structure on top of a commercial relational database system. In particular, we map the index structure to a relational database design and simulate the behavior of the index structure using triggers and stored procedures. This can be easily done for a very large class of multidimensional index structures. To demonstrate the feasibility and efficiency, we implemented an X-tree on top of Oracle 8. We ran several experiments on large databases and recorded a performance

• Type: Journal
• Year: 2000
• Where: JIIS
• Authors: Christian Böhm, Stefan Berchtold, Hans-Peter Kriegel, Urs Michel
• Keywords: Index Structures, JIIS 2000, Multidimensional Index Structures, Query Processor