Back to Search
Start Over
On Producing High and Early Result Throughput in Multijoin Query Plans.
- Source :
-
IEEE Transactions on Knowledge & Data Engineering . Dec2011, Vol. 23 Issue 12, p1888-1902. 0p. - Publication Year :
- 2011
-
Abstract
- This paper introduces an efficient framework for producing high and early result throughput in multijoin query plans. While most previous research focuses on optimizing for cases involving a single join operator, this work takes a radical step by addressing query plans with multiple join operators. The proposed framework consists of two main methods, a flush algorithm and operator state manager. The framework assumes a symmetric hash join, a common method for producing early results, when processing incoming data. In this way, our methods can be applied to a group of previous join operators (optimized for single-join queries) when taking part in multijoin query plans. Specifically, our framework can be applied by 1) employing a new flushing policy to write in-memory data to disk, once memory allotment is exhausted, in a way that helps increase the probability of producing early result throughput in multijoin queries, and 2) employing a state manager that adaptively switches operators in the plan between joining in-memory data and disk-resident data in order to positively affect the early result throughput. Extensive experimental results show that the proposed methods outperform the state-of-the-art join operators optimized for both single and multijoin query plans. [ABSTRACT FROM PUBLISHER]
Details
- Language :
- English
- ISSN :
- 10414347
- Volume :
- 23
- Issue :
- 12
- Database :
- Academic Search Index
- Journal :
- IEEE Transactions on Knowledge & Data Engineering
- Publication Type :
- Academic Journal
- Accession number :
- 66816151
- Full Text :
- https://doi.org/10.1109/TKDE.2010.182