A formal approach for horizontal fragmentation in distributed deductive database design
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.
KeywordsQuery Processing Base Relation User Query Variable Binding Deductive Database
Unable to display preview. Download preview PDF.
- 4.H. Korth and A. Silberschatz. Database System Concepts, 2nd Edition. McGraw-Hill, 1991.Google Scholar
- 5.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.Google Scholar
- 7.M. Ozsu and P. Valduriez. Principles of Distributed Database Systems. Prentice Hall, 1991.Google Scholar
- 8.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.Google Scholar
- 9.D. Shin and K. Irani. Fragmenting Relations Horizontally Using a Knowledge-Based Approach. IEEE TOSE, 17(9):872–883, September 1991.Google Scholar