Article

How to evaluate multiple range-sum queries progressively

Authors:

Rolfe R. Schmidt,

Cyrus ShahabiAuthors Info & Claims

PODS '02: Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems

Pages 133 - 141

https://doi.org/10.1145/543613.543630

Published: 03 June 2002 Publication History

Abstract

Users of decision support system typically submit batches of range-sum queries simultaneously rather than issuing individual, unrelated queries. We propose a wavelet based technique that exploits T/O sharing across a query batch to evaluate the set of queries progressively and efficiently. The challenge is that now controlling the structure of errors across query results becomes more critical than minimizing error per individual query. Consequently, we define a class of structural error penalty functions and show how they are controlled by our technique Experiments demonstrate that our technique is efficient as an exact algorithm, and the progressive estimates are accurate, even after less than one I/O per query.

References

[1]

K. Chakrabarti, M. N. Garofalakis, R. Rastogi, and K. Shim. Approximate query processing using wavelets. In VLDB 2000, Proceedings of 26th International Conference on Very Large Data Bases, pages 111-122, 2000.]]

Digital Library

[2]

C.-Y. Chan and Y. E. Ionnidis. Hierarchical cubes for range-sum queries. In VLDB 1999, Proc. of 25th International Conference on Very Large Data Bases, pages 675-686, 1999.]]

Digital Library

[3]

S. Geffner, D. Agrawal, and A. E. Abbadi. The dynamic data cube. In EDBT 2000, 7th International Conference on Extending Database Technology, volume 1777 of Lecture Notes in Computer Science, pages 237-253. Springer, 2000.]]

Digital Library

[4]

A. C. Gilbert, Y. Kotidis, S. Muthukrishnan, and M. J. Strauss. Optimal and approximate computation of summary statistics for range aggregates. In PODS 2001, Proceedings of the Twenteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 228-237, 2001.]]

Digital Library

[5]

A. C. Gilbert, Y. Kotidis, S. Muthukrishnan, and M. J. Strauss. Surfing wavelets on streams: One-pass summaries for approximate aggregate queries. In VLDB 2001, Proceedings of 27th International Conference on Very Large Data Bases, 2001.]]

Digital Library

[6]

D. Gunopulos, G. Kollios, V. J. Tsotras, and C. Domeniconi. Approximating multi-dimensional aggregate range queries over real attributes. In SIGMOD 2000, Proceedings ACM SIGMOD International Conference on Management of Data, pages 463-474, 2000.]]

Digital Library

[7]

J. M. Hellerstein, P. J. Haas, and H. Wang. Online aggregation. In SIGMOD 1997, Proceedings ACM SIGMOD International Conference on Management of Data, pages 171-182. ACM Press, 1997.]]

Digital Library

[8]

C. Ho, R. Agrawal, N. Megiddo, and R. Srikant. Range queries in OLAP data cubes. In SIGMOD 1997, Proceedings ACM SIGMOD International Conference on Management of Data, pages 73-88. ACM Press, 1997.]]

Digital Library

[9]

I. Lazaridis and S. Mehrotra. Progressive approximate aggregate queries with a multi-resolution tree structure. In SIGMOD 2001, Proceedings ACM SIGMOD International Conference on Management of Data, pages 401-412, 2001.]]

Digital Library

[10]

V. Poosala and V. Ganti. Fast approximate answers to aggregate queries on a data cube. In SSDBM 1999, 11th International Conference on Scientific and Statistical Database Management, pages 24-33. IEEE Computer Society, 1999.]]

Digital Library

[11]

M. Riedewald, D. Agrawal, and A. E. Abbadi. pCube: Update-efficient online aggregation with progressive feedback. In SSDBM 2000, Proceedings of the 12th International Conference on Scientific and Statistical Database Management, pages 95-108, 2000.]]

Digital Library

[12]

M. Riedewald, D. Agrawal, and A. E. Abbadi. Flexible data cubes for online aggregation. In ICDT 2001, 8th International Conference on Database Theory, pages 159-173, 2001.]]

Digital Library

[13]

R. R. Schmidt and C. Shahabi. Wavelet based density estimators for modeling OLAP data sets. In SIAM Workshop on Mining Scientific Datasets, Chicago, April 2001. Available at http://infolab.usc.edu/publication.html.]]

[14]

R. R. Schmidt and C. Shahabi. Propolyne: A fast wavelet-based technique for progressive evaluation of polynomial range-sum queries. In Advances in Database Technology - EDBT 2002, 8th International Conference on Extending Database Technology, Lecture Notes in Computer Science. Springer, 2002.]]

Digital Library

[15]

J. Shanmugasundaram, U. Fayyad, and P. Bradley. Compressed data cubes for OLAP aggregate query approximation on continuous dimensions. In Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, August 1999.]]

Digital Library

[16]

S.-C. Shao. Multivariate and multidimensional OLAP. In Advances in Database Technology - EDBT'98, 6th International Conference on Extending Database Technology, volume 1377 of Lecture Notes in Computer Science, pages 120-134. Springer, 1998.]]

Digital Library

[17]

J. S. Vitter and M. Wang. Approximate computation of multidimensional aggregates of sparse data using wavelets. In SIGMOD 1999, Proceedings of the ACM SIGMOD International Conference on the Management of Data, pages 193-204. ACM Press, 1999.]]

Digital Library

[18]

Y.-L. Wu, D. Agrawal, and A. E. Abbadi. Using wavelet decomposition to support progressive and approximate range-sum queries over data cubes. In CIKM 2000, Proceedings of the 9th Interntationall Conference on Information and Knowledge Management, pages 414-421. ACM, 2000.]]

Digital Library

[19]

Y. Zhao, P. Deshpande, J. F. Naughton, and A. Shukla. Simultaneous optimization and evaluation of multiple dimensional queries. In SIGMOD 1998, Proceedings ACM SIGMOD International Conference on Management of Data, pages 271-282. ACM Press, 1998.]]

Digital Library

Cited By

Tao YSheng C(2014)I/O-Efficient Bundled Range AggregationIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2013.15226:6(1521-1531)Online publication date: 1-Jun-2014
https://dl.acm.org/doi/10.1109/TKDE.2013.152
Shahabi CJahangiri MBanaei-Kashani F(2008)ProDAComputer10.1109/MC.2008.13041:4(69-77)Online publication date: 1-Apr-2008
https://dl.acm.org/doi/10.1109/MC.2008.130
Banaei-Kashani FShahabi C(2004)Searchable Querical Data NetworksDatabases, Information Systems, and Peer-to-Peer Computing10.1007/978-3-540-24629-9_3(17-32)Online publication date: 2004
https://doi.org/10.1007/978-3-540-24629-9_3

Index Terms

How to evaluate multiple range-sum queries progressively
1. Applied computing
  1. Computers in other domains
    1. Personal computers and PC applications
2. Information systems
  1. Data management systems
    1. Database design and models
      1. Relational database model
    2. Query languages
      1. Relational database query languages
  2. Information systems applications

Recommendations

Scalable and efficient processing of top-k multiple-type integrated queries
Abstract
In this paper, we define a new class of queries, the top-k multiple-type integrated query (simply, top-k MULTI query). It deals with multiple data types and finds the information in the order of relevance between the query and the object. Various ...
Inner-product based wavelet synopses for range-sum queries
ESA'06: Proceedings of the 14th conference on Annual European Symposium - Volume 14

In recent years wavelet based synopses were shown to be effective for approximate queries in database systems. The simplest wavelet synopses are constructed by computing the Haar transform over a vector consisting of either the raw-data or the prefix-...
Range queries on uncertain data

Given a set P of n uncertain points on the real line, each represented by its one-dimensional probability density function, we consider the problem of building data structures on P to answer range queries of the following three types for any query ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PODS '02: Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems

June 2002

311 pages

ISBN:1581135076

DOI:10.1145/543613

Conference Chair:
Lucian Popa
IBM Almaden Research Center
,
General Chair:
Serge Abiteboul
INRIA
,
Program Chair:
Phokion G. Kolaitis
UC Santa Cruz & IBM Almaden Research Center

Copyright © 2002 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 03 June 2002

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SIGMOD/PODS02

Sponsor:

SIGMOD/PODS02: International Conference on Management of Data and Symposium on Principles Database and Systems

June 3 - 5, 2002

Wisconsin, Madison

Acceptance Rates

PODS '02 Paper Acceptance Rate 24 of 109 submissions, 22%;

Overall Acceptance Rate 642 of 2,707 submissions, 24%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
326
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to 11 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Tao YSheng C(2014)I/O-Efficient Bundled Range AggregationIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2013.15226:6(1521-1531)Online publication date: 1-Jun-2014
https://dl.acm.org/doi/10.1109/TKDE.2013.152
Shahabi CJahangiri MBanaei-Kashani F(2008)ProDAComputer10.1109/MC.2008.13041:4(69-77)Online publication date: 1-Apr-2008
https://dl.acm.org/doi/10.1109/MC.2008.130
Banaei-Kashani FShahabi C(2004)Searchable Querical Data NetworksDatabases, Information Systems, and Peer-to-Peer Computing10.1007/978-3-540-24629-9_3(17-32)Online publication date: 2004
https://doi.org/10.1007/978-3-540-24629-9_3

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten