Article

Free access

Deciding containment for queries with complex objects (extended abstract)

Authors:

Alon Y. Levy,

Dan SuciuAuthors Info & Claims

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

Pages 20 - 31

https://doi.org/10.1145/263661.263665

Published: 01 May 1997 Publication History

PDF eReader

References

[1]

Serge Abiteboul and Catriel Beeri. On the power of languages for the manipulation of complex objects. VLDB Journal, October 1995.

Digital Library

Google Scholar

[2]

Serge Abiteboul, Richard Hull, and Victor Vianu. Foundations of databases. Addison W~sley Publishhag Co, 1995.

Digital Library

Google Scholar

[3]

Alfred Aho, Yehoshua Sagiv, and Jeffrey D. Ullman. Equivalence of relational expre&sions. SIAM Journal of Computing, (8)2:218-246, 1979.

Digital Library

Google Scholar

[4]

N. Bidoit. The Verso algebra or How to ansower queries with fewer joins. Journal of Computer and System Sciences, 35(3):321-364, 1987.

Digital Library

Google Scholar

[5]

Peter Btmeman, Susan Davidson, Mary Fernandez, and Dan Suciu. Adding structure to unstructured data. In 1CDT, 1997.

Google Scholar

[6]

Peter Buneman, Susan Davidson, Gerd Hillebrand, and Dan Suciu. A query language and optimization techniques for unstructured data. In SIGMOD, 1996.

Digital Library

Google Scholar

[7]

Peter Buneman, Shamim Naqvi, Val Tannen, and Limsoon Wong. Principles of proramming with collection types. Theordic~l Computer Science., 1995.

Digital Library

Google Scholar

[8]

Peter Buneman, Atst~shi Ohori, and Achim June. Using powerdomains to generalize relational databases. Theoretical Computer Science, 91:23- 55, 1991.

Digital Library

Google Scholar

[9]

R. G. G. Cattell, editor. The Obja:t Database Standard: ODMG-93. Morgan Kanfmann, San Marco, California, 1994.

Digital Library

Google Scholar

[10]

Edward P. Chan. Containment and minimization of positive conjunctive queries in oodb's. In ACM PODS, 1992.

Digital Library

Google Scholar

[11]

A.K. Chandra and P.M. Merlin. Optimal implementation of conjunctive queries in relational databases. In Proceedings of the Ninth Annual A CM Symposium on Theory of Computing, 1977.

Digital Library

Google Scholar

[12]

Surajit Chaudhuri, Ravi Kr~shnamurthy, Spyros Potamianos, and Kyuseok Shim. Optimizing queries with materialized views. In Proceedings of ICDE, 1995.

Digital Library

Google Scholar

[13]

Surajit Chandhuri and Kyuseok Shim. Including group-by in query optimization. In Proceedings of the 20th VLDB Conference, Santiago, Chile, 1994.

Digital Library

Google Scholar

[14]

Surajit Chandhuri and Moshe Vardi. On the equivalence of recursive and nonrecursive datalog programs. In ACM PODS, 1992.

Digital Library

Google Scholar

[15]

Surajit Chaudhuri and Moshe Vardi. Optimizing real conjunctive queries. In ACM PODS, 1993.

Digital Library

Google Scholar

[16]

La~ha S. Colby. Query Languages and a Unify. ing Framework for Non-traditional Data Models. Phi:) thesis, Computer Science Department, Indiana University, Bloomington, indiana 47405-4101, May 1993. Available as Indiana University Computer Science Technical Report 38I.

Digital Library

Google Scholar

[17]

Umesh Dayal. Of nests and tree~s: A unified approach to processing queries that contain nested subqueries, aggregates, and quantifiers. In Proceedings of VLDB-87, pages pages 197-208, 1987.

Digital Library

Google Scholar

[18]

Jan Van den Bussche. Complex object manipulation through identifiers: An algebraic perspective. Technical Report 92-41, University of Antwerp, Department of Mathematics and Computer Science, Universiteitsplein 1, B-2610 Antwerp, Belgium, September 1992.

Google Scholar

[19]

D. Dreben and W. D. Goldfarb. The Decision Problem: Solvable Classes of Quantificational Formulas. AddLson-Wesley, 1979.

Google Scholar

[20]

Heinz-Dieter Ebbinghaus and JSrg Flum. Finite Model Theory. Springer, 1995.

Crossref

Google Scholar

[21]

Dirk Van Gucht and Patrick C. Fischer. Multilevel n~sted relational structures. Journal of Computer and System Sciences, 36:77-105, 1988.

Digital Library

Google Scholar

[22]

Carl A. Gunter and Dana S. Scott. Semantic domains. In Formal Models and Semantics, volume B of Handbook of Theoretical Computer Science, Chapter 12, pages 635--674. 1990.

Digital Library

Google Scholar

[23]

Ashish Gupta, Yehoshua Sagiv, Jeffrey D. Ullman, and Jennifer Widom. Constraint checldng with parial information. In ACM PODS, 1994.

Digital Library

Google Scholar

[24]

Mare Gyasens, Jan Paredaens, and Dirk Van Gucht. On a hierarchy of classes for nested databases. Information Processing Letter~, 36:259- 266, 1990.

Digital Library

Google Scholar

[25]

Mare Gyssens, Dan Suciu, and Dirk Van Gucht. On polynomially bounded fix-point constructs for nested relations. In Proceedings of DBPL'95, Gubbio, Italy, September 1995.

Google Scholar

[26]

A. Klug. On conjunctive queries containing inequalities. Journal of the A CM, pages 35(1): 146- 160, 1988.

Digital Library

Google Scholar

[27]

Alon Y. Levy, Alberto O. Mendelzon, Yehoshua Sagiv, and Divesh Srivastava. Answering queries using views. In ACM PODS, 1995.

Digital Library

Google Scholar

[28]

Alon Y. Levy and Inderpal Singh Mumick. Reasoning with aggregation constraints. In Proceedings of EDBT-96, March 1996.

Digital Library

Google Scholar

[29]

Alon Y. Levy, Inderpal Singh Mumick, and Yehoshua Sag-iv. Query optimization by predicate move-around. In Proceedings of the 20th VLDB Conference, Santiago, Chile. pages 96-107, 1994.

Digital Library

Google Scholar

[30]

Alon Y. Levy and Marie-Christine Rousset. CAR/N: a representation language integrating rules and description logics. In Proceedings of the European Conference on Artificial Intelligence, Budapest, Hungary, 1996.

Google Scholar

[31]

Alon Y. Levy and Yehoshua Sagiv. Queries independent of updates, in Proceedings of the 19th VbDB Conference, Dublin, Ireland, 1993.

Digital Library

Google Scholar

[32]

Leonid Libkin and Limsoon Wong. Semantic representations and query languages for orsets. In Proeeedings of 12th A CM Symposium on Principles of Database Systems, Washington, D. C., 1993.

Digital Library

Google Scholar

[33]

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

Digital Library

Google Scholar

[34]

Jan Paredaens and Dirk Van Gucht. Converting nested relational algebra expressions into fiat algebra expressions. A CM Transaction on Database Systems, 17(1):65-93, March 1992.

Digital Library

Google Scholar

[35]

Kenneth Ross, Divesh Srivastava, Peter Stuckey, and S. Sudarshan. FoundatiorLs of aggregation constraints. In Alan Boming, editor, Principles and Practice of Constraint Programming. Lecture Notes in Computer Science, 874. Springer Verlag, 1994.

Digital Library

Google Scholar

[36]

Y. Sagiv and M. Yannakakis. Equivalence among relational expre~siov.s with the union and differenee operators. Journal of the A GM, 27(4):633- 655~ 1981.

Digital Library

Google Scholar

[37]

Yehoshua Sagiv. Optimizing datalog programs. In Jack Minker, editor, Foundations of Deductive Databases and Logic Programming, pagea 659--698. Morgan Kaufmann, Los Altos, CA, 1988.

Digital Library

Google Scholar

[38]

Oded Shmueli. Equivalence of datalog querias is undecidable. Journal of Logic Prooramming, 15:231- 241~ 1993.

Digital Library

Google Scholar

[39]

Dan Sueiu. Fix-points and bounded fixpoint.s for complex objects. In Catriel Beeri, Atsushi Ohori, and Dennis Shasha, editors, Proc~.edings of 4th International Workshop on Database Programming Languages, New York, August 1993, Springer- Verlag, January 1994.

Digital Library

Google Scholar

[40]

S. J. Thomas and P. C. Fischer. Nested relational structures. In P. C. Kanellalds and F. P. Preparata, editors, Advances in Computing Re.search: The Theory of Databases, pages 269-307, London, England, 1986. JAI Press.

Google Scholar

[41]

Jeffrey D. Ullman. Principles of Database and Knowledge.base Systems, Volumes I, II. Computer Science Press, Rockville MD, 1989.

Digital Library

Google Scholar

[42]

Ron van der Meyden. The complexity of querying indefinite data about linearly ordered domains. In ACM PODS, 1992.

Digital Library

Google Scholar

[43]

Limsoon Wong. Normal forms and conservative properties for query languagas over collection types. In ACM PODS, 1993.

Digital Library

Google Scholar

[44]

X. Zhang and M. Z. Ozsoyoglu. On efficient reasoning with implication cov~straints, in Proeee~lings of DOOD, 1993.

Google Scholar

Cited By

View all

Spasić MVujošević Janičić M(2023)Solving the SPARQL query containment problem with SpeCSWeb Semantics: Science, Services and Agents on the World Wide Web10.1016/j.websem.2022.10077076:COnline publication date: 1-Apr-2023
https://dl.acm.org/doi/10.1016/j.websem.2022.100770
Koch CLupei DTannen VMilo TTan W(2016)Incremental View Maintenance For Collection ProgrammingProceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/2902251.2902286(75-90)Online publication date: 15-Jun-2016
https://dl.acm.org/doi/10.1145/2902251.2902286
Benedikt MPuppis GVu H(2015)The complexity of higher-order queriesInformation and Computation10.1016/j.ic.2015.07.003244:C(172-202)Online publication date: 1-Oct-2015
https://dl.acm.org/doi/10.1016/j.ic.2015.07.003
Show More Cited By

Index Terms

Deciding containment for queries with complex objects (extended abstract)

Recommendations

Decidable containment of recursive queries
Database theory

One of the most important reasoning tasks on queries is checking containment, i.e., verifying whether one query yields necessarily a subset of the result of another one. Query containment is crucial in several contexts, such as query optimization, query ...
Containment of nested XML queries
VLDB '04: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30

Query containment is the most fundamental relationship between a pair of database queries: a query Q is said to be contained in a query Q′ if the answer for Q is always a subset of the answer for Q′, independent of the current state of the database. ...
Decidable Containment of Recursive Queries
ICDT '03: Proceedings of the 9th International Conference on Database Theory

One of the most important reasoning tasks on queries is checking containment, i.e., verifying whether one query yields necessarily a subset of the result of another one. Query containment, is crucial in several contexts, such as query optimization, ...

Comments

Information & Contributors

Information

Published In

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

May 1997

272 pages

ISBN:0897919106

DOI:10.1145/263661

Chairmen:
Alberto Mendelzon
Univ. of Toronto, Toronto, Ont., Canada
,
Z. Meral Özsoyoglu
Case Western Reserve Univ., Cleveland, OH

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 1997

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SIGMOD/PODS97

Sponsor:

SIGMOD

SIGMOD/PODS97: Joint ACM SIGMOD International Conference on Management of Data and ACM Symposium on Principles of Database Systems

May 11 - 15, 1997

Arizona, Tucson, USA

Acceptance Rates

PODS '97 Paper Acceptance Rate 23 of 118 submissions, 19%;

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

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

39
Total Citations
View Citations
372
Total Downloads

Downloads (Last 12 months)29
Downloads (Last 6 weeks)3

Reflects downloads up to 09 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Spasić MVujošević Janičić M(2023)Solving the SPARQL query containment problem with SpeCSWeb Semantics: Science, Services and Agents on the World Wide Web10.1016/j.websem.2022.10077076:COnline publication date: 1-Apr-2023
https://dl.acm.org/doi/10.1016/j.websem.2022.100770
Koch CLupei DTannen VMilo TTan W(2016)Incremental View Maintenance For Collection ProgrammingProceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/2902251.2902286(75-90)Online publication date: 15-Jun-2016
https://dl.acm.org/doi/10.1145/2902251.2902286
Benedikt MPuppis GVu H(2015)The complexity of higher-order queriesInformation and Computation10.1016/j.ic.2015.07.003244:C(172-202)Online publication date: 1-Oct-2015
https://dl.acm.org/doi/10.1016/j.ic.2015.07.003
Meier MSchmidt MWei FLausen G(2013)Semantic query optimization in the presence of typesJournal of Computer and System Sciences10.1016/j.jcss.2013.01.01079:6(937-957)Online publication date: 1-Sep-2013
https://dl.acm.org/doi/10.1016/j.jcss.2013.01.010
Meier MSchmidt MWei FLausen GParedaens JVan Gucht D(2010)Semantic query optimization in the presence of typesProceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems10.1145/1807085.1807102(111-122)Online publication date: 6-Jun-2010
https://dl.acm.org/doi/10.1145/1807085.1807102
Benedikt MPuppis GVu HParedaens JVan Gucht D(2010)Positive higher-order queriesProceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems10.1145/1807085.1807091(27-38)Online publication date: 6-Jun-2010
https://dl.acm.org/doi/10.1145/1807085.1807091
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
de Moor OSereni DAvgustinov PVerbaere MKolaitis PLenzerini M(2008)Type inference for datalog and its application to query optimisationProceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems10.1145/1376916.1376957(291-300)Online publication date: 9-Jun-2008
https://dl.acm.org/doi/10.1145/1376916.1376957
Calvanese DGiacomo GLenzerini M(2008)Conjunctive query containment and answering under description logic constraintsACM Transactions on Computational Logic10.1145/1352582.13525909:3(1-31)Online publication date: 12-Jun-2008
https://dl.acm.org/doi/10.1145/1352582.1352590
Van den Bussche JVan Gucht DVansummeren S(2007)Well-definedness and semantic type-checking for the nested relational calculusTheoretical Computer Science10.1016/j.tcs.2006.11.007371:3(183-199)Online publication date: 25-Feb-2007
https://dl.acm.org/doi/10.1016/j.tcs.2006.11.007
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

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

Decidable containment of recursive queries

Containment of nested XML queries

Decidable Containment of Recursive Queries