research-article

Determinacy and rewriting of conjunctive queries over unary database schemas

Authors:

Haiming ChenAuthors Info & Claims

SAC '11: Proceedings of the 2011 ACM Symposium on Applied Computing

Pages 1039 - 1044

https://doi.org/10.1145/1982185.1982413

Published: 21 March 2011 Publication History

Abstract

The problem of answering queries using views arises in a wide variety of data management applications. From the information-theoretic perspective, a notion of determinacy has been recently introduced to formalize the intuitive notion that whether a set of views V is sufficient to answer a query Q. We say that V determines Q iff for any two databases D₁, D₂, V(D₁) = V(D₂) implies Q(D₁) = Q(D₂). Determinacy has been investigated for many query and view languages including first order logic (FO) and unions of conjunctive queries (UCQ) and a considerable number of cases are resolved. However the problem remains open for queries and views defined by conjunctive queries (CQ) and appears to be quite challenging.

In this paper we study the problem of determinacy for conjunctive queries and views over unary database schemas where each relation has only one attribute. We show that determinacy is decidable in ptime in this case. We provide syntactic characterizations for a CQ query Q to be determined by a set of CQ views V and give an algorithm for checking determinacy which runs in time O(|Q| * |V|) where |Q| and |V| are the sizes of Q and V respectively. Furthermore we show that whenever V determines Q there exists a CQ query which is an equivalent rewriting of Q using V.

References

[1]

S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.

Digital Library

[2]

S. Adali, K. S. Candan, Y. Papakonstantinou, and V. S. Subrahmanian. Query caching and optimization in distributed mediator systems. In SIGMOD, pages 137--146, 1996.

Digital Library

[3]

F. Afrati. Rewriting conjunctive queries determined by views. In MFCS, pages 78--89, 2007.

Digital Library

[4]

E. Börger, E. Grädel, and Y. Gurevich. The Classical Decision Problem. Springer, 1997.

[5]

A. K. Chandra and P. M. Merlin. Optimal implementation of conjunctive queries in relational data bases. In STOC, pages 77--90, 1977.

Digital Library

[6]

S. Chaudhuri, R. Krishnamurthy, S. Potamianos, and K. Shim. Optimizing queries with materialized views. In ICDE, pages 190--200, 1995.

Digital Library

[7]

R. Chirkova and M. R. Genesereth. Linearly bounded reformulations of unary databases. In the 4th International Symposium on Abstraction, Reformulation, and Approximation table of contents, pages 144--163, 2000.

Digital Library

[8]

J. V. den Bussche. Rewriting queries using views over monadic database schemas. Information Processing Letters, 79(3): 111--114, 2001.

Digital Library

[9]

Z. Ives, D. Florescu, M. Friedman, A. Levy, and D. Weld. An adaptive query execution engine for data integration. In SIGMOD, pages 299--310, 1999.

Digital Library

[10]

A. M. Keller and J. Basu. A predicate-based caching scheme for client-server database architectures. The VLDB Journal, 5(1): 35--47, 1996.

Digital Library

[11]

A. Levy, A. Rajaraman, and J. J. Ordille. Querying heterogeneous information sources using source descriptions. In VLDB, pages 251--262, 1996.

Digital Library

[12]

A. Y. Levy, A. O. Mendelzon, Y. Sagiv, and D. Srivastava. Answering queries using views. In PODS, pages 95--104, 1995.

Digital Library

[13]

M. Marx. Queries determined by views: Pack your views. In PODS, pages 23--30, 2007.

Digital Library

[14]

A. Nash, L. Segoufin, and V. Vianu. Determinacy and rewriting of conjunctive queries using views: A progress report. In ICDT, pages 59--73, 2007.

Digital Library

[15]

A. Nash, L. Segoufin, and V. Vianu. Views and queries: Determinacy and rewriting. TODS, 35(3): 1--41, 2010.

Digital Library

[16]

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

Digital Library

[17]

D. Theodoratos and T. Sellis. Data warehouse configuration. In VLDB, pages 126--135, 1997.

Digital Library

[18]

J. D. Ullman. Information integration using logical views. In ICDT, pages 19--40, 1997.

Digital Library

Cited By

Hashimoto KSawada RIshihara YSeki HFujiwara T(2013)Determinacy and Subsumption for Single-Valued Bottom-Up Tree TransducersLanguage and Automata Theory and Applications10.1007/978-3-642-37064-9_30(335-346)Online publication date: 2013
https://doi.org/10.1007/978-3-642-37064-9_30

Index Terms

Determinacy and rewriting of conjunctive queries over unary database schemas
1. Information systems
  1. Data management systems
    1. Database management system engines
    2. Query languages
2. Theory of computation
  1. Design and analysis of algorithms
  2. Theory and algorithms for application domains
    1. Database theory
      1. Database query languages (principles)

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 ...
Conjunctive queries determinacy and rewriting
ICDT '11: Proceedings of the 14th International Conference on Database Theory

The problem of whether a query Q can be answered using a set of views V studies the possibility of computing Q when only the answers to the given set of views are available. In information-theoretic terms, we say that V determines Q iff for any two ...
Equivalence and minimization of conjunctive queries under combined semantics
ICDT '12: Proceedings of the 15th International Conference on Database Theory

The problems of query containment, equivalence, and minimization are fundamental problems in the context of query processing and optimization. In their classic work [2] published in 1977, Chandra and Merlin solved the three problems for the language of ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SAC '11: Proceedings of the 2011 ACM Symposium on Applied Computing

March 2011

1868 pages

ISBN:9781450301138

DOI:10.1145/1982185

Conference Chairs:
William Chu
Tunghai University, TaiChung, Taiwan
,
W. Eric Wong
University of Texas at Dallas, Richardson, Texas
,
Program Chairs:
Mathew J. Palakal
Indiana University Purdue University, Indianapolis
,
Chih-Cheng Hung
Southern Polytechnic State University, Marietta

Copyright © 2011 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

SIGAPP: ACM Special Interest Group on Applied Computing

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 21 March 2011

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

National Natural Science Foundation of China

Conference

SAC'11

Sponsor:

SIGAPP

SAC'11: The 2011 ACM Symposium on Applied Computing

March 21 - 24, 2011

TaiChung, Taiwan

Acceptance Rates

Overall Acceptance Rate 1,650 of 6,669 submissions, 25%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
87
Total Downloads

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

Reflects downloads up to 04 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Hashimoto KSawada RIshihara YSeki HFujiwara T(2013)Determinacy and Subsumption for Single-Valued Bottom-Up Tree TransducersLanguage and Automata Theory and Applications10.1007/978-3-642-37064-9_30(335-346)Online publication date: 2013
https://doi.org/10.1007/978-3-642-37064-9_30

View Options

Get Access

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.

Media

Figures

Other

Tables

View Table of Contents