Computing SQL queries with Boolean aggregates

被引：0
|
作者：
Badia, A [1 ]
机构：
[1] Univ Louisville, Comp Engn & Comp Sci Dept, Louisville, KY 40292 USA
来源：
DATA WAREHOUSING AND KNOWLEDGE DISCOVERY, PROCEEDINGS | 2003年 / 2737卷
关键词：
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We introduce a new method for optimization of SQL queries with nested subqueries. The method is based on the idea of Boolean aggregates, aggregates that compute the conjunction or disjunction of a set of conditions. When combined with grouping, Boolean aggregates allow us to compute all types of non-aggregated subqueries in a uniform manner. The resulting query trees are simple and amenable to further optimization. Our approach can be combined with other optimization techniques and can be implemented with a. minimum of changes in any cost-based optimizer.
引用
收藏
页码：391 / 400
页数：10
相关论文
共 50 条
  • [41] Unrolling SQL: 1999 Recursive Queries
    Boniewicz, Aleksandra
    Stencel, Krzystof
    Wisniewski, Piotr
    COMPUTER APPLICATIONS FOR DATABASE, EDUCATION, AND UBIQUITOUS COMPUTING, 2012, 352 : 345 - 354
  • [42] Optimization of Linear Recursive Queries in SQL
    Ordonez, Carlos
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2010, 22 (02) : 264 - 277
  • [43] TRANSLATING SQL INTO RELATIONAL ALGEBRA - OPTIMIZATION, SEMANTICS, AND EQUIVALENCE OF SQL QUERIES
    CERI, S
    IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1985, 11 (04) : 324 - 345
  • [44] ACL-SQL: Generating SQL Queries from Natural Language
    Kaoshik, Ronak
    Patil, Rohit
    Prakash, R.
    Agarawal, Shaurya
    Jain, Naman
    Singh, Mayank
    CODS-COMAD 2021: PROCEEDINGS OF THE 3RD ACM INDIA JOINT INTERNATIONAL CONFERENCE ON DATA SCIENCE & MANAGEMENT OF DATA (8TH ACM IKDD CODS & 26TH COMAD), 2021, : 423 - 423
  • [45] Boolean queries optimization by genetic algorithms
    Húsek, D
    Owais, SSJ
    Krömer, P
    Snásel, V
    NEURAL NETWORK WORLD, 2005, 15 (05) : 395 - 409
  • [46] Bounded queries, approximations, and the Boolean Hierarchy
    Chang, R
    INFORMATION AND COMPUTATION, 2001, 169 (02) : 129 - 159
  • [47] On the use of negation in Boolean IR queries
    Klein, Shmuel T.
    INFORMATION PROCESSING & MANAGEMENT, 2009, 45 (02) : 298 - 311
  • [48] Decision trees with Boolean threshold queries
    BenAsher, Y
    Newman, I
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1995, 51 (03) : 495 - 502
  • [49] BOUNDED QUERIES TO SAT AND THE BOOLEAN HIERARCHY
    BEIGEL, R
    THEORETICAL COMPUTER SCIENCE, 1991, 84 (02) : 199 - 223
  • [50] A monotone preservation result for Boolean queries expressed as a containment of conjunctive queries
    Surinx, Dimitri
    Van den Bussche, Jan
    INFORMATION PROCESSING LETTERS, 2019, 150 : 1 - 5
12345