Abstract
Fragmentation of base relations in a distributed database management system increases the level of concurrency and therefore system throughput for query processing. Algorithms for horizontal fragmentation of relations in relational, object-oriented, or deductive databases exist; however, horizontal fragmentation techniques based on variable bindings appeared in user queries are lacking in deductive databases. In this paper we propose a horizontal fragmentation algorithm for distributed deductive database systems by partitioning a base or derived relation along its tuples according to the bindings imposed on user queries. The proposed fragmentation technique facilitates the design of distributed deductive database systems.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
C. Ezeife and K. Barker. A Comprehensive Approach to Horizontal Class Fragmentation in a Distributed Object Based System. Distributed and Parallel Databases, 3:247–272, 1995.
I. Fogg and M. Orlowska. Valid Unbiased Fragmentation for Distributed Database Design. Computers Math. Appli., 25(9):97–106, 1993.
M. Kifer and E. Lozinskii. On Compile-Time Query Optimization in Deductive Databases by Means of Static Filtering. ACM TODS, 15(3):385–426, Sept 1990.
H. Korth and A. Silberschatz. Database System Concepts, 2nd Edition. McGraw-Hill, 1991.
S. Lim and Y.-K. Ng. A Formal Approach for Horizontal Fragmentation in Distributed Deductive Database Design. http://lantern.cs.byu.edu/adal.html, 1996.
C. Meghini and C. Thanos. The Complexity of Operations on a Fragmented Relation. ACM TODS, 16(1):56–87, March 1991.
M. Ozsu and P. Valduriez. Principles of Distributed Database Systems. Prentice Hall, 1991.
S. Pramanik, D. Kao, and D. Vineyard. Fragmentation of Recursive Relations in Distributed Databases. In Proceedings of Advances in Database Technology (EDBT'92), pages 389–404. Springer-Verlag, 1992. LNCS 580.
D. Shin and K. Irani. Fragmenting Relations Horizontally Using a Knowledge-Based Approach. IEEE TOSE, 17(9):872–883, September 1991.
X. Zhou, Y. Zhang, and M.E. Orlowska. A New Fragmentation Scheme for Recursive Query Processing. Data and Knowledge Engineering, 13:177–192, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lim, S.J., Ng, YK. (1996). A formal approach for horizontal fragmentation in distributed deductive database design. In: Wagner, R.R., Thoma, H. (eds) Database and Expert Systems Applications. DEXA 1996. Lecture Notes in Computer Science, vol 1134. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0034684
Download citation
DOI: https://doi.org/10.1007/BFb0034684
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61656-6
Online ISBN: 978-3-540-70651-9
eBook Packages: Springer Book Archive