15 search results - page 2 / 3 » Parallel Pointer-Based Join Algorithms in Memory-mapped Envi... |
HPCC
2007
Springer
14 years 3 months ago
2007
Springer
Based on the renowned method of Bitton et al. (see [1]) we develop a concise but comprehensive analytical model for the well-known Binary Merge Sort, Bitonic Sort, Nested-Loop Join...
ICDE
2008
IEEE
14 years 11 months ago
2008
IEEE
In this paper we address the problem of minimizing the response time of a multi-way join query using pipelined (inter-operator) parallelism, in a parallel or a distributed environ...
ICDE
2007
IEEE
14 years 11 months ago
2007
IEEE
In this paper, we present an adaptive load diffusion operator to enable scalable processing of Multiway Windowed Stream Joins (MWSJs) using a cluster system. The load diffusion is...
ICCS
2003
Springer
14 years 2 months ago
2003
Springer
The exact enumeration of most interesting combinatorial problems has exponential computational complexity. The finite-lattice method reduces this complexity for most two-dimension...
ECSQARU
2003
Springer
14 years 2 months ago
2003
Springer
Abstract. Binary join trees have been a popular structure to compute the impact of multiple belief functions initially assigned to nodes of trees or networks. Shenoy has proposed t...