Array-based evaluation of multi-dimensional queries in object-relational database systems

Author

Zhao, Yihong ; Ramasamy, Karthikeyan ; Tufte, Kristin ; Naughton, Jeffrey F.

Author_Institution

Wisconsin Univ., Madison, WI, USA

fYear

1998

fDate

23-27 Feb 1998

Firstpage

241

Lastpage

249

Abstract

Since multi-dimensional arrays are a natural data structure for supporting multi-dimensional queries, and object-relational (O/R) database systems support multi-dimensional array ADTs (abstract data types), it is natural to ask if a multi-dimensional array-based ADT can be used to improve O/R DBMS performance on multi-dimensional queries. As an initial step toward answering this question, we have implemented a multi-dimensional array in the Paradise O/R DBMS. In this paper, we describe the implementation of this compressed-array ADT and explore its performance for queries including star-join consolidations and selections. We show that, in many cases, the array ADT can provide significantly higher performance than can be obtained by applying techniques such as bitmap indices and star-join algorithms to relational tables

Keywords

abstract data types; arrays; data compression; object-oriented databases; query processing; relational databases; software performance evaluation; DBMS performance; Paradise; array-based query evaluation; compressed-array abstract data type; multi-dimensional array data structures; multi-dimensional queries; object-relational database systems; performance; selections; star-join consolidations; Algorithm design and analysis; Contracts; Data analysis; Data structures; Database systems; Delay; Multidimensional systems; Performance analysis; Relational databases; System testing;

fLanguage

English

Publisher

ieee

Conference_Titel

Data Engineering, 1998. Proceedings., 14th International Conference on

Conference_Location

Orlando, FL

ISSN

1063-6382

Print_ISBN

0-8186-8289-2

Type

conf

DOI

10.1109/ICDE.1998.655782

Filename

655782