This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Description and Identification of Distributed Fragments of Recursive Relations
December 1996 (vol. 8 no. 6)
pp. 1002-1016

Abstract—In a distributed environment, it is advantageous to fragment a relation and store the fragments at various sites. In this paper, based on the concept of lattice structures, we develop a framework to study the fragmentation problems of distributed recursive relations. Two of the fragmentation problems are how to describe and identify fragments. Description and identification methods previously suggested are more suitable in parallel environments than in distributed databases. We propose a method to describe and identify fragments based on lattice structures. Finding lattice descriptions of fragments is shown to be an NP-complete problem. We analyze the performance of lattice approach both theoretically and experimentally. This is done by creating a database of recursive relations. The empirical analysis shows that our proposed algorithms give near-optimal solutions.

[1] R. Agrawal, A. Borgida, and H. Jagadish, "Efficient Management of Transitive Relationships in Large Data and Knowledge Bases," Proc. ACM-SIGMOD 1989 Int'l Conf. Management of Data, pp. 253-262, 1989.
[2] R. Agrawal, S. Dar, and H. Jagadish, “Direct Transitive Closure Algorithms: Design and Performance Evaluation,” ACM Trans. Database Systems, vol. 15, no. 3, pp. 427-458, Sept. 1990.
[3] F. Bancilhon and R. Ramakrishnan,“An amateur’s introduction to recursive query processing strategies,” Proc. 1986 ACM-SIGMOD Int’l Conf. Management Data, pp. 16-52,Washington, DC, May 1986.
[4] S. Ceri, M. Negri, and G. Pelagatti, "Horizontal Partitioning in Database Design," Proc. ACM SIGMOD 1982 Int'l Conf. Management of Data, 1982.
[5] T. Cormen, C. Leiserson, and R. Rivest, "The Set-Covering Problem," Introduction to Algorithms, chapter 37.3, pp. 974-978.Cambridge, Mass., and New York: MIT Press and McGraw-Hill, 1990.
[6] S. Ganguly,A. Silberschatz,, and S. Tsur., “A framework for the parallel evaluation of datalog queries,” Proc. of the 1990 ACM SIGMOD Conf. on Management of Data, 1990.
[7] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness.New York: W.H. Freeman, 1979.
[8] M.A.W. Houstma, P.M.G. Apers, and S. Ceri, "Distributed Transitive Closure Computations: The Disconnection Set Approach," Proc. 16th VLDB Conf., pp. 335-346, 1990.
[9] M.A.W. Houstma, F. Cacace, and S. Ceri, "Parallel Hierarchical Evaluation of Transitive Closure Queries," Proc. First Int'l Conf. Parallel and Distributed Information Systems, pp. 130-137, 1990.
[10] M. Houstma, P. Apers, and G. Schipper, “Data Fragmentation for Parallel Transitive Closure Strategies,” Proc. IEEE Ninth Int'l Conf. Data Eng., pp. 447-456, 1993.
[11] Y. Huang and J. Cheiney, "Parallel Computation of Direct Transitive Closures," Proc. IEEE Seventh Int'l Conf. Data Eng., pp. 192-199, 1991.
[12] G. Hulin, "Parallel Processing of Recursive Queries in Distributed Architectures," Proc. Fifth Int'l Conf. VLDB, pp. 87-96, 1989.
[13] K. Hua, J. Su, and C. Hua, “Efficient Evaluation of Traversal Recursive Queries Using Connectivity Index,” Proc. IEEE Ninth Int'l Conf. Data Eng., pp. 549-558, 1993.
[14] Y. Ioannidis and R. Ramakirishnan, “Efficient Transitive Closure Algorithms,” Proc. 14th VLDB Conf., pp. 382-394, 1988.
[15] Y. Ioannidis, R. Ramakrishnan, and L. Winger, "Transitive Closure Algorithms Based on Graph Traversal," ACM Trans. Database Systems, vol. 18, no. 3, Sept. 1993.
[16] H.V. Jagadish,R. Agrawal,, and L. Ness,“A study of transitive closure as a recursion mechanism,” Proc. 1987 ACM-SIGMOD Int’l Conf. Management of Data, pp. 331-344,San Francisco, Calif., May 1987.
[17] H. Jagadish, “A Compression Technique to Materialize Transitive Closure,” ACM Trans. Database Systems, vol. 15, no. 4, pp. 558-598, Dec. 1990.
[18] B. Jiang, “A Suitable Algorithm for Computing Partial Transitive Closures in Databases” Proc. IEEE Sixth Int'l Conf. Data Eng., pp. 264-271, 1990.
[19] S. Moran and Y. Perl, "The Complexity of Identifying Redundant and Essential Elements," J. Algorithm, vol. 2, pp. 22-30, 1981.
[20] W. Nejdl, S. Ceri, and G. Wiederhold, "Evaluating Recursive Queries in Distributed Databases," IEEE Transactions on Knowledge and Data Engineering, vol. 5, pp. 104-121, Feb. 1993.
[21] G. Qadah, L. Henschen, and J. Kim, “Efficient Algorithms for the Instantiated Transitive Closure Queries,” IEEE Trans. Software Eng., vol. 17, no. 3, pp. 296-309, Mar. 1991.
[22] D. Ries and R. Epstein, "Evaluation of Distribution Criteria for Distributed Database Systems," Univ. of California at Berkeley, Technical Report UCB/ERL M78/22, May 1978.
[23] I. Toroslu and G. Qadah, “The Efficient Computation of Strong Partial Transitive-Closures,” Proc. IEEE Ninth Int'l Conf. Data Eng., pp. 530-537, 1993.
[24] P. Valduriez and S. Khoshafian, "Parallel Evaluation of the Transitive Closure of a Database Relation," Int'l J. Parallel Programming, pp. 19-42, 1988.

Index Terms:
Distributed databases, fragments, lattice, lattice cover, partial order set, recursive relations.
Citation:
Sakti Pramanik, Sungwon Jung, "Description and Identification of Distributed Fragments of Recursive Relations," IEEE Transactions on Knowledge and Data Engineering, vol. 8, no. 6, pp. 1002-1016, Dec. 1996, doi:10.1109/69.553168
Usage of this product signifies your acceptance of the Terms of Use.