NDLI: A graph theoretical approach to determine a join reducer sequence in distributed query processing

Content Provider	IEEE Xplore Digital Library
Author	Ming-Syan Chen Yu, P.S.
Copyright Year	1989
Abstract	Semijoin has traditionally been relied upon to reduce the cost of data transmission for distributed query processing. However, judiciously applying join operations as reducers can lead to further reduction in the amount of data transmission required. In view of this fact, we explore the approach of using join operations as reducers in distributed query processing. We first show that the problem of determining a sequence of join operations for a query can be transformed to that of finding a specific type of set of cuts to the corresponding query graph, where a cut to a graph is a partition of nodes in that graph. Then, in light of this concept, we prove that the problem of determining the optimal sequence of join operations for a given query graph is of exponential complexity, thus justifying the necessity of applying heuristic approaches to solve this problem. By mapping the problem of determining a sequence of join reducers into the one of finding a set of cuts, we develop (for tree and general query graphs, respectively) efficient heuristic algorithms to determine a join reducer sequence for distributed query processing. The algorithms developed are based on the concept of divide and conquer and are of polynomial time complexity. Simulation is performed to evaluate these algorithms.<>
Sponsorship	IEEE IEEE Comput. Soc. Tech. Committee on Data Eng IEEE Computer Society
Starting Page	152
Ending Page	165
Page Count	14
File Size	1420437
File Format	PDF
ISSN	10414347
Volume Number	6
Issue Number	1
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1994-02-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Query processing Data communication Tree graphs Partitioning algorithms Heuristic algorithms Performance evaluation Cost function Computational efficiency Relational databases Database systems
Content Type	Text
Resource Type	Article
Subject	Information Systems Computational Theory and Mathematics Computer Science Applications

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

The query clustering problem: a set partitioning approach

Interleaving a join sequence with semijoins in distributed query processing

Optimizing queries with foreign functions in a distributed environment

Optimization Algorithms for Distributed Queries

Optimizing join queries in distributed databases

Optimal Query Processing for Distributed Database Systems

Optimizing large join queries using a graph-based approach

Performance issues in distributed query processing

An Optimal Algorithm for Processing Distributed Star Queries

A graph theoretical approach to determine a join reducer sequence in distributed query processing

Similar Documents

The query clustering problem: a set partitioning approach

Interleaving a join sequence with semijoins in distributed query processing

Optimizing queries with foreign functions in a distributed environment

Optimization Algorithms for Distributed Queries

Optimizing join queries in distributed databases

Optimal Query Processing for Distributed Database Systems

Optimizing large join queries using a graph-based approach

Performance issues in distributed query processing

An Optimal Algorithm for Processing Distributed Star Queries

A graph theoretical approach to determine a join reducer sequence in distributed query processing