A formal approach for horizontal fragmentation in distributed deductive database design

  • Seung Jin Lim
  • Yiu-Kai Ng
Active and Temporal Aspects 2
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1134)


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.


Query Processing Base Relation User Query Variable Binding Deductive Database 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    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.CrossRefGoogle Scholar
  2. 2.
    I. Fogg and M. Orlowska. Valid Unbiased Fragmentation for Distributed Database Design. Computers Math. Appli., 25(9):97–106, 1993.CrossRefGoogle Scholar
  3. 3.
    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.CrossRefGoogle Scholar
  4. 4.
    H. Korth and A. Silberschatz. Database System Concepts, 2nd Edition. McGraw-Hill, 1991.Google Scholar
  5. 5.
    S. Lim and Y.-K. Ng. A Formal Approach for Horizontal Fragmentation in Distributed Deductive Database Design., 1996.Google Scholar
  6. 6.
    C. Meghini and C. Thanos. The Complexity of Operations on a Fragmented Relation. ACM TODS, 16(1):56–87, March 1991.CrossRefGoogle Scholar
  7. 7.
    M. Ozsu and P. Valduriez. Principles of Distributed Database Systems. Prentice Hall, 1991.Google Scholar
  8. 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. 9.
    D. Shin and K. Irani. Fragmenting Relations Horizontally Using a Knowledge-Based Approach. IEEE TOSE, 17(9):872–883, September 1991.Google Scholar
  10. 10.
    X. Zhou, Y. Zhang, and M.E. Orlowska. A New Fragmentation Scheme for Recursive Query Processing. Data and Knowledge Engineering, 13:177–192, 1994.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Seung Jin Lim
    • 1
  • Yiu-Kai Ng
    • 1
  1. 1.Computer Science Dept.Brigham Young UniversityProvoUSA

Personalised recommendations