Article

Queries determined by views: pack your views

Author:

Maarten MarxAuthors Info & Claims

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

Pages 23 - 30

https://doi.org/10.1145/1265530.1265534

Published: 11 June 2007 Publication History

Abstract

A query Q is determined by a set of views V if, whenever V (I1) = V (I2) for two database instances I1, I2 then also Q(I1) = Q(I2). Does this imply that Q can be rewritten as a query Q0 that only uses the views V?.

For first-order (FO) queries and view definitions over possibly infinite databases, the answer is yes, as follows from old results of Beth and Craig. We say that FO is complete for FO-to-FO rewritings. However, Nash, Segoufin and Vianu (2007) prove that if the query and the view definitions are given by conjunctive queries, then it might not be possible to formulate Q' as a conjunctive query. In other words, CQ is not complete for CQ-to-CQ rewritings.

Here we consider queries and view definitions in the packed fragment (PF) of first-order logic. This is a generalization of the guarded fragment, a fragment of particular interest to database theory. Gottlob et.al. 2002 show that the guarded conjunctive queries are exactly the acyclic queries. Leinders et.al. 2005 characterize the entire guarded fragment by the semijoin algebra.

We show that for both finite and unrestricted databases, PF is complete for PF-to-PF rewritings. The same holds for packed (unions of) conjunctive queries. In both cases, we provide algorithms for testing whether a query is determined by a set of views, and for actually rewriting Q to Q'. To compare: these problems are undecidable for full FO, and still open for conjunctive queries.

Supplementary Material

Low Resolution (p23-marx_56k.mp4)

Download
27.03 MB

High Resolution (p23-marx_768k.mp4)

Download
176.62 MB

References

[1]

H. Andréka, J. van Benthem, and I. Németi. Modal languages and bounded fragments of predicate logic. Journal of Philosophical Logic, 27(3):217--274, 1998.

[2]

F. Baader and W. Nutt. Basic description logics. In The description logic handbook: theory, implementation, and applications, pages 43--95. Cambridge University Press, New York, NY, USA, 2003.

Digital Library

[3]

E. Beth. On Padoa's method in the theory of definition. Indagationes Mathematicae, 15:330--339, 1953.

[4]

E. Beth. Formal methods, An introduction to symbolic logic and to the study of effective operations in arithmetic and logic. Number 4 in Synthese Library. Reidel, Dordrecht, 1962.

[5]

D. Calvanese, G. De Giacomo, M. Lenzerini, and M. Vardi. Lossless regular views. In Proceedings PODS, pages 247--258, 2002.

Digital Library

[6]

C. Chang and H. Keisler. Model Theory. North-Holland, 1973.

[7]

W. Craig. Three uses of the Herbrand-Gentzen theorem in relation to model theory and proof theory. Journal of Symbolic Logic, 22:269--285, 1957.

[8]

K. Doets. Basic Model Theory. CSLI Publications, Stanford, 1996.

[9]

M. Fitting. First Order Logic and Automated Theorem Proving (second edition). Springer Verlag, 1996.

Digital Library

[10]

J. Flum, M. Frick, and M. Grohe. Query evaluation via tree-decompositions. In Proceedings ICDT, pages 22--38, 2001.

Digital Library

[11]

H. Friedman. The complexity of explicit definitions. Advances in Mathematics, 20(1):18--29, 1976.

[12]

G. Gottlob, N. Leone, and F. Scarcello. Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width. J. Comput. Syst. Sci., 66(4):775--808, 2003.

Digital Library

[13]

E. Grädel. On the restraining power of guards. Journal of Symbolic Logic, 64(4):1719--1742, 1999.

[14]

E. Grädel. Guarded fixed point logics and the monadic theory of countable trees. Theor. Comput. Sci., 288(1):129--152, 2002.

Digital Library

[15]

S. Grumbach and L. Tininini. On the content of materialized aggregate views. In Proceedings PODS, pages 47--57, 2000.

Digital Library

[16]

I. Hodkinson. Loosely guarded fragment of first-order logic has the finite model property. Studia Logica, 70(2):205--240, 2002.

[17]

E. Hoogland. Algebraic characterizations of various beth definability properties. Studia Logica, 65(1):91--112, 2000.

[18]

E. Hoogland and M. Marx. Interpolation in the guarded fragment. Studia Logica, 70(3):273--409, 2002.

[19]

E. Hoogland, M. Marx, and M. Otto. Beth definability for the guarded fragment. In H. Ganzinger, D. McAllester, and A. Voronkov, editors, Logic for Programming and Automated Reasoning, 6th International Conference LPAR99, Tbilisi, Georgia, volume 1705 of LNAI, pages 273--285. Springer, 1999.

Digital Library

[20]

D. Leinders, M. Marx, J. Tysziewicz, and J. van den Bussche. The semijoin algebra and the guarded fragment. Journal of Logic, Language and Information, 14:331--343, 2005.

Digital Library

[21]

M. Marx and Y. Venema. Local variations on a loose theme: modal logic and decidability. In E. Grädel, P. Kolaitis, L. Libkin, M. Marx, J. Spencer, M. Vardi, Y. Venema, and S. Weinstein, editors, Finite Model Theory and its Applications. Springer-Verlag, 2007.

[22]

A. Nash, L. Segoufin, and V. Vianu. Determinacy and rewriting of conjunctive queries using views: a progress report. In Proceedings ICDT 2007, to appear.

Digital Library

[23]

D. Pigozzi. Amalgamation, congruence extension and interpolation properties in algebras. Algebra Universalis, 1:269--349, 1972.

[24]

L. Segoufin and V. Vianu. Views and queries: determinacy and rewriting. In Proceedings PODS, pages 49--60, 2005.

Digital Library

[25]

A. Tarski. Einige methodologische Untersuchungen über die Definierbarkeit der Begriffe. Erkenntnis, 5:80--100, 1935.

[26]

A. Tarski. Logic, semantics and metamathematics. Clarendon, Oxford, 1956.

[27]

B. ten Cate. Interpolation for extended modal languages. Journal of Symbolic Logic, 70(1):223--234, 2005.

[28]

B. ten Cate, W. Conradi, M. Marx, and Y. Venema. Definitorially complete description logics. In Proceedings KR 2006, pages 79--89, 2006.

[29]

J. Van den Bussche. Applications of Alfred Tarski's ideas in database theory. Lecture Notes in Computer Science, 2142:20--37, 2001.

Digital Library

[30]

P. van Ulsen. E. W. Beth als logicus. PhD thesis, University of Amsterdam, 2000.

[31]

A. Visser. Uniform interpolation and layered bisimulation. In Gädel '96 (Brno, 1996), volume 6 of Lecture Notes Logic, pages 139--164. Springer, Berlin, 1996.

Cited By

Zheng SSchmidt R(2023)Saturation-Based Boolean Conjunctive Query Answering and Rewriting for the Guarded Quantification FragmentsJournal of Automated Reasoning10.1007/s10817-023-09687-x67:4Online publication date: 1-Dec-2023
Afrati FChirkova R(2022)Answering Queries Using Views, Second EditionundefinedOnline publication date: 26-Feb-2022
Benedikt MLeblay Jten Cate BTsamoura E(2022)Generating Plans from ProofsundefinedOnline publication date: 25-Feb-2022
Show More Cited By

Index Terms

Queries determined by views: pack your views
1. Computing methodologies
  1. Modeling and simulation
    1. Simulation theory
      1. Systems theory
2. Mathematics of computing
  1. Information theory

Recommendations

Determinacy and query rewriting for conjunctive queries and views

Answering queries using views is the problem which examines how to derive the answers to a query when we only have the answers to a set of views. Constructing rewritings is a widely studied technique to derive those answers. In this paper we consider ...
Query containment for data integration systems
Special issue on PODS 2000

The problem of query containment is fundamental to many aspects of database systems, including query optimization, determining independence of queries from updates, and rewriting queries using views. In the data-integration framework, however, the ...
Query Folding
ICDE '96: Proceedings of the Twelfth International Conference on Data Engineering

Query folding refers to the activity of determining if and how a query can be answered using a given set of resources, which might be materialized views, cached results of previous queries, or queries answerable by other databases. We investigate query ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

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

June 2007

328 pages

ISBN:9781595936851

DOI:10.1145/1265530

General Chair:
Phokion Kolaitis
IBM Almaden
,
Program Chair:
Leonid Libkin
University of Edinburgh

Copyright © 2007 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: 11 June 2007

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

SIGMOD/PODS07

Sponsor:

SIGMOD/PODS07: International Conference on Management of Data

June 11 - 13, 2007

Beijing, China

Acceptance Rates

PODS '07 Paper Acceptance Rate 28 of 187 submissions, 15%;

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

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

21
Total Citations
View Citations
532
Total Downloads

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

Reflects downloads up to 10 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Zheng SSchmidt R(2023)Saturation-Based Boolean Conjunctive Query Answering and Rewriting for the Guarded Quantification FragmentsJournal of Automated Reasoning10.1007/s10817-023-09687-x67:4Online publication date: 1-Dec-2023
Afrati FChirkova R(2022)Answering Queries Using Views, Second EditionundefinedOnline publication date: 26-Feb-2022
Benedikt MLeblay Jten Cate BTsamoura E(2022)Generating Plans from ProofsundefinedOnline publication date: 25-Feb-2022
Jung JWolter FGorla D(2021)Living without beth and craigProceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science10.1109/LICS52264.2021.9470585(1-14)Online publication date: 29-Jun-2021
Wernhard C(2021)Craig Interpolation with Clausal First-Order TableauxJournal of Automated Reasoning10.1007/s10817-021-09590-365:5(647-690)Online publication date: 1-Jun-2021
Benedikt MEngelfriet JManeth S(2017)Determinacy and rewriting of functional top-down and MSO tree transformationsJournal of Computer and System Sciences10.1016/j.jcss.2016.11.00185:C(57-73)Online publication date: 1-May-2017
Ngo NDragut EShen H(2016)Query Answering over Complete Data with Conceptual ConstraintsProceedings of the 2016 on SIGMOD'16 PhD Symposium10.1145/2926693.2929899(42-46)Online publication date: 14-Jun-2016
Benedikt MCate BBoom M(2015)Effective Interpolation and Preservation in Guarded LogicsACM Transactions on Computational Logic10.1145/281457017:2(1-46)Online publication date: 6-Dec-2015
Koutris PUpadhyaya PBalazinska MHowe BSuciu D(2015)Query-Based Data PricingJournal of the ACM10.1145/277087062:5(1-44)Online publication date: 2-Nov-2015
Benedikt MCate BBoom M(2015)Interpolation with Decidable Fixpoint LogicsProceedings of the 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)10.1109/LICS.2015.43(378-389)Online publication date: 6-Jul-2015
Show More Cited By

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