ACM Home Page
Please provide us with feedback. Feedback
Ordering, distinctness, aggregation, partitioning and DQP optimization in sybase ASE 15
Full text PdfPdf (472 KB)
Source
International Conference on Management of Data archive
Proceedings of the 35th SIGMOD international conference on Management of data table of contents
Providence, Rhode Island, USA
SESSION: Industrial session 4: advances in query optimization table of contents
Pages 917-924  
Year of Publication: 2009
ISBN:978-1-60558-551-2
Authors
Mihnea Andrei  Sybase, Inc., Paris, France
Xun Cheng  Sybase, Inc., Dublin, CA, USA
Sudipto Chowdhuri  Sybase, Inc., Dublin, CA, USA
Curtis Johnson  Sybase, Inc., Dublin, CA, USA
Edwin Seputis  Sybase, Inc., Dublin, CA, USA
Sponsors
ACM: Association for Computing Machinery
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 18,   Downloads (12 Months): 104,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1559845.1559947
What is a DOI?

ABSTRACT

The Sybase ASE RDBMS version 15 was subject to major enhancements, including semantic partitions and a full QP rewrite. The new ASE QP supports horizontal and vertical parallel processing over semantically partitioned tables, and many other modern QP techniques, as cost-based eager aggregation and cost-based join relocation DQP. In the new query optimizer, the ordering, distinctness, aggregation, partitioning, and DQP optimizations were based on a common framework: plan fragment equivalence classes and logical properties. Our main outcomes are a) an eager enforcement policy for ordering, partitioning and DQP location; b) a distinctness and aggregation optimization policy, opportunistically based on the eager ordering enforcement, and which has an optimization-time computational complexity similar to join processing; c) support for the user to force all of the above optimizer decisions, still guaranteeing a valid plan, based on the Abstract Plan technology. We describe the implementation of this solution in the ASE 15 optimizer. Finally, we give our experimental results: the generation of such complex plans comes with a small increase of the optimizer's SS size, hence within an acceptable optimization time; at execution, we have obtained performance improvements of orders of magnitude for some queries.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
2
 
3
 
4
5
 
6
 
7
Graefe, G.: The Cascades Framework for Query Optimization. Data Engineering Bulletin 18(3): 1995
 
8
 
9
10
11
12
 
13
Transaction Processing Performance Council. TPC-H benchmark 2.0.0, July 2002. http://www.tpc.org
 
14
Xu, Y.: Efficiency in the Columbia Database Query Optimizer, M. S. Thesis, Portland State University, 1998
 
15

Collaborative Colleagues:
Mihnea Andrei: colleagues
Xun Cheng: colleagues
Sudipto Chowdhuri: colleagues
Curtis Johnson: colleagues
Edwin Seputis: colleagues