We study the effects of horizontal fragmentation in complex value databases on query processing using a query cost model. We show that optimisation of query processing and optimisation of fragment allocation are largely orthogonal to each other. We then show that if selection predicates used for horizontal fragmentation are ordered according to their likeliness to impact on the query costs, a binary search procedure can be adopted to find an “optimal” fragmentation and allocation.
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
Tel.: +1 703 830 6300
Fax: +1 703 830 2300 email@example.com
(Corporate matters and books only) IOS Press c/o Accucoms US, Inc.
For North America Sales and Customer Service
West Point Commons
Lansdale PA 19446
Tel.: +1 866 855 8967
Fax: +1 215 660 5042 firstname.lastname@example.org