ACM SIGMOD Anthology ACM SIGMOD dblp.uni-trier.de

Simultaneous Optimization and Evaluation of Multiple Dimensional Queries.

Yihong Zhao, Prasad Deshpande, Jeffrey F. Naughton, Amit Shukla: Simultaneous Optimization and Evaluation of Multiple Dimensional Queries. SIGMOD Conference 1998: 271-282
@inproceedings{DBLP:conf/sigmod/ZhaoDNS98,
  author    = {Yihong Zhao and
               Prasad Deshpande and
               Jeffrey F. Naughton and
               Amit Shukla},
  editor    = {Laura M. Haas and
               Ashutosh Tiwary},
  title     = {Simultaneous Optimization and Evaluation of Multiple Dimensional
               Queries},
  booktitle = {SIGMOD 1998, Proceedings ACM SIGMOD International Conference
               on Management of Data, June 2-4, 1998, Seattle, Washington, USA},
  publisher = {ACM Press},
  year      = {1998},
  isbn      = {0-89791-995-5},
  pages     = {271-282},
  ee        = {http://doi.acm.org/10.1145/276304.276329, db/conf/sigmod/ZhaoDNS98.html},
  crossref  = {DBLP:conf/sigmod/98},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

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 pre-computed group-bys, and the design of efficient storage structures for multidimensional data. However, to date there has been little or no work 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 has 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 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. In our performance study, we compare the three algorithms.

Copyright © 1998 by the ACM, Inc., used by permission. Permission to make digital or hard copies is granted provided that copies are not made or distributed for profit or direct commercial advantage, and that copies show this notice on the first page or initial screen of a display along with the full citation.


ACM SIGMOD DiSC

CDROM Version: Load the CDROM "DiSC, Volume 1 Number 1" and ... Online Version (ACM WWW Account required): Full Text in PDF Format

ACM SIGMOD Anthology

DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...

Printed Edition

Laura M. Haas, Ashutosh Tiwary (Eds.): SIGMOD 1998, Proceedings ACM SIGMOD International Conference on Management of Data, June 2-4, 1998, Seattle, Washington, USA. ACM Press 1998, ISBN 0-89791-995-5 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML, SIGMOD Record 27(2), June 1998
Contents

Online Edition: ACM SIGMOD

[Abstract]
[Full Text (Postscript)]

References

[CS94]
Surajit Chaudhuri, Kyuseok Shim: Including Group-By in Query Optimization. VLDB 1994: 354-366 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[CR96]
Damianos Chatziantoniou, Kenneth A. Ross: Querying Multiple Features of Groups in Relational Databases. VLDB 1996: 295-306 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[DKLPY94]
David J. DeWitt, Navin Kabra, Jun Luo, Jignesh M. Patel, Jie-Bing Yu: Client-Server Paradise. VLDB 1994: 558-569 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[HRU96]
Venky Harinarayan, Anand Rajaraman, Jeffrey D. Ullman: Implementing Data Cubes Efficiently. SIGMOD Conference 1996: 205-216 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[GHQ95]
Ashish Gupta, Venky Harinarayan, Dallan Quass: Aggregate-Query Processing in Data Warehousing Environments. VLDB 1995: 358-369 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[MS]
...
[OQ97]
Patrick E. O'Neil, Dallan Quass: Improved Query Performance with Variant Indexes. SIGMOD Conference 1997: 38-49 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[PS88]
Jooseok Park, Arie Segev: Using Common Subexpressions to Optimize Multiple Queries. ICDE 1988: 311-319 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[S88]
Timos K. Sellis: Multiple-Query Optimization. ACM Trans. Database Syst. 13(1): 23-52(1988) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[SS94]
Kyuseok Shim, Timos K. Sellis, Dana S. Nau: Improvements on a Heuristic Algorithm for Multiple-Query Optimization. Data Knowl. Eng. 12(2): 197-222(1994) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[SM94]
Sunita Sarawagi, Michael Stonebraker: Efficient Organization of Large Multidimensional Arrays. ICDE 1994: 328-336 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[Su96]
...
[YL95]
Weipeng P. Yan, Per-Åke Larson: Eager Aggregation and Lazy Aggregation. VLDB 1995: 345-357 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[ZTN96]
...

Copyright © Fri Mar 12 17:21:34 2010 by Michael Ley (ley@uni-trier.de)