Hershey, Pennsylvania
New York, New YorkBeijing, China
Distributed Fragmented Database Set Queries

Distributed Fragmented Database Set Queries

Clive C. Sanford (University of North Texas, USA), Robert E. Markland (University of South Carolina, USA), Patrick R. Philipoom (University of South Carolina, USA), and Kenneth Darby-Dowman (The Polytechnic of Central London, UK)
Copyright: © 1990 |Pages: 18
DOI: 10.4018/jdm.1990100103
OnDemand:
(Individual Articles)
Available
$37.50
Current Special Offers
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

This study investigates the distributed multiple condition set query optimization problem for a single relational database with horizontally partitioned data. A mixed integer linear programming formulation constructs a minimum cost query graph which ships combined and/or uncombined condition sets to a subset of the network sites which contain the partitioned data. Two heuristics of different computational complexity are evaluated against a plant location lower bounding procedure. Parameters central to the design of the heuristics are the ranges of (1) the number of network nodes, (2) the arc unit transmission costs, (3) the amount of data at the network sites, and (4) the selectivity factors between the partitioned data. The results of a full factorial experiment evaluated over these range sets are presented.

Complete Article List

Search this Journal:
Reset
Volume 36: 1 Issue (2025)
Volume 35: 1 Issue (2024)
Volume 34: 3 Issues (2023)
Volume 33: 5 Issues (2022): 4 Released, 1 Forthcoming
Volume 32: 4 Issues (2021)
Volume 31: 4 Issues (2020)
Volume 30: 4 Issues (2019)
Volume 29: 4 Issues (2018)
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