Optimization for queries with holistic functions

被引:2
|
作者
Chiou, AS
Sieg, JC
机构
关键词
D O I
10.1109/DASFAA.2001.916394
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The early grouping technique is a new method for optimizing aggregate queries. It provides more opportunities for the query optimizers to find optimal plans because all possible placements of the GROUP BY operators in the query trees are considered during the optimization process. However to employ this technique. one of the requirements is that the aggregate function in the query must be distributive, Using this property the evaluation of the GROUP BY operator can be started without all the relations are joined (i.e., the entire input are constructed). For queries with the non-distributive (or holistic) aggregate functions, the evaluation of the GROUP BY operators has to wait until the entire input is formed since these aggregate functions cannot be decomposed into sub-aggregate functions and their computations depend on the entire set of the input. As a result, to evaluate queries with the non-distributive aggregate functions, all the relations must be joined before the GROUP BY operator can be evaluated. Though the decem position of the holistic aggregate functions is nor obvious, instead, in this research we computes the auxiliary information, count, on the subsets of the input data, which is later used by the consolidating function as an aid to compute the original holistic aggregate functions. Since the computation of count (using the function COUNT ( ) ) is distributive, this auxiliary information can be computed before all the relations are joined. By extending the ability of the early grouping technique to handle aggregate queries with holistic aggregate functions, we provide the optimizers with mure opportunities to find optimal plans.
引用
收藏
页码:327 / 334
页数:4
相关论文
共 50 条
  • [1] OPTIMIZATION OF QUERIES WITH ADT FUNCTIONS
    ZHANG, XD
    OHBO, N
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 1994, E77D (06) : 660 - 668
  • [2] On the optimality of holistic algorithms for twig queries
    Choi, B
    Mahoui, M
    Wood, D
    DATABASE AND EXPERT SYSTEMS APPLICATIONS, PROCEEDINGS, 2003, 2736 : 28 - 37
  • [3] Path queries on functions
    Gagie, Travis
    He, Meng
    Navarro, Gonzalo
    THEORETICAL COMPUTER SCIENCE, 2019, 770 : 34 - 50
  • [4] GARNET: A Holistic System Approach for Trending Queries in Microblogs
    Jonathan, Christopher
    Magdy, Amr
    Mokbel, Mohamed F.
    Jonathan, Albert
    2016 32ND IEEE INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE), 2016, : 1251 - 1262
  • [5] Continuous answering holistic queries over sensor networks
    Liu, Kebin
    Chen, Lei
    Li, Minglu
    Liu, Yunhao
    2008 IEEE INTERNATIONAL SYMPOSIUM ON PARALLEL & DISTRIBUTED PROCESSING, VOLS 1-8, 2008, : 1243 - +
  • [6] Continuous Answering Holistic Queries over Sensor Networks
    Liu, Kebin
    Chen, Lei
    Liu, Yunhao
    Gong, Wei
    Nayak, Amiya
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2016, 27 (02) : 394 - 404
  • [7] OPTIMIZATION OF QUASICONJUNCTIVE QUERIES
    ZMITROVICH, AI
    THO, DS
    PROGRAMMING AND COMPUTER SOFTWARE, 1990, 16 (04) : 167 - 170
  • [8] Optimization of schemaSQL queries
    Davis, KB
    Sadri, F
    2001 INTERNATIONAL DATABASE ENGINEERING & APPLICATIONS SYMPOSIUM, PROCEEDINGS, 2001, : 111 - 116
  • [9] Optimization of disjunctive queries
    Greco, S
    LOGIC PROGRAMMING: PROCEEDINGS OF THE 1999 INTERNATIONAL CONFERENCE ON LOGIC PROGRAMMING, 1999, : 441 - 455
  • [10] Optimization of geofield queries
    Bajerski, Piotr
    PROCEEDINGS OF THE 2008 1ST INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY, 2008, : 241 - 244