skip to main content
10.1145/1065167.1065174acmconferencesArticle/Chapter ViewAbstractPublication PagespodsConference Proceedingsconference-collections
Article

Views and queries: determinacy and rewriting

Published: 13 June 2005 Publication History

Abstract

We investigate the question of whether a query Q can be answered using a set V of views. We first define the problem in information-theoretic terms: we say that V determines Q if V provides enough information to uniquely determine the answer to Q. Next, we look at the problem of rewriting Q in terms of V using a specific language. Given a view language V and query language Q, we say that a rewriting language R is complete for Vto-Q rewritings if every Q ε Q can be rewritten in terms of V ε v using a query in R, whenever V determines Q. While query rewriting using views has been extensively investigated for some specific languages, the connection to the information-theoretic notion of determinacy, and the question of completeness of a rewriting language, have received little attention. In this paper we investigate systematically the notion of determinacy and its connection to rewriting. The results concern decidability of determinacy for various view and query languages, as well as the power required of complete rewriting languages. We consider languages ranging from first-order to conjunctive queries.

References

[1]
S. Abiteboul and O. Duschka. Complexity of answering queries using materialized views. PODS 1998, 254--263.
[2]
S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison Wesley, 1995.
[3]
F. Afrati, C. Li, and P. Mitra. Answering queries using views with arithmetic comparisons. PODS 2002, 209--220.
[4]
S. Agrawal, S. Chaudhuri, and V. Narasayya. Automated selection of materialized views and indexes in Microsoft SQL Server. VLDB 2000, 496--505.
[5]
Egon Börger, Erich Gräel, and Yuri Gurevich. The Classical Decision Problem. Springer, 1997.
[6]
D. Calvanese, G. De Giacomo, M. Lenzerini, and M. Y. Vardi. Rewriting of regular expressions and regular path queries. PODS 1999, 194--204.
[7]
D. Calvanese, G. De Giacomo, M. Lenzerini, and M. Y. Vardi. View-based query processing for regular path queries with inverse. PODS 2000, 58--66.
[8]
D. Calvanese, G. De Giacomo, M. Lenzerini, and M. Y. Vardi. Lossless regular views. PODS 2002, 247--258.
[9]
A. K. Chandra and P. M. Merlin. Optimal implementation of conjunctive queries in relational databases. STOC 1977, 77--90.
[10]
C. C. Chang and H. J. Keisler. Model Theory. North-Holland, 1977.
[11]
C. Chekuri and A. Rajaraman. Conjunctive query containment revisited. ICDT 1997, 56--70.
[12]
S. Dar, M. J. Franklin, B. Jonsson, D. Srivastava and M. Tan. Semantic data caching and replacement. VLDB 1996, 330--341.
[13]
A. Deutsch, L. Popa, and V. Tannen. Physical data independence, constraints and optimization with universal plans. VLDB 1999, 459--470.
[14]
O. Duschka and M. R. Genesereth. Answering recursive queries using views. PODS 1997, 109--116.
[15]
H-D Ebbinghaus and J. Flum. Finite Model Theory. Springer, 1995.
[16]
S. Grumbach, Z. Lacroix, and S. Lindell. Generalized implicit definitions on finite structures. In Computer Science Logic, 1995, 252--265.
[17]
S. Grumbach, M. Rafanelli, and L. Tininini. Querying aggregate data. PODS 1999, 174--184.
[18]
S. Grumbach and L. Tininini. On the content of materialized aggregate views. PODS 2000, 47--57.
[19]
Yuri Gurevich. The word problem for some classes of semigroups. Algebra and Logic, 5(4):25--35, 1966. (Russian).
[20]
Leonid Libkin. Elements of finite model theory. Springer, 2004.
[21]
S. Lindell. The Logical Complexity of Queries on Unordered Graphs. PhD thesis, University of California at Los Angeles, 1987.
[22]
Alon Y. Levy, Alberto O. Mendelzon, Yehoshua Sagiv, and Divesh Srivastava. Answering queries using views. PODS 1995, 95--104.
[23]
Emil L. Post. Recursive unsolvability of a problem of Thue. Journal on Symbolic Logic, 12(1):1--11, 1947.
[24]
A. Rajaraman, Y. Sagiv, and J. D. Ullman. Answering queries using templates with binding patterns. PODS 1995, 105--112.
[25]
O. G. Tsatalos, M. H. Solomon and Y. E. Ioannidis. Describing and using query capabilities of heterogeneous sources. VLDB 1997, 256--265.
[26]
J. D. Ullman. Information integration using logical views. ICDT 1997, 19--40.
[27]
H. Z. Yang and P. A. LArson. Query transformation for PSJ-queries. VLDB 1987, 245--254.

Cited By

View all
  • (2024)Synthesizing Strongly Equivalent Logic Programs: Beth Definability for Answer Set Programs via Craig Interpolation in First-Order LogicAutomated Reasoning10.1007/978-3-031-63498-7_11(172-193)Online publication date: 1-Jul-2024
  • (2023)Synthesizing Nested Relational Queries from Implicit SpecificationsProceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3584372.3588653(33-45)Online publication date: 18-Jun-2023
  • (2022)A Survey on Data Pricing: From Economics to Data ScienceIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2020.304592734:10(4586-4608)Online publication date: 1-Oct-2022
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
PODS '05: Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
June 2005
388 pages
ISBN:1595930620
DOI:10.1145/1065167
  • General Chair:
  • Georg Gottlob,
  • Program Chair:
  • Foto Afrati
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: 13 June 2005

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Conference

SIGMOD/PODS05

Acceptance Rates

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

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)3
  • Downloads (Last 6 weeks)0
Reflects downloads up to 17 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2024)Synthesizing Strongly Equivalent Logic Programs: Beth Definability for Answer Set Programs via Craig Interpolation in First-Order LogicAutomated Reasoning10.1007/978-3-031-63498-7_11(172-193)Online publication date: 1-Jul-2024
  • (2023)Synthesizing Nested Relational Queries from Implicit SpecificationsProceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3584372.3588653(33-45)Online publication date: 18-Jun-2023
  • (2022)A Survey on Data Pricing: From Economics to Data ScienceIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2020.304592734:10(4586-4608)Online publication date: 1-Oct-2022
  • (2022)Generating Plans from ProofsundefinedOnline publication date: 25-Feb-2022
  • (2022)Foundations of Data Quality ManagementundefinedOnline publication date: 2-Mar-2022
  • (2021)Generating collection transformations from proofsProceedings of the ACM on Programming Languages10.1145/34342955:POPL(1-28)Online publication date: 4-Jan-2021
  • (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
  • (2020)Completeness of queries over incomplete databasesProceedings of the VLDB Endowment10.14778/3402707.34027154:11(749-760)Online publication date: 3-Jun-2020
  • (2019)Cost Based Model for Secure Health Care Data RetrievalSecurity in Computing and Communications10.1007/978-981-13-5826-5_5(67-75)Online publication date: 24-Jan-2019
  • (2018)Logic-based Perspectives on Query Reformulationover Restricted InterfacesACM SIGMOD Record10.1145/3299887.329988947:2(5-16)Online publication date: 11-Dec-2018
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media