Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
article

PDQ 2.0: Flexible Infrastructure for Integrating Reasoning and Query Planning

Published: 25 January 2023 Publication History

Abstract

Reasoning-based query planning has been explored in many contexts, including relational data integration, the SemanticWeb, and query reformulation. But infrastructure to build reasoning-based optimization in the relational context has been slow to develop. We overview PDQ 2.0, a platform supporting a number of reasoningenhanced querying tasks. We focus on a major goal of PDQ 2.0: obtaining a more modular and flexible architecture for reasoning-based query optimization.

References

[1]
PDQ on GitHub, 2021. https: //github.com/ProofDrivenQuerying/pdq.
[2]
F. N. Afrati and R. Chirkova. Answering Queries Using Views. Morgan Claypool, 2019.
[3]
M. Benedikt, G. Konstantinidis, G. Mecca, B. Motik, P. Papotti, D. Santoro, and E. Tsamoura. Benchmarking the chase. In PODS, 2017.
[4]
M. Benedikt, E. V. Kostylev, F. Mogavero, and E. Tsamoura. Reformulating queries: Theory and practice. In IJCAI, 2017.
[5]
M. Benedikt, J. Leblay, and E. Tsamoura. PDQ: Proof-driven query answering over web-based data. In VLDB, 2014.
[6]
M. Benedikt, J. Leblay, and E. Tsamoura. Querying with access patterns and integrity constraints. In VLDB, 2015.
[7]
M. Benedikt, B. ten Cate, J. Leblay, and E. Tsamoura. Generating Plans from Proofs. Morgan Claypool, 2016.
[8]
A. Deutsch, B. Ludäscher, and A. Nash. Rewriting queries using views with access patterns under integrity constraints. TCS, 371(3):200--226, 2007.
[9]
A. Deutsch, L. Popa, and V. Tannen. Query reformulation with constraints. SIGMOD Record, 35(1):65--73, 2006.
[10]
R. Fagin, P. Kolaitis, R. Miller, and L. Popa. Data Exchange: Semantics and Query Answering. TCS, 336(1):89--124, 2005.
[11]
D. Florescu, A. Y. Levy, I. Manolescu, and D. Suciu. Query optimization in the presence of limited access patterns. In SIGMOD, 1999.
[12]
I. Ileana, B. Cautis, A. Deutsch, and Y. Katsis. Complete yet practical search for min. query reform. under constraints. In SIGMOD, 2014.
[13]
D. Toman and G. Weddell. Fund. of Phys. Design and Query Compilation. Morgan Claypool, 2011.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM SIGMOD Record
ACM SIGMOD Record  Volume 51, Issue 4
December 2022
73 pages
ISSN:0163-5808
DOI:10.1145/3582302
Issue’s Table of Contents
Permission to make digital or hard copies of part or all 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 third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 January 2023
Published in SIGMOD Volume 51, Issue 4

Check for updates

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 42
    Total Downloads
  • Downloads (Last 12 months)15
  • Downloads (Last 6 weeks)0
Reflects downloads up to 09 Nov 2024

Other Metrics

Citations

View Options

Get Access

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