Distributed Fragmented Database Set Queries
Clive Carlton Sanford, Robert E. Markland, Patrick R. Philipoom, Ken Darby-Dowman · Journal of Database Management · 1990
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.Request access from your librarian to read this article's full text.