Article

Free access

Querying aggregate data

Authors:

Stéphane Grumbach,

Maurizio Rafanelli,

Leonardo TinininiAuthors Info & Claims

PODS '99: Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems

Pages 174 - 184

https://doi.org/10.1145/303976.303994

Published: 01 May 1999 Publication History

PDF eReader

References

[1]

M. Benedikt and L. Libkin. On the structure of queries in constraint query languages. In Proceedings 11th IEEE Symposium on Logic in. Computer Science, pages 25-34. IEEE Computer Society Press, 1996.

Digital Library

Google Scholar

[2]

S. Chaudhuri and M. Vardi. Optimization of real conjunctive queries. In Proc. 12th A CM Syrup. on Principles of Database Systems, Washington, May 1993.

Digital Library

Google Scholar

[3]

L. Van den Dries, A. Macintyre, and D. Marker. The elementary theory of restricted analytic fields with exponentiation. Annals of Mathematics, 85, 1994.

Google Scholar

[4]

L. Van den Dries. Remarks on tarski's problem concerning (R, +, ~, cap). In Logic Colloquium. Elsevier, North-Holland, 1982.

Google Scholar

[5]

J. Gray, A. Bosworth, A. Layman, and H. Pirahesh. Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-totals. In Proceed. 12th Intern. Conference on Data Engineering, New Orleans, Louisiana USA, February 1996.

Digital Library

Google Scholar

[6]

S.P. Ghosh. Statistical relational tables for statistical database management. IEEE Transactions on Software Engineering, SE- 12(12):1106-1116, 1986.

Digital Library

Google Scholar

[7]

A. Gupta, V. Harinarayan, and D. Quass. Aggregate-query processing in data warehousing environments. In Proc. of Intl. Conf. on Very Large Data Bases, 1995.

Digital Library

Google Scholar

[8]

S. Grumbach, L. Libkin, T. Milo, and L. Wong. Query languages for bags: Expressive power and complexity. Sigact News, 27(2):30-37, june 1996.

Digital Library

Google Scholar

[9]

V. Harinarayan, A. Rajaraman, and J.D. Ullman. Implementing data cube efficiently. In Proceed. Intern. Conference on Management of Data- SIGMOD '96, Montreal, Canada, 1996.

Digital Library

Google Scholar

[10]

O.H. Ibarra and J. Su. On the containment and equivalence of database queries with linear constraints. In Proc. A CM Syrup. on Principles of Database Systems, 1996.

Digital Library

Google Scholar

[11]

P. Kanellakis, G. Kuper, and P. Revesz. Constraint query languages. In Proc. 9th A CM S'ymp. on Principles of Database Systems, pages 299-313, Nashville, 1990.

Digital Library

Google Scholar

[12]

A.Y. Levy and I.S. Mumick. Reasoning with aggregation constraints. In Proc. of Intl. Conf. on Extending Data Base Technology, pages 514-534, 1996.

Digital Library

Google Scholar

[13]

A.Y. Levy, A.O. Mendelzon, Y. Sagiv, and D. Srivastava. Answering queries using views. In Proc. A CM Symp. on Principles of Database Systems, pages 95-104, 1995.

Digital Library

Google Scholar

[14]

H.-J. Lenz and A. Shoshani. Summarizability in ()lap and statistical data bases. In Proceed. 9th Intern. Conference on Scientific and Statistical Database Management, Olympia, Washington, USA, August 1997.

Digital Library

Google Scholar

[15]

L. Libkin and L. Wong. On the power of aggregation in relational query languages. In Proc. 6th Int. Workshop on database programming languages, 1997.

Digital Library

Google Scholar

[16]

W. Nutt, Y. Sagiv, and S. Shurin. Deciding equivalence among aggregate queries. In Proc. A CM Syrup. on Principles of Database Systems, pages 214-223, 1998.

Digital Library

Google Scholar

[17]

G. Ozsoyoglu, Z.M. Ozsoyoglu, and V. Matos. Extending relational algebra and relational calculus with setvalued attributes and aggregate functions. A CM Transactions on Database Systems, 12(4):566-592, December 1987.

Digital Library

Google Scholar

[18]

M. Rafanelli, A. Bezenchek, and L. Tininini. The aggregate data problem: a system for their definition and management. A CM Sigmod Record, 25(4):8-13. December 1996.

Digital Library

Google Scholar

[19]

J. Renegar. On the computational complexity and geometry of the first-order theory of the reals. Journal of Symbolic Computation, 13:255-352, 1992.

Digital Library

Google Scholar

[20]

M. Rafanelli and F.L. Ricci. Mefisto: a functional model for statistical entities. IEEE Transactions on Knowledge'. and Data Engineering, 5(4):670-681, August 1993.

Digital Library

Google Scholar

[21]

K.A. Ross, D. Srivastava, P.J. Stuckey, and{ S. Sudarshan. Foundations of aggregation constraints. Theoretical Computer Science B, 193(1-2):149-179, 1998.

Digital Library

Google Scholar

[22]

D. Sristava, S. Dar, H.V. Jagadish, and A.Y. Levy. Answering queries with aggre-. gation using views. In Proc. of Intl. Conf. on Very Large Data Bases, pages 318-329, 1996.

Digital Library

Google Scholar

[23]

A. Shoshani. Olap and statistical{ databases: Similarities and differences. In Proceed. Intern. Confer. on Principles of Database Systems, PODS'97, Tucson, Ari. zona, USA, May 1997.

Digital Library

Google Scholar

[24]

S.Y.W. Su. Sam*: A semantic association model for corporate and scientific statisti-. cal databases. Information Sciences, 29(2. 3):151-199, June 1983.

Google Scholar

[25]

A. Shoshani and H.K.T. Wong. Statisti.- cal and scientific database issues. IEEE Transactions on Software Engineering, SD.- 11(10):1040-1047, October 1985.

Digital Library

Google Scholar

Cited By

View all

Zhang CFarouk T(2024)Sharing Queries with Nonequivalent User-defined Aggregate FunctionsACM Transactions on Database Systems10.1145/364913349:2(1-46)Online publication date: 10-Apr-2024
https://dl.acm.org/doi/10.1145/3649133
Tang RWu HHe XBressan S(2015)Valuating Queries for Data Trading in Modern CitiesProceedings of the 2015 IEEE International Conference on Data Mining Workshop (ICDMW)10.1109/ICDMW.2015.11(414-421)Online publication date: 14-Nov-2015
https://dl.acm.org/doi/10.1109/ICDMW.2015.11
Hu YZhai WTian YGao T(2011)Research and Application of Query Rewriting Based on Materialized ViewsInformation and Automation10.1007/978-3-642-19853-3_12(85-91)Online publication date: 2011
https://doi.org/10.1007/978-3-642-19853-3_12
Show More Cited By

Index Terms

Querying aggregate data

Recommendations

Querying data provenance
SIGMOD '10: Proceedings of the 2010 ACM SIGMOD International Conference on Management of data

Many advanced data management operations (e.g., incremental maintenance, trust assessment, debugging schema mappings, keyword search over databases, or query answering in probabilistic databases), involve computations that look at how a tuple was ...
Querying big social data
BNCOD'13: Proceedings of the 29th British National conference on Big Data

Big data poses new challenges to query answering, from computational complexity theory to query evaluation techniques. Several questions arise. What query classes can be considered tractable in the context of big data? How can we make query answering ...
Querying uncertain data with aggregate constraints
SIGMOD '11: Proceedings of the 2011 ACM SIGMOD International Conference on Management of data

Data uncertainty arises in many situations. A common approach to query processing uncertain data is to sample many "possible worlds" from the uncertain data and to run queries against the possible worlds. However, sampling is not a trivial task, as a ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

PODS '99: Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems

May 1999

374 pages

ISBN:1581130627

DOI:10.1145/303976

Chairmen:
Victor Vianu
Univ. of California, San Diego
,
Christos Papadimitriou
Univ. of California, Berkeley

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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 May 1999

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SIGMOD/PODS99

Sponsor:

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

May 31 - June 3, 1999

Pennsylvania, Philadelphia, USA

Acceptance Rates

PODS '99 Paper Acceptance Rate 32 of 116 submissions, 28%;

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

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

38
Total Citations
View Citations
565
Total Downloads

Downloads (Last 12 months)71
Downloads (Last 6 weeks)17

Reflects downloads up to 04 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Zhang CFarouk T(2024)Sharing Queries with Nonequivalent User-defined Aggregate FunctionsACM Transactions on Database Systems10.1145/364913349:2(1-46)Online publication date: 10-Apr-2024
https://dl.acm.org/doi/10.1145/3649133
Tang RWu HHe XBressan S(2015)Valuating Queries for Data Trading in Modern CitiesProceedings of the 2015 IEEE International Conference on Data Mining Workshop (ICDMW)10.1109/ICDMW.2015.11(414-421)Online publication date: 14-Nov-2015
https://dl.acm.org/doi/10.1109/ICDMW.2015.11
Hu YZhai WTian YGao T(2011)Research and Application of Query Rewriting Based on Materialized ViewsInformation and Automation10.1007/978-3-642-19853-3_12(85-91)Online publication date: 2011
https://doi.org/10.1007/978-3-642-19853-3_12
Nash ASegoufin LVianu V(2010)Views and queriesACM Transactions on Database Systems10.1145/1806907.180691335:3(1-41)Online publication date: 30-Jul-2010
https://dl.acm.org/doi/10.1145/1806907.1806913
DeHaan DParedaens JSu J(2009)Equivalence of nested queries with mixed semanticsProceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems10.1145/1559795.1559828(207-216)Online publication date: 29-Jun-2009
https://dl.acm.org/doi/10.1145/1559795.1559828
Machlin RKolaitis PLibkin L(2007)Index-based multidimensional array queriesProceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems10.1145/1265530.1265555(175-184)Online publication date: 11-Jun-2007
https://dl.acm.org/doi/10.1145/1265530.1265555
Cohen SNutt WSagiv Y(2007)Deciding equivalences among conjunctive aggregate queriesJournal of the ACM10.1145/1219092.121909354:2(5-es)Online publication date: 1-Apr-2007
https://dl.acm.org/doi/10.1145/1219092.1219093
Malvestuto FMezzini MMoscarini M(2007)An analytical approach to the inference of summary data of additive typeTheoretical Computer Science10.1016/j.tcs.2007.07.004385:1-3(264-285)Online publication date: 1-Oct-2007
https://dl.acm.org/doi/10.1016/j.tcs.2007.07.004
Nash ASegoufin LVianu V(2007)Determinacy and rewriting of conjunctive queries using viewsProceedings of the 11th international conference on Database Theory10.1007/11965893_5(59-73)Online publication date: 10-Jan-2007
https://dl.acm.org/doi/10.1007/11965893_5
Cohen SNutt WSagiv Y(2006)Rewriting queries with arbitrary aggregation functions using viewsACM Transactions on Database Systems10.1145/1138394.113840031:2(672-715)Online publication date: 1-Jun-2006
https://dl.acm.org/doi/10.1145/1138394.1138400
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

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

Cited By

Index Terms

Recommendations

Querying data provenance

Querying big social data

Querying uncertain data with aggregate constraints