STRUCTURE AND COMPLEXITY OF RELATIONAL QUERIES

被引：277
|
作者：
CHANDRA, A
HAREL, D
机构：
来源：
JOURNAL OF COMPUTER AND SYSTEM SCIENCES | 1982年 / 25卷 / 01期
关键词：
D O I：
10.1016/0022-0000(82)90012-5
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：99 / 128
页数：30
相关论文
共 50 条
  • [41] Containment of relational queries with annotation propagation
    Tan, WC
    DATABASE PROGRAMMING LANGUAGES, 2004, 2921 : 37 - 53
  • [42] OPTIMIZATION STRATEGIES FOR RELATIONAL DISJUNCTIVE QUERIES
    CIACCIA, P
    SCALAS, MR
    IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1989, 15 (10) : 1217 - 1235
  • [43] On the Complexity of Resilience for Aggregation Queries
    Miao, Dongjing
    Cai, Zhipeng
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS (COCOA 2018), 2018, 11346 : 696 - 706
  • [44] The complexity of acyclic conjunctive queries
    Gottlob, G
    Leone, N
    Scarcello, F
    JOURNAL OF THE ACM, 2001, 48 (03) : 431 - 498
  • [45] Inherent complexity of recursive queries
    Cosmadakis, Stavros
    Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1999, : 148 - 154
  • [46] The complexity of halfspace area queries
    Langerman, S
    DISCRETE & COMPUTATIONAL GEOMETRY, 2003, 30 (04) : 639 - 648
  • [47] On the Complexity of Existential Positive Queries
    Chen, Hubie
    ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2014, 15 (01)
  • [48] On the Complexity of Halfspace Area Queries
    Stefan Langerman
    Discrete & Computational Geometry, 2003, 30 : 639 - 648
  • [49] The complexity of acyclic conjunctive queries
    Gottlob, G
    Leone, N
    Scarcello, F
    39TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1998, : 706 - 715
  • [50] Inherent complexity of recursive queries
    Cosmadakis, S
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2002, 64 (03) : 466 - 495
12345