Abstract
Large distributed databases are split into fragments stored on far distant nodes that communicate through a communication network. Query execution requires data transfers between the processing sites of the system. In this paper we propose a solution for minimizing raw data transfers by re-arranging and replicating existing data within the constraints of the original database architecture. The proposed method gathers incremental knowledge about data access patterns and database statistics to solve the following problem: online re-allocation of the fragments in order to constantly optimize the query response time. We model our solution as a transport network and show in the final section the experimental numerical results we obtain by comparing the improvements obtained between various database configurations, before and after optimization.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Apers, P.M.G.: Data allocation in distributed database systems. ACM T Datab. Syst. 13(3), 263–304 (1988). Applied Mathematical Programming. Addison-Wesley (1977)
Cheng, C.H., Lee, W.K., Wong, K.F.: A genetic algorithm-based clustering approach for database partitioning. IEEE Trans. Syst. Man Cybern. Part C Appl. Rev. 32(3), 215–230 (2002)
Dokeroglu, T., Bayır, M.A., Cosar, A.: Integer linear programming solution for the multiple query optimization problem. In: Czachórski, T., Gelenbe, E., Lent, R. (eds.) Information Sciences and Systems 2014, pp. 51–60. Springer, Cham (2014). doi:10.1007/978-3-319-09465-6_6
Graham, J., Foss, J.A.: Efficient allocation in distributed object oriented databases. In: Proceedings of 16th International Conference on Parallel and Distributed Computing Systems (ISCA), pp. 471–412 (2003)
Huang, Y., Chen, J.: Fragment allocation in distributed database design. J. Inf. Sci. Eng. 17, 491–506 (2001)
Lin, X., Orlowska, M.: An integer linear programming approach to data allocation with the minimum total communication cost in distributed database systems. Inf. Sci. 85, 1–10 (1995)
Menon, S.: Allocating fragments in distributed databases. IEEE Trans. Parallel Distrib. 16(7), 577–585 (2005)
Morffi, A.R., et al.: A reinforcement learning solution for allocating replicated fragments in a distributed database. Comput. Sist. 11(2), 117–128 (2007)
Ozsu, M.T., Valduriez, P.: Principles of Distributed Database Systems. Springer, Heidelberg (2011)
Tambulea, L., Darabant, A.S., Varga, V.: Data transfer optimization in distributed database query processing. Studia Univ Babes Bolyai, Informatica LIX(1), 71–82 (2014)
Tambulea, L., Darabant, A. S., Varga, V.: Query Evaluation Optimization in a Distributed Database using Data Reorganization (2015). http://www.cs.ubbcluj.ro/~ivarga/ddbpaper
Virk, R.S., Singh, D.G.: Optimizing access strategies for a distributed database using genetic fragmentation. Int. J. Comput. Sci. Netw. Secur. 11(6), 180–183 (2011)
Wiese, L.: Clustering-based fragmentation and data replication for flexible query answering in distributed databases. Int. J. Cloud Comput. 3(1), 3–18 (2014)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Darabant, A.S., Tambulea, L., Varga, V. (2017). Access Patterns Optimization in Distributed Databases Using Data Reallocation. In: Benslimane, D., Damiani, E., Grosky, W., Hameurlain, A., Sheth, A., Wagner, R. (eds) Database and Expert Systems Applications. DEXA 2017. Lecture Notes in Computer Science(), vol 10438. Springer, Cham. https://doi.org/10.1007/978-3-319-64468-4_14
Download citation
DOI: https://doi.org/10.1007/978-3-319-64468-4_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-64467-7
Online ISBN: 978-3-319-64468-4
eBook Packages: Computer ScienceComputer Science (R0)