ORDERING CONJUNCTIVE QUERIES.

被引：0
|
作者：
Smith, David E. [1 ]
Genesereth, Michael R. [1 ]
机构：
[1] Stanford Univ, Computer Science Dep,, Stanford, CA, USA, Stanford Univ, Computer Science Dep, Stanford, CA, USA
来源：
| 1600年 / 26期
关键词：
BEST ORDERING - CONJUNCT ORDERING - CONJUNCTIVE QUERIES - PROBLEM-SOLVERS;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [21] Fitting Algorithms for Conjunctive Queries
    ten Cate, Balder
    Funk, Maurice
    Jung, Jean Christoph
    Lutz, Carsten
    SIGMOD RECORD, 2023, 52 (04) : 6 - 18
  • [22] Semantic Optimization of Conjunctive Queries
    Barcelo, Pablo
    Figueira, Diego
    Gottlob, Georg
    Pieris, Andreas
    JOURNAL OF THE ACM, 2020, 67 (06)
  • [23] ON CONJUNCTIVE QUERIES CONTAINING INEQUALITIES
    KLUG, A
    JOURNAL OF THE ACM, 1988, 35 (01) : 146 - 160
  • [24] The complexity of acyclic conjunctive queries
    Gottlob, G
    Leone, N
    Scarcello, F
    39TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1998, : 706 - 715
  • [25] Learnability of Solutions to Conjunctive Queries
    Chen, Hubie
    Valeriote, Matthew
    JOURNAL OF MACHINE LEARNING RESEARCH, 2019, 20
  • [26] The resilience of conjunctive queries with inequalities
    Qin, Biao
    Li, Deying
    Zhou, Chunlai
    INFORMATION SCIENCES, 2022, 613 : 982 - 1002
  • [27] EFFICIENT APPROXIMATIONS OF CONJUNCTIVE QUERIES
    Barcelo, Pablo
    Libkin, Leonid
    Romero, Miguel
    SIAM JOURNAL ON COMPUTING, 2014, 43 (03) : 1085 - 1130
  • [28] OPTIMIZATION OF A SUBCLASS OF CONJUNCTIVE QUERIES
    DUBLISH, P
    BISKUP, J
    SAGIV, Y
    LECTURE NOTES IN COMPUTER SCIENCE, 1990, 470 : 455 - 469
  • [29] OPTIMIZATION OF A SUBCLASS OF CONJUNCTIVE QUERIES
    BISKUP, J
    DUBLISH, P
    SAGIV, Y
    ACTA INFORMATICA, 1995, 32 (01) : 1 - 26
  • [30] The complexity of acyclic conjunctive queries
    Gottlob, G
    Leone, N
    Scarcello, F
    JOURNAL OF THE ACM, 2001, 48 (03) : 431 - 498
12345