Michael Benedikt
Skip Abstract Section
Abstract
We overview recent developments on query reformulation over a restricted interface, in the presence of integrity constraints. We overview an approach to the problem via reduction to query containment with constraints, where the reduction makes use of interpolation algorithms from logic. We first present the approach in the context of reformulating one query as another query using a fixed set of tables. We then generalize to reformulation of a query as a plan over a set of access methods.
- Antoine Amarilli and Michael Benedikt. When can we answer queries using result-bounded services. In PODS, 2018. Google Scholar
Digital Library
- Vince B´ar´any, Michael Benedikt, and Pierre Bourhis. Access restrictions and integrity constraints revisited. In ICDT, 2013.Google ScholarDigital Library
- Michael Benedikt, Egor Kostylev, Fabio Mogavero, and Efthymia Tsamoura. Reformulating queries: theory and practice. In IJCAI, 2017. Google ScholarDigital Library
- Michael Benedikt, Julien Leblay, Balder ten Cate, and Efthymia Tsamours. Generating Proof from Plans: the interpolation-based approach to Query Reformulation. Morgan Claypool, 2016.Google ScholarCross Ref
- Michael Benedikt, Julien Leblay, and Efi Tsamoura. PDQ: Proof-driven query answering over web-based data. In VLDB, 2014. Google ScholarDigital Library
- Michael Benedikt, Julien Leblay, and Efthymia Tsamoura. Querying with access patterns and integrity constraints. PVLDB, 8(6):690--701, 2015. Google ScholarDigital Library
- Michael Benedikt, Rodrigo Lopez-Serrano, and Efthymia Tsamoura. Biological web services: Integration, optimization, and reasoning. In Advances in Bioinformatics and Artificial Intelligence: Bridging the Gap, 2016.Google Scholar
- Michael Benedikt, Balder ten Cate, and Efi Tsamoura. Generating low-cost plans from proofs. In PODS, 2014. Google ScholarDigital Library
- Michael Benedikt, Balder ten Cate, and Efi Tsamoura. Generating plans from proofs. In TODS, 2016. Google ScholarDigital Library
- E. W. Beth. On Padoa's method in the theory of definitions. Indagationes Mathematicae, 15:330 -- 339, 1953.Google Scholar
- William Craig. Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory. Journal of Symbolic Logic, 22(3):269--285, 1957.Google ScholarCross Ref
- Alin Deutsch, Bertram Lud¨ascher, and Alan Nash. Rewriting queries using views with access patterns under integrity constraints. TCS, 371(3):200--226, 2007. Google ScholarDigital Library
- Alin Deutsch, Alan Nash, and Jeff Remmel. The chase revisited. In PODS, 2008. Google ScholarDigital Library
- Alin Deutsch, Lucian Popa, and Val Tannen. Query reformulation with constraints. SIGMOD Record, 35(1):65--73, 2006. Google ScholarDigital Library
- Tomasz Gogacz and Jerzy Marcinkowski. The hunt for a red spider: Conjunctive query determinacy is undecidable. In LICS, 2015. Google ScholarDigital Library
- Ioana Ileana, Bogdan Cautis, Alin Deutsch, and Yannis Katsis. Complete yet practical search for minimal query reformulations under constraints. In SIGMOD, 2014. Google ScholarDigital Library
- Alon Y. Levy, Alberto O. Mendelzon, Yehoshua Sagiv, and Divesh Srivastava. Answering queries using views. In PODS, 1995. Google ScholarDigital Library
- Alon Y. Levy, Anand Rajaraman, and Joann J. Ordille. Query-answering algorithms for information agents. In AAAI, 1996. Google ScholarDigital Library
- Chen Li. Computing complete answers to queries in the presence of limited access patterns. VLDB Journal, 12(3):211--227, 2003. Google ScholarDigital Library
- Chen Li and Edward Chang. Answering queries with useful bindings. TODS, 26(3):313--343, 2001. Google ScholarDigital Library
- Roger C. Lyndon. An interpolation theorem in the predicate calculus. Pacific Journal of Mathemantics, 9:129--142, 1959.Google ScholarCross Ref
- David Maier, Alberto O. Mendelzon, and Yehoshua Sagiv. Testing implications of data dependencies. TODS, 4(4):455--469, 1979. Google ScholarDigital Library
- Alan Nash and Bertram Lud¨ascher. Processing first-order queries under limited access patterns. In PODS, 2004. Google ScholarDigital Library
- Alan Nash and Bertram Lud¨ascher. Processing union of conjunctive queries with negation under limited access patterns. In EDBT, 2004.Google ScholarCross Ref
- Alan Nash, Luc Segoufin, and Victor Vianu. Views and queries: Determinacy and rewriting. TODS, 35(3), 2010. Google ScholarDigital Library
- Lucian Popa. Object/Relational Query Optimization with Chase and Backchase. PhD thesis, U. Penn., 2000. Google ScholarDigital Library
- Rachel Pottinger and Alon Y. Halevy. Minicon: A scalable algorithm for answering queries using views. VLDB Journal, 10(2--3):182--198, 2001. Google ScholarDigital Library
- Benjamin Rossman. Homomorphism preservation theorems. J. ACM, 55(3), 2008. Google ScholarDigital Library
- Luc Segoufin and Victor Vianu. Views and queries: determinacy and rewriting. In PODS, 2005. Google ScholarDigital Library
- David Toman and Grant Weddell. Fundamentals of Physical Design and Query Compilation. Morgan Claypool, 2011. Google ScholarDigital Library
- Jeffrey D. Ullman. Principles of Database and Knowledge-Base Systems, V2. Comp. Sci. Press, 1989. Google ScholarDigital Library
Index Terms
- Logic-based Perspectives on Query Reformulationover Restricted Interfaces
Index terms have been assigned to the content through auto-classification.
Recommendations
View-based query containment
PODS '03: Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systemsQuery containment is the problem of checking whether for all databases the answer to a query is a subset of the answer to a second query. In several data management tasks, such as data integration, mobile computing, etc., the data of interest are only ...
Conjunctive query containment and answering under description logic constraints
Query containment and query answering are two important computational tasks in databases. While query answering amounts to computing the result of a query over a database, query containment is the problem of checking whether, for every database, the ...
View-based query processing: On the relationship between rewriting, answering and losslessness
As a result of the extensive research in view-based query processing, three notions have been identified as fundamental, namely rewriting, answering, and losslessness. Answering amounts to computing the tuples satisfying the query in all databases ...
Comments