Abstract
The objective of a data allocation algorithm is to locate the fragments at different sites so as to minimize the total data transfer cost incurred in executing a set of queries. We develop a site-independent fragment dependency graph representation to model the dependencies among the fragments accessed by a query, and use it to formulate and solve data allocation problems for distributed database systems based on (query-site and move-small) query execution strategies. We show that an optimal solution can be achieved when the query-site query execution strategy is employed, and for the move-small query execution strategy we performed experimental evaluation about the effectiveness of a hillclimbing heuristic algorithm in achieving a near-optimal solution.
This research has been funded by RGC CERG grant HKUST 609/94E.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
P. M. G. Apers. Data allocation in distributed database systems. ACM Transactions on Database Systems, 13(3):263–304, September 1988.
R. G. Casey. Allocation of copies of a file in an information network. In Proceedings of Spring Joint Computer Conference, IFIPS pages 617–625, 1972.
S. Ceri, G. Martella, and G. Pelagatti. Optimal file allocation for a distributed on a network of minicomputers. In Proceedings of International Conference on Databases, Aberdeen, pages 345–357, July 1980.
W. W. Chu. Optimal file allocation in a multiple computer system. IEEE Transactions on Computers, C-18(10), 1969.
D. W. Cornell and P. S. Yu. Site assignment for relations and join operations in the distributed transaction processing environment. In Proceedings of International Conference on Data Engineering, IEEE, pages 100–108, February 1988.
K. P. Eswaran. Placement of records in a file and file allocation in a computer network. Information Processing, pages 304–307, 1974.
B. Gavish and H. Pirkul. Computer and database location in distributed computer systems. IEEE Transactions on Computers, C-35(7):583–590, 1986.
X. M. Lin, M.E. Orlowska, and Y. C. Zhang. Database placement in communication networks for minimizing the overall transmission cost. Mathematical and Computer Modelling, 19(1):7–19, Jan 1994.
T. Ozsu and P. Valduriez. Principles of Distributed Database Systems. Printice Hall Inc., 1991.
S. Ram and R.E. Marsten. A model for database allocation incorporating a concurrency control mechanism. IEEE Transactions on Knowledge and Data Engineering, 3(3):389–95, Sept 1991.
C. V. Ramamoorthy and B. Wah. The placement of relations on a distributed relational database. In Proceedings of 1st Int. Conf. Distributed Computing Systems, Huntsville, Alabama, September Oct, 1979, pp 642–649.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Karlapalem, K., Pun, N.M. (1997). Query-driven data allocation algorithms for distributed database systems. In: Hameurlain, A., Tjoa, A.M. (eds) Database and Expert Systems Applications. DEXA 1997. Lecture Notes in Computer Science, vol 1308. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022044
Download citation
DOI: https://doi.org/10.1007/BFb0022044
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63478-2
Online ISBN: 978-3-540-69580-6
eBook Packages: Springer Book Archive