2012
DOI: 10.1007/978-3-642-33074-2_16
|View full text |Cite
|
Sign up to set email alerts
|

Just-In-Time Data Distribution for Analytical Query Processing

Abstract: Abstract. Distributed processing commonly requires data spread across machines using a priori static or hash-based data allocation. In this paper, we explore an alternative approach that starts from a master node in control of the complete database, and a variable number of worker nodes for delegated query processing. Data is shipped just-in-time to the worker nodes using a need to know policy, and is being reused, if possible, in subsequent queries. A bidding mechanism among the workers yields a scheduling wi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2013
2013
2019
2019

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(4 citation statements)
references
References 16 publications
0
4
0
Order By: Relevance
“…In this configuration, we use the Mitosis and Dataflow optimizers of MonetDB to achieve efficient intraoperator parallelism [25]. This confiugration demonstrates the performance that is achievable by hand-tuning operators for a multi-core CPU.…”
Section: Parallel Monetdbmentioning
confidence: 93%
“…In this configuration, we use the Mitosis and Dataflow optimizers of MonetDB to achieve efficient intraoperator parallelism [25]. This confiugration demonstrates the performance that is achievable by hand-tuning operators for a multi-core CPU.…”
Section: Parallel Monetdbmentioning
confidence: 93%
“…Note that there is no guarantee that intermediate objects may actually fit within the amount of DRAM available. However, the sizes of intermediate data sets can be controlled by fragmenting the query execution plan [23]. We will demonstrate that this allows us to make excellent use of available DRAM.…”
Section: Frequently Accessed Objectsmentioning
confidence: 99%
“…Figure 3 also shows the impact of query plan fragmentation. Query plan fragmentation is a technique to enlarge the degree of parallelism within the query plan [23]. It breaks down the columns in smaller fragments, resulting in more operations in the query plan that are independent of one another.…”
Section: Operators Causing Main Memory Accessesmentioning
confidence: 99%
“…In addition to common strategic optimizations, MonetDB has a set of optimizers for parallel query plan generation [37]. The mitosis optimizer partitions the largest input columns into several separate columns based on size estimation heuristics and the available amount of CPU cores and main memory.…”
Section: Parallel Query Plansmentioning
confidence: 99%