Paper Info
Title
Query Processing of Pre-partitioned Data Using Sandwich Operators.
Abstract
In this paper we present the "Sandwich Operators", an elegant approach to exploit pre-sorting or pre-grouping from clustered storage schemes in operators such as Aggregation/Grouping, HashJoin, and Sort of a database management system. Thereby, each of these operator types is "sandwiched" by two new operators, namely PartitionSplit and PartitionRestart. PartitionSplit splits the input relation into its smaller independent groups on which the sandwiched operator is executed. After a group is processed, PartitionRestart is used to trigger the execution on the following group. Executing each of these operator types with the help of the Sandwich Operators introduces minimal overhead and does not penalize performance of the sandwiched operator, as its implementation remains unchanged. On the contrary, we show that sandwiched execution of each operator results in lower memory consumption and faster execution time. PartitionSplit and PartitionRestart replace special implementations of partitioned versions of these operators. For many groups Sandwich Operators turn blocking operators into pseudo streaming operators, resulting in faster response time for the first query results.
Year
DOI
Venue
2012
10.1007/978-3-642-39872-8_6
Lecture Notes in Business Information Processing
Keywords
DocType
Volume
indexing,clustering,partitioned data,query processing
Conference
154
ISSN
Citations 
PageRank 
1865-1348
3
0.40
References 
Authors
11
3
Name
Order
Citations
PageRank
Stephan Baumann1212.32
Peter Boncz22517244.81
Kai-uwe Sattler31144126.81