Encapsulation of parallelism in the Volcano query processing system

Graefe, Goetz

doi:10.1145/93597.98720

Cited by 233 publications

(137 citation statements)

References 5 publications

Supporting

Mentioning

137

Contrasting

Order By: Relevance

“…One approach to achieving this is to map the physical-algebraic form of a query to a distributed one in which EXCHANGE operators [23] define boundaries between fragments. An EXCHANGE operator encapsulates all of control flow, data distribution and interprocess communication and is implemented in two parts, referred to as producer and consumer.…”

Section: Phase 2: Multi-site Optimizationmentioning

confidence: 99%

Comprehensive Optimization of Declarative Sensor Network Queries

Galpin

Brenninkmeijer

Jabeen

et al. 2009

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We present a sensor network query processing architecture that covers all the query optimization phases that are required to map a declarative query to executable code. The architecture is founded on the view that a sensor network truly is a distributed computing infrastructure, albeit a very constrained one. As such, we address the problem of how to develop a comprehensive optimizer for an expressive declarative continuous query language over acquisitional streams as one of finding extensions to classical distributed query processing techniques that contend with the peculiarities of sensor networks as an environment for distributed computing.

show abstract

Section: Phase 2: Multi-site Optimizationmentioning

confidence: 99%

Comprehensive Optimization of Declarative Sensor Network Queries

Galpin

Brenninkmeijer

Jabeen

et al. 2009

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…The Next function produces the results one at a time, and the Close function performs cleaning up. When combined with communication operators such as exchange [6], the iterator model supports pipelined parallelism.…”

Section: Technical Contextmentioning

confidence: 99%

A Foundation for the Replacement of Pipelined Physical Join Operators in Adaptive Query Processing

Eurviriyanukul

Fernandes

Paton

2006

Current Trends in Database Technology – EDBT 2006

View full text Add to dashboard Cite

Abstract. Adaptive query processors make decisions as to the most effective evaluation strategy for a query based on feedback received while the query is being evaluated. In essence, any of the decisions made by the optimizer (e.g., on operator order or on which operators to use) may be revisited in an adaptive query processor. This paper focuses on changes to physical operators (e.g., the specific join operators used, such as hash-join or merge-join) in pipelined query evaluators. In so doing, the paper characterizes the runtime properties of pipelined operators in a way that makes explicit when specific operators may be replaced, and that allows the validity of operator replacements to be proved. This is illustrated with reference to the substitution of join operators during their evaluation.

show abstract

“…As such, the operators support three main functions, open, next and close, which define the main interface through which they interact with one another. The implementation of the algebra is essentially sequential, and most of the functionality that relates to parallelism, such as flow control, inter-process communication and data distribution, is encapsulated in the exchange operator, following the operator model of parallelization [6]. Figure 1 illustrates two possible PQEPs for query Q1 in figure 2.…”

Section: The Polar Systemmentioning

confidence: 99%

An Experimental Performance Evaluation of Join Algorithms for Parallel Object Databases

Sampaio

Smith

Paton

et al. 2001

Euro-Par 2001 Parallel Processing

View full text Add to dashboard Cite

Abstract. Parallel relational databases have been successful in providing scalable performance for data intensive applications, and much work has been carried out on query processing techniques in such systems. However, although many applications associated with object databases also have stringent performance requirements, there has been much less work investigating parallel object database systems. An important feature for the performance of object databases is the speed at which relationships can be explored. In queries, this depends upon the effectiveness of different join algorithms into which queries that follow relationships can be compiled. This paper presents the results of empirical evaluations of four parallel join algorithms, two value based and two pointer based. The experiments have been run on Polar, a parallel ODMG object database system.

show abstract

Encapsulation of parallelism in the Volcano query processing system

Cited by 233 publications

References 5 publications

Comprehensive Optimization of Declarative Sensor Network Queries

Comprehensive Optimization of Declarative Sensor Network Queries

A Foundation for the Replacement of Pipelined Physical Join Operators in Adaptive Query Processing

An Experimental Performance Evaluation of Join Algorithms for Parallel Object Databases

Contact Info

Product

Resources

About