ACM Home Page
Please provide us with feedback. Feedback
An architecture for recycling intermediates in a column-store
Full text PdfPdf (438 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: Research session 8: column stores table of contents
Pages 309-320  
Year of Publication: 2009
ISBN:978-1-60558-551-2
Authors
Milena G. Ivanova  Centrum Wiskunde en Informatica, Amsterdam, Netherlands
Martin L. Kersten  Centrum Wiskunde en Informatica, Amsterdam, Netherlands
Niels J. Nes  Centrum Wiskunde en Informatica, Amsterdam, Netherlands
Romulo A.P. Gonçalves  Centrum Wiskunde en Informatica, Amsterdam, Netherlands
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): 62,   Downloads (12 Months): 226,   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.1559879
What is a DOI?

ABSTRACT

Automatically recycling (intermediate) results is a grand challenge for state-of-the-art databases to improve both query response time and throughput. Tuples are loaded and streamed through a tuple-at-a-time processing pipeline avoiding materialization of intermediates as much as possible. This limits the opportunities for reuse of overlapping computations to DBA-defined materialized views and function/result cache tuning.

In contrast, the operator-at-a-time execution paradigm produces fully materialized results in each step of the query plan. To avoid resource contention, these intermediates are evicted as soon as possible.

In this paper we study an architecture that harvests the by-products of the operator-at-a-time paradigm in a column store system using a lightweight mechanism, the recycler. The key challenge then becomes selection of the policies to admit intermediates to the resource pool, their retention period, and the eviction strategy when facing resource limitations.

The proposed recycling architecture has been implemented in an open-source system. An experimental analysis against the TPC-H ad-hoc decision support benchmark and a complex, real-world application (SkyServer) demonstrates its effectiveness in terms of self-organizing behavior and its significant performance gains. The results indicate the potentials of recycling intermediates and charters a route for further development of database kernels.


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
C. Bornhövd, M. Altinel, C. Mohan, H. Pirahesh, and B. Reinwald. Adaptive Database Caching with DBCache. IEEE Data Eng. Bull., 27(2):11--18, 2004.
4
 
5
 
6
C.-H. Choi, J. X. Yu, and H. Lu. Dynamic Materialized View Management Based on Predicates. In APWeb, pages 583--594, 2003.
 
7
8
 
9
10
 
11
12
 
13
 
14
G. Luo. Partial Materialized Views. In ICDE, pages 756--765, 2007.
15
16
 
17
MonetDB, http://monetdb.cwi.nl/, 2008.
 
18
19
 
20
Sloan Digital Sky Survey / SkyServer, 2008.
21
 
22
 
23
Transaction Processing Performance Council. TPC Benchmark H, Revision 2.6.2, 2008.
24
 
25
J. Zhou, P.-Å. Larson, J. Goldstein, and L. Ding. Dynamic Materialized Views. In ICDE, pages 526--535, 2007.
 
26

Collaborative Colleagues:
Milena G. Ivanova: colleagues
Martin L. Kersten: colleagues
Niels J. Nes: colleagues
Romulo A.P. Gonçalves: colleagues