On the Distributed Database Union Operation

On the Distributed Database Union Operation

Rajiv M. Dewan (Northwestern University, USA)
Copyright: © 1992 |Pages: 12
DOI: 10.4018/jdm.1992040103
OnDemand PDF Download:
$30.00
List Price: $37.50

Abstract

In a distributed relational database, an operation that produces the union of fragments stored at different sites at a specified site is called a distributed union operation. In implementing the distributed union operation, operations other than the union operation, such as intersection and difference, may be used to facilitate the union. Optimization of the distributed union operation when the fragments are not disjoint requires the ability to predict the size of the result of set operations. A minimal basis of the result of multiple non-disjoint horizontal fragments of a relation is derived. This is used to develop a model for the optimization of the distributed union operation. As the problem is NP Hard, heuristic and lower bounding procedures are developed for a special case.

Complete Article List

Search this Journal:
Reset
Open Access Articles
Volume 28: 4 Issues (2017)
Volume 27: 4 Issues (2016)
Volume 26: 4 Issues (2015)
Volume 25: 4 Issues (2014)
Volume 24: 4 Issues (2013)
Volume 23: 4 Issues (2012)
Volume 22: 4 Issues (2011)
Volume 21: 4 Issues (2010)
Volume 20: 4 Issues (2009)
Volume 19: 4 Issues (2008)
Volume 18: 4 Issues (2007)
Volume 17: 4 Issues (2006)
Volume 16: 4 Issues (2005)
Volume 15: 4 Issues (2004)
Volume 14: 4 Issues (2003)
Volume 13: 4 Issues (2002)
Volume 12: 4 Issues (2001)
Volume 11: 4 Issues (2000)
Volume 10: 4 Issues (1999)
Volume 9: 4 Issues (1998)
Volume 8: 4 Issues (1997)
Volume 7: 4 Issues (1996)
Volume 6: 4 Issues (1995)
Volume 5: 4 Issues (1994)
Volume 4: 4 Issues (1993)
Volume 3: 4 Issues (1992)
Volume 2: 4 Issues (1991)
Volume 1: 2 Issues (1990)
View Complete Journal Contents Listing