Complete Yet Practical Search for Minimal Query Reformulations Under Constraints

被引:11
|
作者
Ileana, Ioana [1 ]
Cautis, Bogdan [2 ,3 ]
Deutsch, Alin [4 ]
Katsis, Yannis [4 ]
机构
[1] CNRS LTCI, Inst Mines Telecom, Telecom ParisTech, Paris, France
[2] Univ Paris Sud, Orsay, France
[3] Inria Saclay, Palaiseau, France
[4] Univ Calif San Diego, San Diego, CA 92103 USA
关键词
database views; integrity constraints; query optimization; chase;
D O I
10.1145/2588555.2593683
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We revisit the Chase&Backchase (C&B) algorithm for query reformulation under constraints, which provides a uniform solution to such particular-case problems as view-based rewriting under constraints, semantic query optimization, and physical access path selection in query optimization. For an important class of queries and constraints, C&B has been shown to be complete, i.e. guaranteed to find all (join-)minimal reformulations under constraints. C&B is based on constructing a canonical rewriting candidate called a universal plan, then inspecting its exponentially many sub-queries in search for minimal reformulations, essentially removing redundant joins in all possible ways. This inspection involves chasing the subquery. Because of the resulting exponentially many chases, the conventional wisdom has held that completeness is a concept of mainly theoretical interest. We show that completeness can be preserved at practically relevant cost by introducing Provcs(C&B), a novel reformulation algorithm that instruments the chase to maintain provenance information connecting the joins added during the chase to the universal plan subqueries responsible for adding these joins. This allows it to directly "read off" the minimal reformulations from the result of a single chase of the universal plan, saving exponentially many chases of its subqueries. We exhibit natural scenarios yielding speedups of over two orders of magnitude between the execution of the best view-based rewriting found by a commercial query optimizer and that of the best rewriting found by Prov(C&B) (which the optimizer misses because of limited reasoning about constraints).
引用
收藏
页码:1015 / 1026
页数:12
相关论文
共 50 条
  • [1] Practical Reformulations With Table Constraints
    Lhomme, Olivier
    [J]. 20TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE (ECAI 2012), 2012, 242 : 911 - 912
  • [2] Children's query types and reformulations in Google search
    Bilal, Dania
    Gwizdka, Jacek
    [J]. INFORMATION PROCESSING & MANAGEMENT, 2018, 54 (06) : 1022 - 1041
  • [3] A Systematic Review of Automated Query Reformulations in Source Code Search
    Rahman, Mohammad Masudur
    Roy, Chanchal K.
    [J]. ACM TRANSACTIONS ON SOFTWARE ENGINEERING AND METHODOLOGY, 2023, 32 (06)
  • [4] Improving Clinical Case Search Using Semantic Based Query Reformulations
    Alsulmi, Mohammad
    Carterette, Ben
    [J]. 2016 IEEE INTERNATIONAL CONFERENCE ON BIOINFORMATICS AND BIOMEDICINE (BIBM), 2016, : 694 - 698
  • [5] Evaluating the accuracy of implicit feedback from clicks and query reformulations in Web search
    Joachims, Thorsten
    Granka, Laura
    Pan, Bing
    Hembrooke, Helene
    Radlinski, Filip
    Gay, Geri
    [J]. ACM TRANSACTIONS ON INFORMATION SYSTEMS, 2007, 25 (02)
  • [6] Factors That Influence Query Reformulations and Search Performance in Health Information Retrieval: A Multilevel Modeling Approach
    Lu, Kun
    Joo, Soohyung
    Lee, Taehun
    Hu, Rong
    [J]. JOURNAL OF THE ASSOCIATION FOR INFORMATION SCIENCE AND TECHNOLOGY, 2017, 68 (08) : 1886 - 1898
  • [7] Optimizing Query Answering under Ontological Constraints
    Orsi, Giorgio
    Pieris, Andreas
    [J]. PROCEEDINGS OF THE VLDB ENDOWMENT, 2011, 4 (11): : 1004 - 1015
  • [8] Efficient Complete Local Tests for conjunctive query constraints with negation
    Huyn, N
    [J]. DATABASE THEORY - ICDT'97, 1997, 1186 : 83 - 97
  • [9] Optimal Search Under Constraints
    Ceberio, Martine
    Kosheleva, Olga
    Kreinovich, Vladik
    [J]. FUZZY INFORMATION PROCESSING 2020, 2022, 1337 : 421 - 426
  • [10] Consistent query answering under spatial semantic constraints
    Andrea Rodriguez, M.
    Bertossi, Leopoldo
    Caniupan, Monica
    [J]. INFORMATION SYSTEMS, 2013, 38 (02) : 244 - 263