Sciweavers

54 search results - page 5 / 11
» Efficient parallel set-similarity joins using MapReduce
Sort
View
ICDE
1996
IEEE
134views Database» more  ICDE 1996»
14 years 11 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...
DANTE
1999
IEEE
149views Database» more  DANTE 1999»
14 years 2 months ago
Parallel R-Tree Spatial Join for a Shared-Nothing Architecture
The growing importance of spatial data has made it imperative that spatial operations be executed efficiently. The most expensive operation is the join for spatial databases. This...
Lawrence Mutenda, Masaru Kitsuregawa
VLDB
1991
ACM
143views Database» more  VLDB 1991»
14 years 1 months ago
Handling Data Skew in Multiprocessor Database Computers Using Partition Tuning
Shared nothing multiprocessor archit.ecture is known t.obe more scalable to support very large databases. Compared to other join strategies, a hash-ba9ed join algorithm is particu...
Kien A. Hua, Chiang Lee
PVLDB
2010
178views more  PVLDB 2010»
13 years 8 months ago
Hadoop++: Making a Yellow Elephant Run Like a Cheetah (Without It Even Noticing)
MapReduce is a computing paradigm that has gained a lot of attention in recent years from industry and research. Unlike parallel DBMSs, MapReduce allows non-expert users to run co...
Jens Dittrich, Jorge-Arnulfo Quiané-Ruiz, A...
CORR
2010
Springer
153views Education» more  CORR 2010»
13 years 10 months ago
GraphLab: A New Framework for Parallel Machine Learning
Designing and implementing efficient, provably correct parallel machine learning (ML) algorithms is challenging. Existing high-level parallel abstractions like MapReduce are insuf...
Yucheng Low, Joseph Gonzalez, Aapo Kyrola, Danny B...