Paper Info
Title
Array-based evaluation of multi-dimensional queries in object-relational database systems
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
Year
DOI
Venue
1998
10.1109/ICDE.1998.655782
Orlando, FL
Keywords
Field
DocType
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
Abstract data type,Data mining,Data structure,Algorithm design,Relational database,Object-relational database,Computer science,Theoretical computer science,Bitmap,Data compression,Database,Multidimensional systems
Conference
ISSN
ISBN
Citations 
1063-6382
0-8186-8289-2
15
PageRank 
References 
Authors
16.83
10
4
Name
Order
Citations
PageRank
Yihong Zhao111039.34
Karthikeyan Ramasamy237687.48
Kristin Tufte31241146.09
Jeffrey F. Naughton483631913.71