NDLI: Optimizing join queries in distributed databases

Content Provider	IEEE Xplore Digital Library
Author	Pramanik, S. Vineyard, D.
Copyright Year	1976
Abstract	A reduced cover set of the set of full reducer semijoin programs for an acyclic query graph for a distributed database system is given. An algorithm is presented that determines the minimum cost full reducer program. The computational complexity of finding the optimal full reducer for a single relation is of the same order as that of finding the optimal full reducer for all relations. The optimization algorithm is able to handle query graphs where more than one attribute is common between the relations. A method for determining the optimum profitable semijoin program is presented. A low-cost algorithm which determines a near-optimal profitable semijoin program is outlined. This is done by converting a semijoin program into a partial order graph. This graph also allows one to maximize the concurrent processing of the semijoins. It is shown that the minimum response time is given by the largest cost path of the partial order graph. This reducibility is used as a post optimizer for the SSD-1 query optimization algorithm. It is shown that the least upper bound on the length of any profitable semijoin program is N(N-1) for a query graph of N nodes.<>
Sponsorship	IEEE Computer Society Technical Council on Software Engineering Association for Computing Machinery (ACM) IEEE Computer Society
Starting Page	1319
Ending Page	1326
Page Count	8
File Size	856052
File Format	PDF
ISSN	00985589
Volume Number	14
Issue Number	9
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1988-09-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	Distributed databases Cost function Query processing Data communication Database systems Computational complexity Delay Computer science Upper bound Greedy algorithms
Content Type	Text
Resource Type	Article
Subject	Software

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

Optimizing queries with foreign functions in a distributed environment

Optimization Algorithms for Distributed Queries

Optimizing large join queries using a graph-based approach

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

Performance issues in distributed query processing

Optimizing sort order query execution in balanced and nested grid files

Dynamic Rematerialization: Processing Distributed Queries Using Redundant Data

A multi-colony ant algorithm for optimizing join queries in distributed database systems

A Method for Processing Distributed Database Queries

Optimizing join queries in distributed databases

Similar Documents

Optimizing queries with foreign functions in a distributed environment

Optimization Algorithms for Distributed Queries

Optimizing large join queries using a graph-based approach

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

Performance issues in distributed query processing

Optimizing sort order query execution in balanced and nested grid files

Dynamic Rematerialization: Processing Distributed Queries Using Redundant Data

A multi-colony ant algorithm for optimizing join queries in distributed database systems

A Method for Processing Distributed Database Queries

Optimizing join queries in distributed databases