NDLI: An effective algorithm for parallelizing sort merge joins in the presence of data skew

Content Provider	IEEE Xplore Digital Library
Author	Wolf, J.L. Dias, D.M. Yu, P.S.
Copyright Year	1990
Description	Author affiliation: IBM Thomas J Watson Res. Center, Yorktown Heights, NY, USA (Wolf, J.L.; Dias, D.M.; Yu, P.S.)
Abstract	A parallel sort-merge-join algorithm that uses a divide-and-conquer approach to address the data skew problem is proposed. The algorithm adds an extra scheduling phase to the usual sort, transfer and join phases. During the scheduling phase, a parallelizable optimization algorithm, using the output of the sort phase, attempts to balance the load across the multiple processors in the subsequent join phase. The algorithm naturally identifies the largest skew elements and assigns each of them to an optimal number of processors. Assuming a Zipf-like distribution for data skew, the algorithm is shown to achieve very good load balancing for the join phase in a CPU-bound environment and to be very robust relative to the degree of data skew and the total number of processors.<>
Starting Page	103
Ending Page	115
File Size	902816
Page Count	13
File Format	PDF
ISBN	0818620528
DOI	10.1109/DPDS.1990.113702
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1990-07-02
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Scheduling algorithm Processor scheduling Relational databases Parallel processing Load management Robustness Delay Parallel architectures Proposals Prototypes
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

An effective algorithm for parallelizing hash joins in the presence of data skew

A parallel sort merge join algorithm for managing data skew

An effective algorithm for parallelizing sort merge joins in the presence of data skew

New algorithms for parallelizing relational database joins in the presence of data skew

A parallel hash join algorithm for managing data skew

Online Algorithms for Handling Skew in Parallel Joins

Algorithms for handling skew in parallel task scheduling

Data skew and the scalability of parallel joins

Database Support for Weighted Match Joins

An effective algorithm for parallelizing sort merge joins in the presence of data skew

Similar Documents

An effective algorithm for parallelizing hash joins in the presence of data skew

A parallel sort merge join algorithm for managing data skew

An effective algorithm for parallelizing sort merge joins in the presence of data skew

New algorithms for parallelizing relational database joins in the presence of data skew

A parallel hash join algorithm for managing data skew

Online Algorithms for Handling Skew in Parallel Joins

Algorithms for handling skew in parallel task scheduling

Data skew and the scalability of parallel joins

Database Support for Weighted Match Joins

An effective algorithm for parallelizing sort merge joins in the presence of data skew