Sciweavers

430 search results - page 7 / 86
» An Efficient Parallel Join Algorithm Based On Hypercube-Part...
Sort
View
ICDE
2003
IEEE
143views Database» more  ICDE 2003»
16 years 29 days ago
Index-Based Approximate XML Joins
XML data integration tools are facing a variety of challenges for their efficient and effective operation. Among these is the requirement to handle a variety of inconsistencies or...
Sudipto Guha, Nick Koudas, Divesh Srivastava, Ting...
CORR
2010
Springer
124views Education» more  CORR 2010»
14 years 11 months ago
A New Framework for Join Product Skew
Different types of data skewness can result in load imbalance in the context of parallel joins under the shared nothing architecture. We study one important type of skewness, join ...
Foto N. Afrati, Victor Kyritsis, Paraskevas V. Lek...
CIKM
1994
Springer
15 years 3 months ago
TID Hash Joins
TID hash joins are a simple and memory-efficient method for processing large join queries. They are based on standard hash join algorithms but only store TID/key pairs in the hash...
Robert Marek, Erhard Rahm
ICPADS
2005
IEEE
15 years 5 months ago
An Efficient Partition-Based Parallel PageRank Algorithm
PageRank becomes the most well-known re-ranking technique of the search results. By its iterative computational nature, the computation takes much computing time and resource. Res...
Bundit Manaskasemsak, Arnon Rungsawang
VLDB
1991
ACM
143views Database» more  VLDB 1991»
15 years 3 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