Sciweavers

15 search results - page 1 / 3
» Parallel Pointer-Based Join Algorithms in Memory-mapped Envi...
Sort
View
ICDE
1996
IEEE
134views Database» more  ICDE 1996»
14 years 6 months ago
Parallel Pointer-Based Join Algorithms in Memory-mapped Environments
Three pointer-based parallel join algorithms are presented and analyzed for environments in which secondary storage is made transparent to the programmer through memory mapping. B...
Peter A. Buhr, Anil K. Goel, Naomi Nishimura, Prab...
EUROPAR
2001
Springer
13 years 9 months ago
An Experimental Performance Evaluation of Join Algorithms for Parallel Object Databases
Abstract. Parallel relational databases have been successful in providing scalable performance for data intensive applications, and much work has been carried out on query processi...
Sandra de F. Mendes Sampaio, Jim Smith, Norman W. ...
SIGMOD
2011
ACM
299views Database» more  SIGMOD 2011»
12 years 7 months ago
Processing theta-joins using MapReduce
Joins are essential for many data analysis tasks, but are not supported directly by the MapReduce paradigm. While there has been progress on equi-joins, implementation of join alg...
Alper Okcan, Mirek Riedewald
BTW
2001
Springer
98views Database» more  BTW 2001»
13 years 9 months ago
On Parallel Join Processing in Object-Relational Database Systems
Abstract. So far only few performance studies on parallel object-relational database systems are available. In particular, the relative performance of relational vs. reference-base...
Holger Märtens, Erhard Rahm
IPPS
2006
IEEE
13 years 11 months ago
A segment-based DSM supporting large shared object space
This paper introduces a software DSM that can extend its shared object space exceeding 4GB in a 32bit commodity cluster environment. This is achieved through the dynamic memory ma...
Benny Wang-Leung Cheung, Cho-Li Wang