S. Chaudhuri. An Overview of Query Optimization in Relational Systems. PODS 1998: 34-43.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....the accuracy of the proposed heuristics are demonstrated by experiments. 1 Introduction Maintaining compact and accurate statistics on data distributions is of crucial importance for a number of tasks: 1) traditional query optimization that aims to find a good execution plan for a given query [5, 21], 2) approximate query answering and initial data exploration [13, 1, 18, 4, 12] 3) prediction of run times and result sizes of complex data extraction and data analysis tasks on data mining platforms, where absolute predictions with decent accuracy are mandatory for prioritization and ....

....design. The queries selected were Q 1 , Q 6 , Q 13 , Q 15 and Q 17 , referring to the Lineitem, Part, Orders, and Customer tables . The non numerical values present in a TPC H database are coded as numbers. For example, P. Brand consists of a constant text string and two integers in the range [1, 5]. We only store the 25 possible number combinations. Table 2 shows the query relevant attribute sets, the minimum sets Min(Q i ) for the above five queries. We chose these minimum sets according to a result size Query Min Set Q1 L.Shipdate Q6 L.Shipdate, L.Discount, L.Quantity Q13 J1.Extended ....

S. Chaudhuri. An overview of query optimization in relational systems. In Proceedings of ACM PODS Conference, pages 34--43, 1998.

....Rules and Semantic Optimization Related Work Within the intermediate query representations, there are a lot of opportunities for syntactic calculus or algebraic transformations. A lot of experience has been gained applying these optimizations in the relational or object oriented context [CS96, Cha98, GLR97, Hel98, Ioa96, KPH98, PS96, PS97, RS93, SdBB96, SO95a, SO95b, WM99] This thesis focuses on semantic query optimization, i.e. query transformations based on semantic knowledge rather than syntactic equivalence. In particular, semantic knowledge is represented by association rules of the ....

S. Chaudhuri. An overview of query optimization in relational systems. In ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), pages 34--43, 1998.

....selection of materialized views because a different set may lead to better materialized views. It is important to consider all three problems together in materialized view selection. A. Query Optimization A lot of research has been done on this topic. A valuable review can be found in [13] and [14]. In query optimization, join operation is one of the most expensive operations. For simplicity we only consider join operation in this paper. That is, query optimization will be regarded as join order optimization here. Assume that a database is given a set of relations . A local processing plan ....

S. Chaudhuri, "An overview of query optimization in relational systems, " in Proc. 17th ACM SIGACT-SIGMOD-SIGART Symp. Principles Database Syst. (PODS), June 1998, pp. 34--43.

.... relevant sources and be prohibitively costly, in terms of the network traffic, response time, and access costs (in the case of premium sources that charge for access) At first blush, it would seem that we should be able to directly apply the rich body of work on query optimization in databases [5] to solve this problem. Unfortunately, this does not work because many of the assumptions made in the traditional database query optimization do not hold in information gathering scenarios. To begin with, in traditional databases, redundancy and overlap among different sources is not a major ....

....costs can also be significant, this is offset to some extent by the fact that many data sources on the Internet do tend to have smaller extractable tables. Although the source call ordering problem is similar to the join ordering phase in the traditional database optimization algorithms [5], there are several reasons why the traditional as well as distributed database techniques are not suitable: Join ordering algorithms assume that all sources are relational databases. The sources on the Internet are rarely fully relational and tend to support limited types of queries. These ....

[Article contains additional citation context not shown here]

Surajit Chaudhuri. An overview of query optimization in relational systems. In Proceedings of the Sixteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, PODS 98, pages 34--43, 1998.

....areas, to which database technology has been introduced over the years. However, current commercial optimizers also remain hard to extend and modify when new operators, algorithms, or transformations have to be added, or when cost estimation techniques or search strategies have to be changed [Cha98]. As a result, the last decade has witnessed substantial efforts aiming to develop extensible query optimizers that would make such changes easier. Representative examples of extensible query optimizers include Starburst [Haa90] Volcano [GM93] and OPT [KW99] This paper reports on a specific ....

S. Chaudhuri. An Overview of Query Optimization in Relational Systems. In Proceedings of ACM PODS, Seattle, WA, pp. 34--43 (1998).

....turned off, and no I O amortization happens other than that caused by the Page Space Manager. In this case, scheduling the queries with the CF policy results in the best performance. 6 Related Work The query optimization and scheduling problem has been extensively investigated in past surveys [8, 11]. The work of Mehta et al. 18] is one of the first that has tackled the problem of scheduling queries in a parallel database by considering batches of queries, as opposed to one query at a time. The authors propose algorithms to explore common operations being executed in the context of a batch. ....

Surajit Chaudhuri. An overview of query optimization in relational systems. In Proceedings of the ACM Symposium on Principles of Database Systems on Principles of Database Systems, pages 34--43, Seattle, WA, 1998.

....cost in a network environment, or a combination of them. Since the cost estimation algorithm provides the core functionality that will be executed repeatedly during the query optimization process, eciently evaluating the costs of the access plans is of fundamental importance. Chaudhuri [27] summarizes the basic estimation framework deriving from the System R system developed by the IBM: 28 Create Operator Trees Get Next Tree [ can not be expanded ] can be expanded ] Expand Operator Tree Convert to Access Plan Perform Cost Pruning Discard Non interesting [expanded] ....

Surajit Chaudhuri. An Overview of Query Optimization in Relational Systems. Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Seattle, pages 34-43, June 1998.

....and make them available for collaborative use. As a result, efficient handling of multiple query workloads is an important optimization in many application domains [2, 21, 38] The query optimization and scheduling problem has been extensively investigated in the relational database community [15]. Multiple query optimization techniques for relational databases traditionally rely on caching common subexpressions [25, 30, 33, 37] Nevertheless, deploying these techniques in a broader context, specifically for data analysis applications, remains a challenging problem. Several database and ....

S. Chaudhuri. An overview of query optimization in relational systems. In Proceedings of the ACM Symposium on Principles of Database Systems on Principles of Database Systems, pages 34--43, Seattle, WA, 1998.

....space. An enumeration algorithm that can search through the search space. A desirable optimizer is one where 3 1. The search space includes plans with low cost. 2. The costing technique is accurate. 3. The enumeration algorithm is ecient. Query optimization is described in detail in [Cha98] and query evaluation techniques are described in [Gra93] Datacube queries belong to the class of aggregation queries. We will brie y describe the traditional query evaluation techniques for aggregate queries in SQL which make use of the GROUP BY clause in the next chapter. 1.3 Analytical ....

S. Chaudhuri. An overview of query optimization in relational systems. In Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, Seattle, 1998.

....server may need to answer queries simultaneously submitted by multiple clients. Thus, efficient handling of multiple query workloads is an important optimization in many application domains [2, 9, 13] The query optimization and scheduling problem has been extensively investigated in past surveys [7]. Traditionally, multiple query optimization techniques for relational databases rely on caching common subexpressions [11] Cache space is limited by nature, and it is very well possi This research was supported by the National Science Foundation under Grants #EIA 0121161, #ACI 9619020 (UC ....

S. Chaudhuri. An overview of query optimization in relational systems. In Proceedings of the ACM Symposium on Principles of Database Systems on Principles of Database Systems, pages 34--43, Seattle, WA, 1998.

....selection of materialized views because a di erent set may lead to better materialized views. It is important to consider all three problems together in materialized view selection. A. Query Optimization A lot of research has been done on this topic. A valuable review can be found in [13] [14]. In query optimization, join operation is one of the most expensive operations. For simplicity we only consider join operation in this paper. That is, query optimization will be regarded as join order optimization here. Assume that a database D is given a set of relations R 1 ; R 2 ; Rm . A ....

S. Chaudhuri, \An overview of query optimization in relational systems," PODS, pp. 34-43, 1998.

....the technique of query integration is related to query optimization. There has been a long run of research in conventional query optimization that focuses on governing the cost of query processing [1, 4, 5, 9, 10, 12, 13, 14, 15] An overview of query optimization in relational database systems [3] explains the foundations and presents samplings of signi cant work in the area. The overview provided an understanding of the existing engineering framework for the area of query optimization, and viewed query optimization as a dicult search problem. However, query integration departs from ....

Surajit Chaudhuri. An overview of query optimization in relational systems. In Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 34-43, June 1998.

....query optimization is naturally involved with our work while we hope the refresh cost can be reduced. It has been a long run for research of conventional query optimization that concentrates on governing the cost of a single query processing. An overview of query optimization in relational systems[2] explained the foundations and presented samplings of significant work in the area. Query optimization in our work means more than previous work. Besides searching an optimal plan for execution of a single refresh query, we are emphasizing on multiple query optimization and developing optimization ....

S. Chaudhuri. An overview of query optimization in relational systems. In Proceedings of the Seventeenth ACM SIGACTSIGMOD -SIGART Symposium on Principles of Database Systems, pages 34--43, June 1998.

....operation for a set of views, we are indeed facing the task of optimization of a set of queries. It has been a long run for research of conventional query optimization that concentrates on governing the cost of a single query processing. An overview of query optimization in relational systems[3] explained the foundations and presented samplings of signi cant work in the area. The overview provided an understanding of the existing engineering framework for the area of query optimization, and viewed query optimization as a dicult search problem. However, query optimization in our work ....

Surajit Chaudhuri. An overview of query optimization in relational systems. In Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 34-43, June 1998.

No context found.

S. Chaudhuri. An Overview of Query Optimization in Relational Systems. PODS 1998: 34-43.

No context found.

S. Chaudhuri, An overview of query optimization in relational systems, Proc. PODS (1998), Seattle (WA), USA.

No context found.

Chaudhuri, S.: An overview of query optimization in relational systems, Proc. PODS, Seattle (WA), USA, 1998.

No context found.

Chaudhuri, S., An Overview of Query Optimization in Relational Systems, Proc. PODS 1998, Seattle (WA), USA.

No context found.

S. Chaudhuri. An overview of query optimization in relational systems. In PODS, 1998.

No context found.

S. Chaudhuri. An Overview of Query Optimization in Relational Systems. In Proceedings of ACM PODS, pp. 34--43 (1998).

No context found.

Chaudhuri, S., (1998), "An Overview of Query Optimization in Relational Systems", Proceedings of the Seventeenth ACM SIGACTSIGMOD -SIGART Symposium on Principles of Database Systems, June 1-3, Seattle, Washington, ACM Press, ISBN 0-89791-996-3, pp. 34-43. 208

No context found.

Surajit Chaudhuri. An overview of query optimization in relational systems. In Proceedings of the Sixteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, PODS 98, pages 34--43, 1998.

No context found.

S. Chaudhuri. An Overview of Query Optimization in Relational Systems. In Proceedings of the 17th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), Seattle, Washington, USA, 1998.

No context found.

Surajit Chaudhuri. An overview of query optimization in relational systems. In Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 1-3, 1998.

No context found.

S. Chaudhuri. An Overview of Query Optimization in Relational Systems. PODS 1998: 34-43.

First 50 documents

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC