ACM Home Page
Please provide us with feedback. Feedback
Simultaneous optimization and evaluation of multiple dimensional queries
Full text PdfPdf (1.52 MB)
Source International Conference on Management of Data archive
Proceedings of the 1998 ACM SIGMOD international conference on Management of data table of contents
Seattle, Washington, United States
Pages: 271 - 282  
Year of Publication: 1998
ISBN:0-89791-995-5
Also published in ...
Authors
Yihong Zhao  Computer Sciences Department, University of Wisconsin, Madison
Prasad M. Deshpande  Computer Sciences Department, University of Wisconsin, Madison
Jeffrey F. Naughton  Computer Sciences Department, University of Wisconsin, Madison
Amit Shukla  Computer Sciences Department, University of Wisconsin, Madison
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 61,   Citation Count: 22
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/276304.276329
What is a DOI?

ABSTRACT

Database researchers have made significant progress on several research issues related to multidimensional data analysis, including the development of fast cubing algorithms, efficient schemes for creating and maintaining precomputed group-bys, and the design of efficient storage structures for multidimensional data. However, to date there has been little or no work on multidimensional query optimization. Recently, Microsoft has proposed “OLE DB for OLAP” as a standard multidimensional interface for databases. OLE DB for OLAP defines Multi-Dimensional Expressions (MDX), which have the interesting and challenging feature of allowing clients to ask several related dimensional queries in a single MDX expression. In this paper, we present three algorithms to optimize multiple related dimensional queries. Two of the algorithms focus on how to generate a global plan from several related local plans. The third algorithm focuses on generating a good global plan without first generating local plans. We also present three new query evaluation primitives that allow related query plans to share portions of their evaluation. Our initial performance results suggest that the exploitation of common subtask evaluation and global optimization can yield substantial performance improvements when relational database systems are used as data sources for multidimensional analysis.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
CS94
 
CR96
 
DKLPY94
HRU96
 
GHQ95
 
MS
Microsoft Corporated. "OLE DB for OLAP Design Specification- Beta 2". http://www, mlcrosoft, corn / data/ oledb / olap / pro dinfo, ht ml
OQ97
 
PS88
S88
 
SS94
 
SM94
 
Su96
 
YL95
 
ZTN96
Y.H. Zhao, K. Tufte, and J.F. Naughton. "On the Performance of an Array-Based ADT for OLAP Workloads". Technical Report CS-TR-96-1313, University of Wisconsin-Madison, CS Department, May 1996.

CITED BY  22

Collaborative Colleagues:
Yihong Zhao: colleagues
Prasad M. Deshpande: colleagues
Jeffrey F. Naughton: colleagues
Amit Shukla: colleagues