Extremal Fitting Problems for Conjunctive Queries

被引:3
|
作者
ten Cate, Balder [1 ]
Dalmau, Victor [2 ]
Funk, Maurice [3 ]
Lutz, Carsten [3 ]
机构
[1] Univ Amsterdam, ILLC, Amsterdam, Netherlands
[2] Univ Pompeu Fabra, Barcelona, Spain
[3] Univ Leipzig, ScaDSAI Ctr Dresden Leipzig, Leipzig, Germany
来源
PROCEEDINGS OF THE 42ND ACM SIGMOD-SIGACT-SIGAI SYMPOSIUM ON PRINCIPLES OF DATABASE SYSTEMS, PODS 2023 | 2023年
关键词
Conjunctive Queries; Database Queries; Data Examples; Fitting; Homomorphism Dualities; COMPLEXITY; FINITE;
D O I
10.1145/3584372.3588655
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The fitting problem for conjunctive queries (CQs) is the problem to construct a CQ that fits a given set of labeled data examples. When a fitting CQ exists, it is in general not unique. This leads us to proposing natural refinements of the notion of a fitting CQ, such as most-general fitting CQ, most-specific fitting CQ, and unique fitting CQ. We give structural characterizations of these notions in terms of (suitable refinements of) homomorphism dualities, frontiers, and direct products, which enable the construction of the refined fitting CQs when they exist. We also pinpoint the complexity of the associated existence and verification problems, and determine the size of fitting CQs. We study the same problems for UCQs and for the more restricted class of tree CQs.
引用
收藏
页码:89 / 98
页数:10
相关论文
共 50 条
  • [41] Containment of conjunctive queries with safe negation
    Wei, F
    Lausen, G
    DATABASE THEORY ICDT 2003, PROCEEDINGS, 2003, 2572 : 346 - 360
  • [42] Containment of Conjunctive Queries on Annotated Relations
    Todd J. Green
    Theory of Computing Systems, 2011, 49 : 429 - 459
  • [43] Asymptotic conditional probabilities for conjunctive queries
    Dalvi, N
    Miklau, G
    Suciu, D
    DATABASE THEORY - ICDT 2005, PROCEEDINGS, 2005, 3363 : 289 - 305
  • [44] Conjunctive Queries with Inequalities Under Updates
    Idris, Muhammad
    Ugarte, Martin
    Vansummeren, Stijn
    Voigt, Hannes
    Lehner, Wolfgang
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2018, 11 (07): : 733 - 745
  • [45] Size and Treewidth Bounds for Conjunctive Queries
    Gottlob, Georg
    Lee, Stephanie Tien
    Valiant, Gregory J.
    PODS'09: PROCEEDINGS OF THE TWENTY-EIGHTH ACM SIGMOD-SIGACT-SIGART SYMPOSIUM ON PRINCIPLES OF DATABASE SYSTEMS, 2009, : 45 - 54
  • [46] Constant delay enumeration for conjunctive queries
    Segoufin, Luc
    SIGMOD RECORD, 2015, 44 (01) : 10 - 17
  • [47] On containment of conjunctive queries with arithmetic comparisons
    Afrati, F
    Li, C
    Mitra, P
    ADVANCES IN DATABASE TECHNOLOGY - EDBT 2004, PROCEEDINGS, 2004, 2992 : 459 - 476
  • [48] Containment of conjunctive queries with arithmetic expressions
    Kiani, A
    Shiri, N
    ON THE MOVE TO MEANINGFUL INTERNET SYSTEMS 2005: COOPIS, DOA, AND ODBASE, PT 1, PROCEEDINGS, 2005, 3760 : 439 - 452
  • [49] Containment of Conjunctive Queries on Annotated Relations
    Green, Todd J.
    THEORY OF COMPUTING SYSTEMS, 2011, 49 (02) : 429 - 459
  • [50] PROCESSING CONJUNCTIVE PREDICATES AND QUERIES.
    Rosenkrantz, Daniel J.
    Hunt III, Harry B.
    Very Large Data Bases, International Conference on Very Large Data Bases, 1980, : 64 - 67