Article

An Effective Algorithm for Parallelizing Hash Joins in the Presence of Data Skew

Authors:

Joel L. Wolf,

Daniel M. Dias,

Philip S. Yu,

John TurekAuthors Info & Claims

Proceedings of the Seventh International Conference on Data Engineering

Pages 200 - 209

Published: 08 April 1991 Publication History

Abstract

No abstract available.

Cited By

View all

Li YChasseur CPatel JSellis TDavidson SIves Z(2015)A Padded Encoding Scheme to Accelerate Scans by Leveraging SkewProceedings of the 2015 ACM SIGMOD International Conference on Management of Data10.1145/2723372.2737787(1509-1524)Online publication date: 27-May-2015
https://dl.acm.org/doi/10.1145/2723372.2737787
Bruno NKwon YWu M(2014)Advanced join strategies for large-scale distributed computationProceedings of the VLDB Endowment10.14778/2733004.27330207:13(1484-1495)Online publication date: 1-Aug-2014
https://dl.acm.org/doi/10.14778/2733004.2733020
Gonina EKannan AShafer JBudiu MArlitt MFedak GFox G(2011)Parallelizing large-scale data processing applications with data skewProceedings of the second international workshop on MapReduce and its applications10.1145/1996092.1996101(35-42)Online publication date: 8-Jun-2011
https://dl.acm.org/doi/10.1145/1996092.1996101
Show More Cited By

Recommendations

An effective single-hop distributed hash table with high lookup performance and low traffic overhead

Distributed hash tables DHTs have been used in several applications, but most DHTs have opted to solve lookups with multiple hops, to minimize bandwidth costs while sacrificing lookup latency. This paper presents D1HT, an original DHT that has a peer-to-...
Stealth distributed hash table: a robust and flexible super-peered DHT
CoNEXT '06: Proceedings of the 2006 ACM CoNEXT conference

Most Distributed Hash Tables (DHTs) simply consider interconnecting homogeneous nodes on the same overlay. However, realistically nodes on a network are heterogeneous in terms of their capabilities. Because of this, traditional DHTs have been shown to ...
Incrementally improving lookup latency in distributed hash table systems
SIGMETRICS '03: Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems

Distributed hash table (DHT) systems are an important class of peer-to-peer routing infrastructures. They enable scalable wide-area storage and retrieval of information, and will support the rapid development of a wide variety of Internet-scale ...

Comments

Information & Contributors

Information

Published In

Proceedings of the Seventh International Conference on Data Engineering

April 1991

710 pages

ISBN:0818621389

Publisher

IEEE Computer Society

United States

Publication History

Published: 08 April 1991

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

25
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 13 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Li YChasseur CPatel JSellis TDavidson SIves Z(2015)A Padded Encoding Scheme to Accelerate Scans by Leveraging SkewProceedings of the 2015 ACM SIGMOD International Conference on Management of Data10.1145/2723372.2737787(1509-1524)Online publication date: 27-May-2015
https://dl.acm.org/doi/10.1145/2723372.2737787
Bruno NKwon YWu M(2014)Advanced join strategies for large-scale distributed computationProceedings of the VLDB Endowment10.14778/2733004.27330207:13(1484-1495)Online publication date: 1-Aug-2014
https://dl.acm.org/doi/10.14778/2733004.2733020
Gonina EKannan AShafer JBudiu MArlitt MFedak GFox G(2011)Parallelizing large-scale data processing applications with data skewProceedings of the second international workshop on MapReduce and its applications10.1145/1996092.1996101(35-42)Online publication date: 8-Jun-2011
https://dl.acm.org/doi/10.1145/1996092.1996101
Crolotte AGhazal A(2011)Introducing skew into the TPC-H benchmarkProceedings of the Third TPC Technology conference on Topics in Performance Evaluation, Measurement and Characterization10.1007/978-3-642-32627-1_10(137-145)Online publication date: 29-Aug-2011
https://dl.acm.org/doi/10.1007/978-3-642-32627-1_10
Xu YKostamaa P(2009)Efficient outer join data skew handling in parallel DBMSProceedings of the VLDB Endowment10.14778/1687553.16875652:2(1390-1396)Online publication date: 1-Aug-2009
https://dl.acm.org/doi/10.14778/1687553.1687565
Xu YKostamaa PZhou XChen LLakshmanan LNg RShasha D(2008)Handling data skew in parallel joins in shared-nothing systemsProceedings of the 2008 ACM SIGMOD international conference on Management of data10.1145/1376616.1376720(1043-1052)Online publication date: 9-Jun-2008
https://dl.acm.org/doi/10.1145/1376616.1376720
Raman VHan WNarang IBratbergsengen K(2005)Parallel querying with non-dedicated computersProceedings of the 31st international conference on Very large data bases10.5555/1083592.1083603(61-72)Online publication date: 30-Aug-2005
https://dl.acm.org/doi/10.5555/1083592.1083603
Khan MPaul RAhmed IGhafoor A(1999)Intensive Data Management in Parallel SystemsDistributed and Parallel Databases10.1023/A:10264589024567:4(383-414)Online publication date: 1-Oct-1999
https://dl.acm.org/doi/10.1023/A%3A1026458902456
Harada LAkaboshi NOgihara KTake RPissinou NNicholas CFrench JGardarin G(1998)Dynamic skew handling in parallel mining of association rulesProceedings of the seventh international conference on Information and knowledge management10.1145/288627.288634(76-85)Online publication date: 1-Nov-1998
https://dl.acm.org/doi/10.1145/288627.288634
Brunie LKosch H(1996)Control strategies for complex relational query processing in shared nothing systemsACM SIGMOD Record10.1145/234889.23489525:3(34-39)Online publication date: 1-Sep-1996
https://dl.acm.org/doi/10.1145/234889.234895
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

Cited By

Recommendations

An effective single-hop distributed hash table with high lookup performance and low traffic overhead

Stealth distributed hash table: a robust and flexible super-peered DHT

Incrementally improving lookup latency in distributed hash table systems

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations