Sciweavers

430 search results - page 1 / 86
» An Efficient Parallel Join Algorithm Based On Hypercube-Part...
Sort
View
PDIS
1994
IEEE
14 years 3 months ago
An Efficient Parallel Join Algorithm Based On Hypercube-Partitioning
Many parallel join algorithms have been proposed so far but most of which are developed focused on minimizing the disk It0 and CPU costs. The communication cost, however, is also ...
Hwan-Ik Choi, Byoung Mo Im, Myoung-Ho Kim, Yoon-Jo...
ICDE
1996
IEEE
134views Database» more  ICDE 1996»
15 years 10 days 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...
PVLDB
2008
201views more  PVLDB 2008»
13 years 10 months ago
Ed-Join: an efficient algorithm for similarity joins with edit distance constraints
There has been considerable interest in similarity join in the research community recently. Similarity join is a fundamental operation in many application areas, such as data inte...
Chuan Xiao, Wei Wang 0011, Xuemin Lin
ICPADS
2000
IEEE
14 years 3 months ago
Parallel Spatial Joins Using Grid Files
The most costly spatial operation in spatial databases is a spatial join with combines objects from two data sets based on spatial predicates. Even if the execution time of sequen...
Jin-Deog Kim, Bonghee Hong
TKDE
2002
148views more  TKDE 2002»
13 years 10 months ago
Parallel Star Join + DataIndexes: Efficient Query Processing in Data Warehouses and OLAP
On-Line Analytical Processing (OLAP) refers to the technologies that allow users to efficiently retrieve data from the data warehouse for decision-support purposes. Data warehouses...
Anindya Datta, Debra E. VanderMeer, Krithi Ramamri...