Forecasting the cost of processing multi-join
queries via hashing for main-memory databases
Database management systems (DBMSs) carefully optimize complex multi-join queries to avoid expensive disk I/O. As servers today feature tens or hundreds of gigabytes of RAM, a significant fraction of many analytic databases becomes memory-resident. Even after careful tuning for an in-memory environment, a linear disk I/O model such as the one implemented in PostgreSQL may make query response time predictions that are up to slower than the optimal multi-join query plan over memory-resident data. This paper introduces a memory I/O cost model to identify good evaluation strategies for complex query plans with multiple hash-based equi-joins over memory-resident data. The proposed cost model is carefully validated for accuracy using three different systems, including an Amazon EC2 instance, to control for hardware-specific differences. Prior work in parallel query evaluation has advocated right-deep and bushy trees for multi-join queries due to their greater parallelization and pipelining potential. A surprising finding is that the conventional wisdom from shared-nothing disk-based systems does not directly apply to the modern shared-everything memory hierarchy. As corroborated by our model, the performance gap between the optimal left-deep and right-deep query plan can grow to about as the number of joins in the query increases.
Extended version of the paper to appear in SoCC’15 \copyrightyear2015 \copyrightdata978-1-nnnn-nnnn-n/yy/mm \doinnnnnnn.nnnnnnn
Computer Science & Engineering
The Ohio State University email@example.com \authorinfoSpyros Blanas Computer Science & Engineering
The Ohio State University firstname.lastname@example.org
Ad-hoc analytical queries commonly perform a series of equi-joins between different tables. A database management system needs to accurately forecast the response time of different join evaluation orders to provide timely answers to these queries. A major component of this prediction is an estimation of the cost to access the data. These I/O cost models have traditionally assumed that all data reside in a single directly-attached hard disk. However, cloud infrastructure providers such as Amazon EC2 offer memory-optimized instance types with dozens of vCPUs and hundreds of gigabytes of memory. In this environment, a significant fraction of the database fits in memory and must be processed in parallel by multiple CPU cores for timely responses to user queries.
The database research community has been investigating query processing techniques for memory-resident datasets for more than three decades DeWitt et al. ; Lehman and Carey  and has developed detailed cost models for single-core CPUs with deep cache hierarchies Manegold et al. [2002, 2000]. The commoditization of multi-core, multi-socket systems have rekindled research interest in query execution Candea et al. ; Krikellas et al.  and efficient processing techniques for modern hardware Li et al. ; Polychroniou and Ross . In-memory hash-based join algorithms, in particular, have received significant attention Balkesen et al. [2013a]; Blanas and Patel ; Leis et al. . The ramifications of ample single-node parallelism for multi-join query evaluation over in-memory data, however, are not as well understood.
As a consequence, systems implementers find themselves in the dark regarding how to best synthesize query plans for complex multi-join queries that efficiently use all CPU cores, and turn to prior research in parallel query evaluation for parallel databases with a shared-nothing architecture. A multi-join query is commonly evaluated as a series of hash-joins between two tables. For every hash join, the query optimizer chooses which input will be stored in the hash table (henceforth referred to as the build or left side) and which input will be used to probe the hash table (henceforth referred to as the probe or right side). Prior work in parallel hash-based multi-join query evaluation has advocated right-deep query trees, because all build (“left”) subtrees can be processed in parallel and then probed in a single long pipeline Schneider and DeWitt . This conventional wisdom on good query plans is commonly encoded in ad-hoc heuristics in parallel query optimizers to avoid the combinatorial explosion of the search space Ono and Lohman . Although a single database server may have as many CPU cores as a parallel database in the past, the hardware architecture does not otherwise resemble a shared-nothing environment. Existing query optimizers need to be augmented to accurately model the resource needs of ad-hoc queries over in-memory data.
This paper focuses on hash-based join evaluation strategies for main-memory databases and contributes a detailed cost model that accurately predicts the query response time of ad-hoc multi-join queries. Our thesis is that the response time for processing a complex multi-join query using all CPU cores is proportional to the number of memory operations weighted by the performance cost for different access patterns. By exhaustively exploring all possible query plans for a join between 4 tables, we find that the memory access cost that is predicted by our model proves to be an accurate proxy for elapsed time. We then demonstrate that linear disk I/O models, such as the current cost model in PostgreSQL, cannot accurately account for the access patterns to and from main memory even after optimally adjusting the model weights through linear regression.
The proposed cost model is conceptually simple as it does not account for the multi-layered cache hierarchy or any NUMA effects. We find that the loss of accuracy due to these two factors is minor for the cache-oblivious non-partitioned hash join algorithm that we model. Yet by only focusing on the top layer of the memory hierarchy, our model gains in versatility and can readily adapt to the underlying hardware. The conceptual simplicity of the model is particularly important in light of the limited topological information about the CPU and cache hierarchy that can be gleaned from a VM in a cloud environment. Experiments with on-premises systems and Amazon EC2 show that our model accurately predicts how the response time of individual query plans will change based on the performance characteristics of different systems.
A surprising finding from our thorough experimental evaluation is that some left-deep query trees can be more efficient than their bushy and right-deep tree counterparts if the join pipeline must run until completion because they result in substantially less memory traffic during execution. As corroborated by our model, the performance gap between the optimal left-deep and right-deep query tree can grow to about as the number of joins in the query increases. This finding challenges the widely held belief among systems implementers that MPP-style optimization is “good enough” for parallel in-memory query processing.
2 Background and Related Work
Query processing techniques for in-memory data
Research in main memory database management systems commenced more than three decades ago. Early work investigated join algorithms for main memory database systems by DeWitt et al. DeWitt et al.  and an investigation of in-memory query processing techniques by Lehman and Carey Lehman and Carey . As the CPU architecture evolved, additional hardware operations were shown to become performance bottlenecks. Ailamaki et al. Ailamaki et al.  studied the performance bottlenecks of four commercial database management systems and highlighted the importance of minimizing L2 data cache stalls and L1 instruction cache stalls. Shatdal et al. Shatdal et al.  proposed to make the join algorithm cache-conscious to improve locality and join performance by adding a partitioning step before the join. Boncz et al. Boncz et al.  proposed radix-based query processing techniques to improve in-memory performance by reducing cache and TLB misses.
As multi-core CPU architectures became the norm, the database research community explored alternatives to the established query processing paradigm. Harizopoulos et al. Harizopoulos et al.  proposed a pipelined model for query processing where operators map to hardware cores and can be shared among multiple queries. Arumugam et al. Arumugam et al.  developed a push-based dataflow engine for query processing. Krikellas et al. Krikellas et al.  investigated techniques to dynamically generate code for query execution. Neumann Neumann  proposed to further improve performance by compiling queries into native machine code using LLVM. Giannikis et al. Giannikis et al.  designed a system to process thousands of concurrent queries by sharing computation and intermediate results.
There is also a lively and ongoing debate on efficient parallel in-memory equi-join techniques. Balkesen et al. Balkesen et al. [2013a] compare sort-merge and radix-hash joins in a multi-core, main-memory environment and claimed that radix-hash join was superior to sort-merge join. Leis et al. Leis et al.  break input data into small fragments and assign each to a thread to run entire operator pipelines. By controlling the dispatch of data fragments, query execution can be parallelized dynamically in a NUMA-aware fashion. Polychroniou and Ross Polychroniou and Ross  proposed a family of main-memory partitioning algorithms that includes hash, radix and range partitioning. Li et al. Li et al.  studied data shuffling in a NUMA system and improved the performance by employing thread binding, NUMA-aware thread allocation and relaxed global coordination. Lang et al. Lang et al.  optimized the hash join for NUMA architectures by optimizing the physical representation of the hash table. Barber et al. Barber et al.  introduced concise hash tables which significantly reduce memory consumption while still offering competitive performance.
Researchers also have proposed cost models for in-memory data processing. Manegold et al. Manegold et al.  proposed a hierarchical model to capture all levels of a cache hierarchy and show that this can accurately capture the total response time of quick sort, hash join and partitioning operations after calibrating for the CPU cost of each algorithm.
Parallel query evaluation strategies
Multi-join query plan optimization is a difficult problem because of the uncertainty over the cardinality of intermediate results and the large optimization space. Chaudhuri summarized the foundations and significant research findings of query optimization Chaudhuri , and Lohman has recently identified open problems in query optimization Lohman .
Prior research has extensively studied parallel and distributed query optimization techniques. R* was an early research prototype that optimized queries to minimize data transfer costs in a shared-nothing environment Lohman et al. . Chen et al. Chen et al. [1992b] proposed to generate parallel query plans in two phases: first generate the optimal query plan for a single node, and then to parallelize it for a multi-processor environment. Hong and Stonebraker Hong and Stonebraker  showed that two phase optimization produces good query plans for shared-memory systems. Researchers have also studied parallel hash join algorithms. DeWitt and Gerber DeWitt and Gerber  introduced multi-processor versions of popular hash join algorithms for a single join and evaluated their advantages and disadvantages in a multi-processor environment. Recently, Chu et al. Chu et al.  propose a novel distributed multi-way join algorithm that has been theoretically proven to have better performance than evaluating the multi-way join as a series of binary joins.
The performance of different multi-join evaluation strategies has also been extensively studied. Schneider and DeWitt Schneider and DeWitt  studied multi-way join query processing through hash-based methods in the Gamma parallel database system. They observed that trees with shallow hash-join build phases and a long probe pipeline (“right-deep” trees) can provide significant performance advantages in large multiprocessor database machines. The key advantages of right-deep query trees are the ample parallelization potential, as each build subtree can be executed concurrently, and that no intermediate results need to be materialized in the long probe pipeline because results are streamed from one operator to the next.
Right-deep trees introduce the problem of processor allocation to each join sub-tree during parallel evaluation, and Lu et al. Lu et al.  use a greedy algorithm to generate query plans for multi-join queries that determines the order of each join, but also the number of parallel joins and the processor assignment to each join. Ioannidis and Kang Ioannidis and Kang  show that optimization for bushy and left-deep trees is easier than optimizing left-deep trees alone. Chen et al. Chen et al. [1992a] proposed bushy trees with right-deep pipelines, which they call segmented right-deep trees, for efficient execution of multi-join queries. Query evaluation strategies for shared-nothing main-memory database management systems have been examined in the context of the PRISMA/DB system Wilschut et al. . Wilschut and Apers have identified synchronization costs as the performance bottleneck from parallelism Wilschut and Apers . Recently, Giceva et al. Giceva et al.  have studied how to allocate resources and deploy query plans on multi-cores in the context of their operator-centric SharedDB system.
Liu and Rundensteiner Liu and Rundensteiner  introduced segmented bushy query trees for the efficient evaluation of multi-join queries. Pipeline delays have also been studied in research by Deshpande and Hellerstein Deshpande and Hellerstein  who propose to reduce pipeline delays by plan interleaving between plan fragments. Ahmed et al. Ahmed et al.  have proposed a technique to optimize bushy join trees for snowstorm queries in the Oracle database system.
Machine learning techniques have also been explored to predict the response time of a query. IBM’s DB2 introduced LEO, a learning optimizer, to adjust the query optimizer’s prediction based on the observed query cost Stillger et al. ; Markl and Lohman . Zhang et al. Zhang et al.  proposed a statistical learning approach, COMET, to adapt to changing workloads for XML operations. Duggan et al. Duggan et al.  used machine learning techniques to predict the performance of concurrent workloads. Akdere et al. Akdere et al.  introduced two learning-based models, a plan-level model and an operator-level model, and contributed a hybrid model to predict query performance. Li et al. Li et al.  combined regression tree models and scaling functions to estimate the resource consumption of individual operators.
The non-partitioned in-memory hash join algorithm
Our proposed memory I/O model captures the fundamental memory access operations from the popular non-partitioned in-memory hash join algorithm and the data structure layout optimization by Balkesen et al. Balkesen et al. [2013b]. The main data structure is a hash table that is shared by all threads (see Figure 1). The hash table is a contiguous array of buckets. Each bucket contains metadata and the payload. Metadata are header information and a pointer to overflow buckets if this bucket has spilled. The hash join is divided into two phases: the build phase and probe phase. During the build phase, an empty hash table is created and the build table is divided into equi-sized parts which are assigned to different threads. All threads then scan their input sequentially, hash the join key of every tuple, lock the bucket, write the tuple into the bucket, and then unlock the bucket. The probe phase starts after the entire build table has been consumed. In the probe phase, all threads sequentially scan the probe table , hash the join key of every tuple, and then join with the tuple in the corresponding bucket if the join keys are equal.
3 Modeling memory I/O
A fundamental challenge in building memory I/O models is the pull-based nature of data movement throughout the memory hierarchy. In stark contrast to the disk I/O hierarchy where data movement is explicitly initiated by the application, application control of memory I/O is limited to prefetch, flush and non-temporal access hints. Complicating matters further, memory loads and stores are not only triggered when retrieving user data for query processing, but also when manipulating local variables, accessing the call stack and co-ordinating with other CPU cores.
Determining the components of a memory I/O cost model is therefore a delicate balancing act. It is equally important to include sufficient detail to make accurate predictions but also avoid adding too many parameters that may exaggerate the effect of minor fluctuations in the model inputs because of over-fitting. The latter is particularly important for memory I/O cost models that need to be generic to avoid obsolescence in light of the quick pace of innovation in hardware.
|SR||Read one cache line sequentially|
|RR||Read one random cache line|
|SW||Write one cache line sequentially|
|RW||Write one random cache line|
When constructing performance models for general algorithms it is important to model every level of the cache hierarchy. The non-partitioned hash join algorithm, however, is cache-oblivious and memory-bound. Therefore, our thesis is that when modeling a sequence of non-partitioned hash joins the query response time is dominated by the cost of accessing main memory and not individual caches.
Not all access patterns to memory are equally expensive, however. Sequential access patterns are more efficient because they leverage prefetching and result in few TLB misses. Similarly, writes are more expensive than reads because they require exclusive access to the cache line under the MESIF cache coherence protocol, which may require cache line invalidations in other CPU cores. (We outline the four access patterns in Table 1.) We thus model the response time for processing query as being proportional to the number of operations weighted by the performance cost for each access pattern :
The performance cost for each access pattern A is obtained experimentally for each system through a controlled microbenchmark procedure, which is described in detail in Section 3.1. The number of operations is calculated from our model in Sections 3.2 and 3.3. Section 3.4 summarizes key insights obtained by our model.
Modeling assumptions and limitations
Our model assumes that memory is shared by all processing cores, it is automatically kept coherent by the hardware and that data transfer operations are performed at the granularity of a cache line. We also assume that the database and the working memory for a query can fit in memory and no paging to secondary storage occurs. We only consider multi-join queries that are evaluated in parallel from all threads using the non-partitioned hash-join algorithm by Balkesen et al. Balkesen et al. [2013b], which has been shown to offer competitive performance while judiciously using memory Blanas and Patel .
The fact that our proposed model does not account for any caching or NUMA effects does not imply that architecture-awareness is not important. On the contrary, the memory I/O cost model is an abstraction of a well-designed query engine that is not compute-bound and will not trigger redundant memory I/O during query processing. Inefficient implementations of the non-partitioned hash join will result in higher memory traffic, which will not be captured by the model. In particular, we assume that the hash table is striped on all available NUMA nodes.
Finally, a limitation of join cost modeling is the assumption that the cardinality of intermediate join results is known or can be estimated reasonably accurately. We acknowledge that cardinality estimation is not a solved problem Lohman . Inaccuracies in estimating the cardinality or the skew of the build side are particularly problematic. Improperly sized hash tables will result in the creation and probing of overflow hash buckets. Some DBMSs will track excessive bucket overflows and pause the hash table build process to resize the hash table and accommodate more tuples. New join algorithms have recently been proposed to avoid populating the hash table with heavily-skewed data Polychroniou et al. . Bucket overflows and hash table resizes are not accounted for by the proposed model.
3.1 Bootstrapping the model
The model depends on the performance cost for each access pattern for accurate predictions. These general performance costs encapsulate (1) differences in the underlying hardware of each system such as different CPU models or different memory modules, (2) some hardware configuration options such as memory timings and NUMA settings that can be changed in the BIOS, and (3) OS-specific configuration options, such as the number and size of huge TLB pages. Bootstrapping consists of four specific microbenchmarks where all threads transfer data from memory such that only one specific access pattern is triggered at a time. The microbenchmarks do not perform any computation, so the derived performance costs can be thought as a “worst-case” scenario where all threads are waiting on memory I/O.
To derive the performance cost for the SR and SW patterns each thread allocates a NUMA-local contiguous array and populates it with random values. Each array is sized to a power of two such that as much of the available memory in the system is used, but no paging to secondary storage occurs. Every thread then concurrently reads its local array sequentially and either accumulates an 8-byte value if the access pattern is SR, or accumulates and writes an 8-byte value back if the access pattern is SW. (Notice that the SW access pattern includes an explicit memory read.)
The RR and RW microbenchmarks use an array of the same size as for SR and SW that is now shared between all threads. Before the benchmarking, each thread first generates a random sequence of cache-aligned array offsets in NUMA-local memory and waits on a barrier. The benchmarking then starts, each thread accesses an entire cache line at every offset in the randomly generated sequence. If the access pattern is RR, every thread only accumulates values in an 8-byte local variable while reading the cache line. If the access pattern is RW, every thread reads and writes the entire cache line in 8-byte units.
The performance cost is calculated by dividing the execution time of the microbenchmark with the number of cache lines that were accessed.
|A||Access pattern, one of SR, RR, SW, RW.|
|Performance cost for access pattern A|
|Number of operations of access pattern A|
|Cache line size|
|Cardinality of relation|
|Size of each tuple in relation|
|Hash table on|
|Number of hash buckets in|
|Hash bucket size in|
|Tuples per bucket (ie. hash table load factor)|
|Size of metadata per hash bucket|
|Query subtree at depth|
|Intermediate output of (cf. Figure 3)|
3.2 Modeling individual operators
In this section we analyze the memory access cost of individual operations. The notation is summarized in Table 2.
All threads read data sequentially from memory during the scan. Scanning entails no random reads or memory writes. For a relation , the number of SR memory operations is determined by the size of the input relation and cache line size. Therefore:
Hash join build phase
During the hash join build phase every thread concurrently reads tuples from the build relation, hashes the tuple on the join key and inserts it into a shared hash table. Hashing the join key only involves computation, thus there will be no memory accesses. As a good hash function is designed to assign different keys into different hash buckets, the hash buckets will be accessed in random order. Once the appropriate hash bucket has been identified, the thread needs to latch the bucket before writing into it to prevent insertion races with other threads. The latch and other metadata information are stored in a bucket header structure at the beginning of the bucket and have size . Acquiring the latch will result in a local modification to the cache line. In the absence of any latch contention, releasing the latch will modify the same cache line again. Since the latch has likely already been brought into the cache after the latch acquire operation, the latch release operation will hit the same cache line and will not trigger additional memory accesses. Therefore one RW memory accesses will occur per tuple in the build relation :
Writing each tuple in the hash bucket will require additional writes. The number of memory writes depends on how many cache lines overlap with the modified memory region and the write pattern. Let us consider the insertion of tuples from relation (denoted by ) into the hash bucket that consists of the cache lines that is shown in Figure 2. When the first tuple is inserted it fits entirely into , causing one memory write. When is inserted, it spans both the and the cache lines and requires two memory writes. Similarly, both and trigger two memory writes each because they span cache lines, but inserting only requires one memory write as it fits completely within the cache line.
We can derive a closed form solution for the memory writes that are triggered by inserting tuples of width into cache lines of size by calculating the boundaries of the cache lines and the tuples, which are shown as vertical dashed lines in Figure 2. We apply the inclusion/exclusion principle and first add the tuple boundaries () and cache boundaries (). We will then subtract the boundaries that are both tuple and cache line boundaries (), such as the boundary between and in Figure 2. The tuples have boundaries and the cache lines have boundaries. The common boundaries can be found in the locations that are both a multiple of and a multiple of . If is the least common multiple of and , these locations are precisely at , , . Thus, the number of common boundaries is . We conclude that the number of memory accesses to insert tuples of size into one hash bucket will be , which is:
If the hash table on relation has hash buckets and each bucket is sized to fit tuples, the total number of SW memory accesses is:
Hash join probe phase
After the build phase completes, each thread will read tuples from the probe relation , hashes each tuple on the join key and compares the join key of the tuple from with the join keys of all the tuples in the corresponding hash bucket. No memory access is involved when evaluating the hash function. The join key will then need to be compared with every key in the hash bucket. (If the hash bucket is empty, the hash bucket metadata will still need to be retrieved to discover this.) As the bucket is determined by the hash of the join key of the input tuple, the first access to the hash bucket is RR for every tuple in the probing relation :
All tuples in the hash bucket will be retrieved from memory for the join key comparison using the SR access pattern. The number of sequential reads is determined by the number of additional cache lines the bucket occupies. Each bucket in the hash table will contain bytes of data, but the first bytes have already been accounted for in the RR access pattern. Assuming that each hash bucket fits tuples, let be the number of SR memory accesses per probe:
The output of the join will be written to an output buffer of each thread so as to be used by the next operator. Since the queue buffer is reused between operators, it can be sized to fit in the cache and not generate any memory access when populating the output buffer in a well-tuned system. Our model of the probe phase of the hash join therefore includes no SW or RW operations:
3.3 Modeling multiple joins in a query tree
The number of memory accesses for the subtree rooted at depth and position (see the bushy tree in Figure 3) is obtained by adding the memory accesses of the operator at depth and position with the memory accesses of the left and right subtrees for each access pattern . If denotes the intermediate result from the operator at depth and position , the number of memory accesses with pattern A for the entire query is , where:
Equation 12 does not account for the cost of materializing the output . For intermediate results, we have experimentally found that this is not a significant cost if the output buffer has been sized appropriately Boncz et al.  — the buffer that stores the materialized output batch for the next operator stays cached and does not trigger memory accesses. (Note, however, that the cost of processing a larger intermediate result is captured in the cardinality and width of when accounting for the memory accesses of subsequent operations.) We validate this modeling choice in Section 4.2.2. The final join output is also materialized incrementally if it is consumed by an aggregation or a top- operation. (This pattern, for instance, occurs in every query in the TPC-H decision support benchmark.) If the entire query output is to be materialized, the model can be trivially extended with additional SW accesses to reflect the materialization cost. This cost would be identical for all query plans.
3.4 Insight on join evaluation orders
This model can offer valuable insights into the memory I/O requirements of different query plans. We illustrate this by modeling the common case of a linear primary key–foreign key join between relations. Let that the multi-join operation be , where , for every , The join sequence for a left-deep evaluation strategy is:
While the right-deep evaluation strategy is:
Let us consider the common case of a join that produces as many tuples as the probe side, as is commonly the case for primary key–foreign key joins. Closed formulas for the memory access cost of the right-deep query tree that is shown in Figure 3 can be obtained by setting , as follows:
The cost for a left-deep tree , with as shown in Figure 3, is:
Insight 1: The left-deep () and right-deep () evaluation strategy perform the same number and type of memory writes. and are identical for the two query trees, because the cardinality of the -th intermediate output is for the left-deep strategy , and for the right-deep strategy .
Insight 2: The left-deep () evaluation strategy performs fewer RR memory accesses than the right-deep () strategy. The RR accesses for the left-deep strategy are , while the RR accesses are for the right-deep strategy. is identical in both strategies if , namely if the tuples are thinner than the last-level cache line. This is commonly the case due to projection push down or columnar storage.
3.5 Possible extensions to the model
The proposed model accounts for wide tuples but assumes that the tuple width is fixed per input relation. This may not be accurate if some attributes represent variable length fields such as VARCHARs, BLOBs or nested structures like JSON objects. The model could crudely be applied by using the average tuple size, but accurate results would require a complete histogram of the attribute size per join key. A research challenge is to devise techniques to collect such metadata information efficiently.
Another promising direction is to extend the model for distributed in-memory joins. We foresee two challenges in generalizing our model to distributed in-memory hash joins: modeling data placement and locality and modeling the cost of remote data transfers. Our model currently does not consider data placement. It seems unlikely that a model that does not account for locality can remain accurate when some accesses become remote and thus an order of magnitude more expensive than what is currently modeled. Regarding modeling the cost of remote data transfers, Barthels et al. Barthels et al.  have proposed a performance model to estimate the cost of transferring data using RDMA primitives for join processing.
Hash tables are widely used for storing data for in-memory caching or in-memory transaction processing. Modeling the cost of each access is a first step towards understanding the performance characteristics of complex operations (such as transactions) that consist of a series of reads and writes on a hash table. We speculate that the main limitation of our model when applied to ad-hoc operations is to account for the effect of concurrent writes and reads. A promising research direction is to construct contention-aware performance models for in-memory data processing.
|Cost per access pattern|
|Vendor, CPU or instance type|
|AMD, 2Opteron 6172||1.00||6.44||1.88||8.42|
|Amazon EC2, c4.4xlarge||1.00||6.81||5.21||13.86|
|Predicted memory I/O||Observed memory I/O||Response time slowdown|
|Load factor||RW||SW||Total writes||SR||Total reads||Writes||Reads||Pred.||Observ.||Error|
|Predicted memory I/O||Observed I/O||Response time slowdown|
4 Experimental evaluation
This section describes the experimental evaluation and validation of our model. Sections 4.2.1 and 4.2.2 focus on a single join and evaluate the accuracy of the model in predicting the memory I/O activity. We validate that I/O activity is linearly correlated with query response time, and we find that the impact of incrementally materializing intermediate results to the next pipeline stage is negligible. Section 4.2.3 evaluates how parallel subtree evaluation affects performance, and validates that sequential subtree evaluation results in similar query response times to the fastest parallel evaluation strategy but with less memory pressure.
We then turn our attention to multi-join queries, and we exhaustively compare all possible multi-join query plans for a join with four input relations. Section 4.3.1 discusses how our simple memory I/O model compares with a linear disk-based I/O model, such as the Haas et al. model Haas et al. , and whether parameter tuning of disk-based models is sufficient to predict the response time of queries on memory-resident data. Section 4.3.2 highlights how our model adapts to different hardware and can accurately predict response time “drifts” of particular query plans as the memory hierarchy evolves. The remainder of the section evaluates the sensitivity of our model to changes in the database size (Section 4.3.3), join skew (Section 4.3.4), input cardinality ratio (Section 4.3.5) and join selectivity (Section 4.3.6). Finally Section 4.3.7 evaluates the predictive power of our model in forecasting the cost of deeper multi-join pipelines.
We have extended Pythia Pythia , a prototype open-source in-memory query engine to support multi-way joins and complex query pipelines. We started with the optimized non-partitioned hash join implementation of Balkesen et al. Balkesen et al. [2013b] to create a hash join operator that can be placed in complex query pipelines using a parallel, vectorized, pull-based execution model Boncz et al. ; Graefe . Building on prior work Chen et al. , we prefetch hash buckets before they are accessed by “peeking ahead” within the batch of input tuples. We have built a custom memory allocator to use huge pages for memory requests larger than 1 GB. By tightly controlling memory allocation we can enforce NUMA placement, support pre-allocation during query planning time, and precisely monitor the memory consumption of a query during processing.
4.1 Hardware setup and methodology
We use three systems for our experimental evaluation. The first system (which we will refer to as “Intel”) is a server with two NUMA nodes and 256 GB of DDR3 memory, with two Intel Xeon E5-2695v2 12-core processors. Each core in an E5-2695v2 processor shares the 30 MB L3 cache. We have enabled hyper-threading, so the operating system can simultaneously execute 48 threads. The second system (which we will refer to as “AMD”) is a server with four NUMA nodes and 32 GB of memory, with two AMD Opteron 6172 12-core processors (in total, 24 concurrent threads). Each core in an Opteron 6172 processor shares the 12 MB L3 cache.
In a cloud environment, the precise hardware specifications may not be known before the VM is instantiated. An advantage of the proposed cache-oblivious model is its adaptability to hardware with unknown specifications. The third system (which we refer to as “EC2”) is an Amazon EC2 instance of type c4.4xlarge. The instance has 30 GB of memory and 16 vCPUs. To control for cyclical variations in performance, we bid for a single spot EC2 instance around 10am every morning (US Eastern time) for 7 consecutive days. The observed day-to-day variation in performance is less than 2% so we only report averages over all seven days for all EC2 experiments.
The measured performance cost for each access pattern A among SR, RR, SW and RW for the three systems is shown in Table 3. (Please refer to Section 3.1 for details on the bootstrapping process.) We use the built-in “perf” tool of the Linux kernel to tap into hardware counters of performance events related to memory accesses. To minimize reporting overheads from “perf” we only inspect these counters after the completion of the initialization, the build and the probe phases (that is, three times per join operation). Every experiment is repeated at least ten times, and we report the average. We assume that a memory manager preallocates memory when the DBMS starts, and queries can quickly reuse pre-allocated memory. Thus, memory allocation time is not included in the reported query response time.
4.2 Validating modeling assumptions
This section validates key modeling assumptions using the Intel system that is described in Section 4.1. We first dissect a single hash join to evaluate how accurately we model memory I/O traffic and whether memory traffic is a good predictor of the join execution time. We then turn our attention to how parallel evaluation of distinct build subtrees of a query plan affects performance.
4.2.1 Hash join build phase
The first experiment evaluates the accuracy of the model in capturing the memory I/O activity and predicting the completion time of the hash join build phase. We create one relation with two attributes. The first attribute is an 8-byte integer which ranges from 1 to the cardinality of relation , and the second attribute is a random 8-byte integer. Narrow tuples are commonly encountered in column-stores and have been extensively used for experimental evaluation in prior work Balkesen et al. [2013b]. The input relation has been randomly permuted so that the keys are in random order, and is striped among both NUMA nodes of our system. For this experiment we fix the number of hash buckets to 512 million and use 16 bytes per bucket as the bucket header ; the first cache line can therefore hold 3 tuples.
The experimental results and the model predictions for building a hash table are shown in Table 4. We vary the cardinality of the build relation from 512 million to 4 billion tuples. When the build relation size varies from to , all tuples will be in the same cache line with bucket header, and . When the build relation size reaches or exceeds , tuples will be inserted in the next available cache line and will cause SW traffic. When comparing the model prediction with the observed I/O activity, we notice that the read and the write prediction is very accurate and commonly deviates less than 1% from the observed memory traffic. When comparing the model prediction with the experimentally observed execution time, we observe that the memory I/O activity is an accurate predictor of the execution time of the build phase, as it commonly deviates less than 2% from the observed time.
4.2.2 Hash join probe phase
We now evaluate the accuracy of our model in capturing the hash join probe phase. We use the same build relation as in Section 4.2.1 and fix the cardinality of to 512 million tuples (). As shown in Table 5, the cardinality of the probe relation varies from to , and the probability that an tuple finds a matching tuple in the hash table varies from 25% to 100%. We observe that the model’s memory activity prediction is accurate and within 3% of the observed memory read traffic. Memory I/O activity is again linearly correlated with query response time. In fact, the model’s prediction slightly overpredicts the query response time. Finally, the cardinality of the join output does not noticeably affect the memory I/O activity and the response time, because the join output is materialized incrementally in the same output buffer for pipelined operations. This validates our design choice to not explicitly account for the output materialization cost of intermediate results.
4.2.3 Parallel vs. sequential build subtree evaluation
Schneider and DeWitt Schneider and DeWitt  argued that one aspect of superiority of right deep trees over left deep trees is their potential for exploiting parallelism in their independent build subtrees. In this section, we study the performance of utilizing this inter-subtree parallelism for memory-resident datasets. We create three relations that contain 1 billion tuples each, and evaluate the query plan shown in Figure 4(a). Every probe tuple matches one build tuple in the and joins. We execute the query plan both sequentially and in parallel. When we execute the query sequentially we use all available threads to build first, and then move on to build after completing the build of . When we execute the query in parallel, the threads are divided into two groups: threads build a hash table on while the other concurrently build a hash table on . All threads participate in the probe phase for both evaluation strategies.
The response time of the two evaluation strategies is shown in Figure 4(b) on the vertical axis, as the number of threads assigned to changes on the horizontal axis. Because the two relations have equal size, the optimal allocation is which divides the threads into two equally-sized groups. Performance will degrade if the optimal thread assignment is not predicted correctly by the query optimizer when processing more complex query subtrees. However, because the communication costs of a main-memory environment are negligible compared to shared-nothing architectures, the performance of building the hash tables on and sequentially is equal to the performance of parallel evaluation with the best thread allocation.
An advantage of sequential evaluation is the memory consumption of the query. When building sequentially, 64GB of memory is allocated in the beginning, which corresponds to the memory requirement for building . The memory consumption further increases by 64GB (the amount of memory needed for building ) later in the query, and remains constant. When building in parallel, 128GB of memory is needed upfront to start the query, if both and are to be built concurrently. Although the performance and the peak memory consumption is the same, the sequential evaluation strategy imposes less pressure to the memory manager and the DBMS because it gradually reaches its peak memory allocation. In light of these findings, we process independent build subtrees sequentially in the experiments that follow.
4.3 Evaluation with multi-join query plans
In order to exhaustively evaluate our model’s prediction for multi-join query plans, we generate a synthetic database with four relations , , and . All relations contain two long integer attributes a and b, and the tuple size is 16 bytes. The attribute a ranges from 1 to the cardinality of the relation and the values are randomly distributed. We evaluate the following SQL query:
SELECT SUM(.a + .b)
FROM , , ,
WHERE .b = .a, .b = .a, .b = .a
This synthetic database with 4 relations allows us to explore the five query plan shapes which are shown in Figure 5, namely the left-deep (L), left-bushy (LB), bushy (B), right-bushy (RB), and right-deep (R) tree. We use “TXXXX” to refer to a query plan, where “T” is the query type, followed by a sequence of numbers denoting the input relations when reading from left to right. By focusing on a database with 4 relations, we can systematically explore the entire query plan space, while keeping the number of query plan candidates within a reasonable limit for presentation purposes. (We relax this constraint in Section 4.3.7 where we evaluate the model with query plans that involve more than 3 joins.)
4.3.1 Comparison with a popular disk-based model
Do we need a new cost model for memory I/O, or is adjusting the weights of existing linear disk-based models sufficient? We answer this question by comparing the accuracy of our model with the PostgreSQL 9.3 disk I/O model which mimics the Haas et al. Haas et al.  model:
The number of I/O operations and for a given query plan are predicted by the query optimizer and is a function of the cardinalities of the join inputs and the join output. The cost weights and are user-adjustable parameters.
We exhaustively explore all viable multi-join query plans with 4 relations for the query that is shown in Section 4.3. We set the relation cardinality of , , , to 2 billion, 512 million, 128 million and 32 million tuples respectively. The join ratio is 1:4, that is for every value of , there are 4 tuples with matching values. We force PostgreSQL to use a specific join order and explicitly set the cardinality estimates to the actual join cardinality instead of relying on the prediction by the query optimizer. We obtain by setting to 1 and to 0, and we report the total cost for the query plan, as shown by PostgreSQL’s EXPLAIN command. (We do likewise to find .) We finally perform linear regression to find the optimal non-negative costs to minimize the error between the cost prediction and the observed execution time.
Figure 6(a) shows the prediction of the PostgreSQL disk I/O model on the horizontal axis (after parameter fitting using linear regression) and the observed response time on the Intel system on the vertical axis. Even with optimal cost weights, the predictions of the PostgreSQL disk I/O model are clustered in five points (shown as vertical bands) on Figure 6(a). PostgreSQL gives the same cost prediction for plans with very different execution times: it predicts that the best two plans (“L3210” and “L2310”) will have the same response time as the “R0132” and “R0123” plans which are in reality twice as expensive. Making matters worse, “R3210” is the optimal right-deep query plan but is predicted to be twice as expensive as the “R0123” query plan.
In comparison, Figure 6(b) shows the prediction from our model on the Intel system, which successfully predicts the cheapest plans “L3210” and “L2310”. In addition, all observed response times lie within a narrow band of their prediction. A disk I/O model that only considers the size of the data accessed and whether this access is sequential or random cannot account for the access patterns that arise during an in-memory hash join.
4.3.2 Model adaptability to different hardware
In this section, we test the model’s accuracy on the different systems that were described in Section 4.1. Because of limited memory size, we set the cardinality of , , , to be 256 million, 64 million, 16 million, and 4 million tuples respectively. The join ratio is set to be 1:4 as in Section 4.3.1, and the query is the 4-relation join described in Section 4.3. The predictions are more “noisy” due to caching effects that arise because of the smaller database size — for instance, can be cached in its entirety in all systems. (We explore the model sensitivity to the database size in Section 4.3.3.)
Figure 6(c) compares the model’s cost prediction with the observed query response time on the AMD system. Our model remains accurate as only a few of the 40 query plans fall outside the band. The proposed model also adapts to the hardware architecture of the underlying platform. Observe the “L2130” and “B3210” query plans on the Intel system at Figure 6(b). Both plans have been accurately predicted to have comparable performance. Yet for the AMD system at Figure 6(c), the model accurately predicts that the “B3210” query plan is more expensive than the “L2130” plan. This difference can be attributed to the proportion of the RR activity of the two plans, which is for the “B3210” plan but only for the “L2130” plan. As the weight changes from 3.79 on the Intel system to 6.44 on the AMD system (cf. Table 3), our model captures this performance difference and adjusts the cost predictions for all plans accordingly.
We also test our model on the Amazon EC2 instance using the same dataset as for the AMD system and show the results in Figure 6(d). The EC2 results are similar to the results from the Intel system, except for all the plans with prefixes “RB0” and “R0” that construct a hash table on . Our model predicts that these plans are much faster than their actual response time. A closer look at the performance counters reveals that the discrepancy is due to the cost to translate virtual to physical memory addresses when accessing this large hash table. The Intel system was configured with 1GB huge pages that Pythia can readily use, while the EC2 instance had no huge page support. Modeling the hierarchical nature of the page table could improve the accuracy of the model when huge pages are not enabled or not supported.
We now adopt more concise metrics to quantify model accuracy. Prior work Gu et al. ; Wu et al.  has used correlation metrics to measure the accuracy of the model prediction. The Pearson correlation coefficient is used to measure the linear correlation between two variables (namely, the prediction and the actual query response time). A deficiency of the Pearson coefficient is that it can assign low coefficient scores to models that correctly predict the relative ordering of different query plans, but the correlation with the observed response time is non-linear. The Spearman correlation coefficient accommodates non-linear models by measuring the linear correlation between the ranks of different query plans. For the remainder of the paper we will use both the Pearson () and Spearman () coefficients as metrics of model accuracy.
4.3.3 Model sensitivity to the database size
The proposed model assumes that caching affects all query plans equally. In this section we validate this design assumption by showing the accuracy of the model as a growing fraction of the database fits in the cache (that is, the database shrinks in size). We use the multi-join query in Section 4.3 on the Intel system, and fix the join ratio to be 1:4. Figure 7(a) plots the Pearson and Spearman correlation coefficients as ranges from 2 billion tuples to as little as 8 million tuples. The data points for 2 billion tuples reflect the coefficients for Figure 6(b). The dip for 1 billion tuples is caused by three outliers, namely the “LB2103”, “L1203” and “L2103” plans, whose response time is in the slowest quartile (25%) among all query plans. These very expensive query plans would realistically be never considered as viable alternatives by the query optimizer. The model remains very accurate with a Spearman coefficient of at least 0.95, until the database size becomes less than 1 GB (that is, when has fewer than 32 million tuples). When is 8 million tuples, , , and fit entirely in cache. Even then, both the Pearson and Spearman correlation coefficient for our model remain above 0.8 and 26 out of the 40 query plans have response times that are within of the model prediction.
4.3.4 Model sensitivity to data skew
Data skew has been shown to have a profound effect on performance even for a single join Balkesen et al. [2013b]. We now evaluate the effect of data skew on our model’s prediction. We use the multi-join query discussed in Section 4.3 and we fix the cardinality of , , and to be 2 billion, 512 million, 128 million and 32 million tuples, respectively. Attribute ranges from 1 to , and the probability for to reference individual keys in follows the Zipf distribution. We vary the Zipf factor from 0 (no skew) to 1.5.
Figure 7(b) plots the normalized query response time of query plans that exhibit probe-side data skew. Since our model doesn’t account for data skew, it produces the same prediction for all Zipf factors. The query plan response time remains stable when the Zipf factor is smaller than 0.5. When Zipf factor is 1, the most frequent value for occurs more than 100 million times but the drop in query response time is less than . More skew affects all query plans almost proportionally for Zipf factors as high as 1.5. Given that different query plans have up to different response times, the relative order between the query plans does not change: our model perfectly ranks all the queries that are shown in Figure 7(b) (that is, ).
4.3.5 Model sensitivity to input cardinality ratio
We now evaluate the sensitivity of the model as the ratio of varies from 1 to . When the ratio is 1:1, and and have a 1-to-1 match. When the ratio is 1:8, and and have a 1-to-8 match. The correlation coefficients for different ratios are shown in Table 6. The coefficient for 1:1 is undefined because our model gives the same prediction to all 40 query plans and results in a variance of zero. However, the model prediction for the 1:1 ratio is very accurate, as the observed response time for all 40 query plans varies less than —well within the margin of statistical error. As the ratio changes, the Pearson coefficient stays above 0.88 and the Spearman coefficient stays above 0.95. The drop for the 1:8 ratio is caused by three outliers (the “LB2103”, “L1203” and “L2103” plans) which are among the most expensive plans for evaluating this query and thus are not competitive evaluation strategies.
4.3.6 Model sensitivity to join selectivity
In this section we study the accuracy of the model when changing the selectivity of the join. We use the join query in Section 4.3. The cardinalities of , , and are 2 billion, 512 million, 128 million and 32 million respectively. The results are shown in Figure 7(c). In the 1:8 dataset, the attribute ranges from 1 to and every value occurs 8 times, i.e. half of the tuples in will have matching tuples in and each tuple will match 8 tuples in . The other datasets are obtained likewise: for instance, in the 1:1 dataset only of the tuples in will match in , and each will match exactly once. As Figure 7(c) shows, the model remains accurate as the join selectivity changes and the Spearman coefficient stays above 0.9.
4.3.7 Modeling longer join pipelines
After focusing on the exhaustive exploration of the query plan space for a query with three joins, we now will explore how the performance of the best right-deep tree (“R3210”) and the best left-deep tree (“L3210”) changes as the number of joins increases, and whether our model can predict this accurately. We generate more relations with a join ratio of 1:4 as in Section 4.3.1, and we grow each query tree accordingly. We plot the query response time when the number of joins increases for both the left-deep tree and the right-deep tree in Figure 8(a), and contrast this with the result from our prediction in Figure 8(b). The left-deep tree and the right-deep tree have the same performance when the number of joins is 1, as the trees are identical. As the number of joins increases, the performance of right-deep trees linearly worsens over the performance of the left-deep tree. The key drawback of the right-deep tree is that by using the largest relation as the probing relation the data of the largest relation “flows” through all pipeline stages and results in additional RR memory accesses in every stage. Our model accurately forecasts this performance trend for left-deep trees and right-deep trees as the number of joins increases.
5 Concluding remarks
A significant fraction of a database may fit entirely in main memory and can be analyzed in parallel using multiple CPU cores to keep query response times short. Accurately forecasting the response time of different in-memory query plans is becoming important for query optimization in this environment. Towards this goal, we contribute a cost model that can accurately predict the query response time of ad-hoc query plans with multiple hash-based joins.
A surprising insight from our model is that some left-deep query trees can be more efficient than their bushy and right-deep tree counterparts because they result in less memory I/O during execution. Prior work in parallel hash-based multi-join query evaluation has advocated right-deep query trees because all build subtrees can be processed in parallel and then probed in a single pipeline Schneider and DeWitt . Our experimental evaluation corroborates that in a main-memory setting evaluating query subtrees sequentially using all threads is as fast as evaluating separate query subtrees concurrently. This finding suggests that evaluating one join at a time and storing the intermediate result in a hash table may be a viable query execution strategy over a memory-resident dataset as it can ameliorate the cascading effect of errors in join cardinality estimation. Query processing techniques that are adaptive to cardinality estimation errors are a promising research area for future work.
We would like to acknowledge Tasos Sidiropoulos, Yang Wang, the anonymous reviewers and our shepherd, Jennie Duggan, for their actionable and insightful comments that improved this paper. This research was partially supported by the National Science Foundation under grant III-1422977 and by a Google Research Faculty Award. The evaluation was conducted in part at the National Energy Research Scientific Computing Center, a DOE Office of Science User Facility supported by the Office of Science of the U.S. Department of Energy under Contract No. DE-AC02-05CH11231.
- Ahmed et al.  R. Ahmed, R. Sen, M. Poess, and S. Chakkappen. Of snowstorms and bushy trees. PVLDB, 7(13):1452–1461, 2014.
- Ailamaki et al.  A. Ailamaki, D. J. DeWitt, M. D. Hill, and D. A. Wood. DBMSs on a modern processor: Where does time go? In VLDB, pages 266–277, 1999.
- Akdere et al.  M. Akdere, U. Çetintemel, M. Riondato, E. Upfal, and S. B. Zdonik. Learning-based query performance modeling and prediction. In ICDE, pages 390–401, 2012.
- Arumugam et al.  S. Arumugam, A. Dobra, C. M. Jermaine, N. Pansare, and L. Perez. The datapath system: A data-centric analytic processing engine for large data warehouses. In SIGMOD, pages 519–530, 2010.
- Balkesen et al. [2013a] C. Balkesen, G. Alonso, J. Teubner, and M. T. Özsu. Multi-core, main-memory joins: Sort vs. hash revisited. PVLDB, 7(1):85–96, 2013a.
- Balkesen et al. [2013b] C. Balkesen, J. Teubner, G. Alonso, and M. T. Özsu. Main-memory hash joins on multi-core cpus: Tuning to the underlying hardware. In ICDE, pages 362–373, 2013b.
- Barber et al.  R. Barber, G. Lohman, I. Pandis, V. Raman, R. Sidle, G. Attaluri, N. Chainani, S. Lightstone, and D. Sharpe. Memory-efficient hash joins. Proc. VLDB Endow., 8(4):353–364, Dec. 2014.
- Barthels et al.  C. Barthels, S. Loesing, G. Alonso, and D. Kossmann. Rack-scale in-memory join processing using RDMA. In SIGMOD, pages 1463–1475, 2015.
- Blanas and Patel  S. Blanas and J. M. Patel. Memory footprint matters: efficient equi-join algorithms for main memory data processing. In SOCC, pages 19:1–19:16, 2013.
- Boncz et al.  P. A. Boncz, S. Manegold, and M. L. Kersten. Database architecture optimized for the new bottleneck: Memory access. In VLDB, pages 54–65, 1999.
- Boncz et al.  P. A. Boncz, M. Zukowski, and N. Nes. MonetDB/X100: Hyper-pipelining query execution. In CIDR, pages 225–237, 2005.
- Candea et al.  G. Candea, N. Polyzotis, and R. Vingralek. A scalable, predictable join operator for highly concurrent data warehouses. PVLDB, 2(1):277–288, 2009.
- Chaudhuri  S. Chaudhuri. An overview of query optimization in relational systems. In PODS, pages 34–43, 1998.
- Chen et al. [1992a] M.-S. Chen, M.-L. Lo, P. S. Yu, and H. C. Young. Using segmented right-deep trees for the execution of pipelined hash joins. In VLDB, pages 15–26, 1992a.
- Chen et al. [1992b] M.-S. Chen, P. S. Yu, and K.-L. Wu. Scheduling and processor allocation for parallel execution of multi-join queries. In ICDE, pages 58–67, 1992b.
- Chen et al.  S. Chen, A. Ailamaki, P. B. Gibbons, and T. C. Mowry. Improving hash join performance through prefetching. In ICDE, pages 116–127, 2004.
- Chu et al.  S. Chu, M. Balazinska, and D. Suciu. From theory to practice: Efficient join query evaluation in a parallel database system. In SIGMOD, pages 63–78, 2015.
- Deshpande and Hellerstein  A. Deshpande and L. Hellerstein. Flow algorithms for parallel query optimization. In ICDE, pages 754–763, 2008.
- DeWitt and Gerber  D. J. DeWitt and R. H. Gerber. Multiprocessor hash-based join algorithms. In VLDB, pages 151–164, 1985.
- DeWitt et al.  D. J. DeWitt, R. H. Katz, F. Olken, L. D. Shapiro, M. Stonebraker, and D. A. Wood. Implementation techniques for main memory database systems. In SIGMOD, pages 1–8, 1984.
- Duggan et al.  J. Duggan, U. Çetintemel, O. Papaemmanouil, and E. Upfal. Performance prediction for concurrent database workloads. In SIGMOD, pages 337–348, 2011.
- Giannikis et al.  G. Giannikis, G. Alonso, and D. Kossmann. SharedDB: Killing one thousand queries with one stone. PVLDB, pages 526–537, 2012.
- Giceva et al.  J. Giceva, G. Alonso, T. Roscoe, and T. Harris. Deployment of query plans on multicores. PVLDB, pages 233–244, 2014.
- Graefe  G. Graefe. Encapsulation of parallelism in the Volcano query processing system. In SIGMOD, pages 102–111, 1990.
- Gu et al.  Z. Gu, M. A. Soliman, and F. M. Waas. Testing the accuracy of query optimizers. In DBTest, pages 11:1–11:6, 2012.
- Haas et al.  L. M. Haas, M. J. Carey, M. Livny, and A. Shukla. Seeking the truth about ad hoc join costs. VLDB J., 6(3):241–256, 1997.
- Harizopoulos et al.  S. Harizopoulos, V. Shkapenyuk, and A. Ailamaki. QPipe: A simultaneously pipelined relational query engine. In SIGMOD, pages 383–394, 2005.
- Hong and Stonebraker  W. Hong and M. Stonebraker. Optimization of parallel query execution plans in XPRS. Distributed and Parallel Databases, 1(1):9–32, 1993.
- Ioannidis and Kang  Y. E. Ioannidis and Y. C. Kang. Left-deep vs. bushy trees: An analysis of strategy spaces and its implications for query optimization. In SIGMOD, pages 168–177, 1991.
- Krikellas et al.  K. Krikellas, S. Viglas, and M. Cintra. Generating code for holistic query evaluation. In ICDE, pages 613–624, 2010.
- Lang et al.  H. Lang, V. Leis, M. Albutiu, T. Neumann, and A. Kemper. Massively parallel numa-aware hash joins. In IMDM, pages 1–12, 2013.
- Lehman and Carey  T. J. Lehman and M. J. Carey. Query processing in main memory database management systems. In SIGMOD, pages 239–250, 1986.
- Leis et al.  V. Leis, P. Boncz, A. Kemper, and T. Neumann. Morsel-driven parallelism: A numa-aware query evaluation framework for the many-core age. In SIGMOD, pages 743–754, 2014.
- Li et al.  J. Li, A. C. König, V. R. Narasayya, and S. Chaudhuri. Robust estimation of resource consumption for SQL queries using statistical techniques. PVLDB, 5(11):1555–1566, 2012.
- Li et al.  Y. Li, I. Pandis, R. Müller, V. Raman, and G. M. Lohman. NUMA-aware algorithms: the case of data shuffling. In CIDR, 2013.
- Liu and Rundensteiner  B. Liu and E. A. Rundensteiner. Revisiting pipelined parallelism in multi-join query processing. In VLDB, pages 829–840, 2005.
- Lohman  G. M. Lohman. Is query optimization a “solved” problem? The ACM SIGMOD Blog, Apr. 2014.
- Lohman et al.  G. M. Lohman, C. Mohan, L. M. Haas, D. Daniels, B. G. Lindsay, P. G. Selinger, and P. F. Wilms. Query processing in R*. In Query Processing in Database Systems, pages 31–47. Springer, 1985.
- Lu et al.  H. Lu, M.-C. Shan, and K.-L. Tan. Optimization of multi-way join queries for parallel execution. In VLDB, pages 549–560, 1991.
- Manegold et al.  S. Manegold, P. A. Boncz, and M. L. Kersten. What happens during a join? Dissecting CPU and memory optimization effects. In VLDB, pages 339–350, 2000.
- Manegold et al.  S. Manegold, P. Boncz, and M. L. Kersten. Generic database cost models for hierarchical memory systems. In VLDB, pages 191–202, 2002.
- Markl and Lohman  V. Markl and G. M. Lohman. Learning table access cardinalities with LEO. In SIGMOD, page 613, 2002.
- Neumann  T. Neumann. Efficiently compiling efficient query plans for modern hardware. PVLDB, pages 539–550, 2011.
- Ono and Lohman  K. Ono and G. M. Lohman. Measuring the complexity of join enumeration in query optimization. In VLDB, pages 314–325, 1990.
- Polychroniou and Ross  O. Polychroniou and K. A. Ross. A comprehensive study of main-memory partitioning and its application to large-scale comparison- and radix-sort. In SIGMOD, pages 755–766, 2014.
- Polychroniou et al.  O. Polychroniou, R. Sen, and K. A. Ross. Track join: Distributed joins with minimal network traffic. In SIGMOD, SIGMOD ’14, pages 1483–1494, 2014.
-  Pythia. http://github.org/sblanas/pythia.
- Schneider and DeWitt  D. A. Schneider and D. J. DeWitt. Tradeoffs in processing complex join queries via hashing in multiprocessor database machines. In VLDB, pages 469–480, 1990.
- Shatdal et al.  A. Shatdal, C. Kant, and J. F. Naughton. Cache conscious algorithms for relational query processing. In VLDB, pages 510–521, 1994.
- Stillger et al.  M. Stillger, G. M. Lohman, V. Markl, and M. Kandil. LEO – DB2’s LEarning Optimizer. In VLDB, pages 19–28, 2001.
- Wilschut and Apers  A. N. Wilschut and P. M. G. Apers. Dataflow query execution in a parallel main-memory environment. In PDIS, pages 68–77, 1991.
- Wilschut et al.  A. N. Wilschut, J. Flokstra, and P. M. Apers. Parallel evaluation of multi-join queries. In ACM SIGMOD Record, volume 24, pages 115–126. ACM, 1995.
- Wu et al.  W. Wu, X. Wu, H. Hacigümüs, and J. F. Naughton. Uncertainty aware query execution time prediction. PVLDB, 7(14):1857–1868, 2014.
- Zhang et al.  N. Zhang, P. J. Haas, V. Josifovski, G. M. Lohman, and C. Zhang. Statistical learning techniques for costing XML queries. In VLDB, pages 289–300, 2005.