
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
K.C. Guh, C. Yu, "Efficient Management of Materialized Generalized Transitive Closure in Centralized and Parallel Environments," IEEE Transactions on Knowledge and Data Engineering, vol. 4, no. 4, pp. 371381, August, 1992.  
BibTex  x  
@article{ 10.1109/69.149932, author = {K.C. Guh and C. Yu}, title = {Efficient Management of Materialized Generalized Transitive Closure in Centralized and Parallel Environments}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {4}, number = {4}, issn = {10414347}, year = {1992}, pages = {371381}, doi = {http://doi.ieeecomputersociety.org/10.1109/69.149932}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Knowledge and Data Engineering TI  Efficient Management of Materialized Generalized Transitive Closure in Centralized and Parallel Environments IS  4 SN  10414347 SP371 EP381 EPD  371381 A1  K.C. Guh, A1  C. Yu, PY  1992 KW  centralised environments; materialized generalized transitive closure; parallel environments; data structure; queries; deletions; insertions; multiprocessor environment; time complexities; computational complexity; data structures; deductive databases; expert systems; parallel processing VL  4 JA  IEEE Transactions on Knowledge and Data Engineering ER   
A data structure is used to store materialized generalized transitive closure so that the evaluation of generalized transitive closure queries, deletions, and insertions of tuples can be performed efficiently in centralized and parallel environments. Some techniques to manage materialized transitive closure are presented and generalized to more general recursions. The proposed algorithms and the associated data structures are simple conceptually and in implementation. In a multiprocessor environment, the time complexities for insertion and deletion of the authors schemes are reduced. Only two rounds of communication are needed.
[1] H. AitKaci, R. Boyer, P. Lincoln, and R. Nasr, "Efficient implementation of lattice operations,"ACM Trans. Program. Lang. Syst., vol. 11, no. 1, pp. 115146, Jan. 1989.
[2] A. Aho and J. Ullman, "Universality of data retrieval languages," inProc. 6th ACM Symp: Principles of Programming Languages, San Antonio, TX, Jan. 1979.
[3] R. Agrawalet al., "Efficient management of transitive relationships in large data and knowledge bases," in [42], pp. 253262, 1989.
[4] R. Agrawal, "Alpha: An Extension of Relational Algebra to Express a Class of Recursive Queries,"Proc. Third Int'l Conf. Data Eng., CS Press, Los Alamitos, Calif., Order No. FN762, 1987, pp. 580590.
[5] J. A. Blakely, N. Coburn, and P. A. Larson, "Updated derived relations: detecting irrelevant and autonomously computable updates,"ACM Trans. Database Syst., vol. 14, pp. 369400, 1989.
[6] F. Bancilhon and R. Ramakrishnan, "An amateur's introduction to recursive query processing strategies," inProc. 1986 ACMSIGMOD Conf. Management of Data(Washington, DC), May 1986, pp. 1652.
[7] F. Bancilhon, D. Maier, Y. Sagiv, and J. D. Ullman, "Magic sets and other strange ways to implement logic programs," inProc. 5th ACM Symp. Principles of Database Syst.(Cambridge, MA), Mar. 1986, pp. 115.
[8] C. Chang, "On evaluation of queries containing derived relations in a relational data," inAdvances in Data Base Theory, Vol. 1, H. Gallaire, J. Minker, and J. M. Nicolas, Eds. New York: Plenum, 1981.
[9] N. Deo,Graph Theory with Application to Engineering and Computer Science.Englewood Cliffs, NJ: PrenticeHall, 1974.
[10] R. J. Enbody and H. C. Du, "Dynamic hashing systems,"ACM Computing Surveys, vol. 20, no. 2, June 1988.
[11] H. Gallaire, J. Minker, and J. Nicolas, "Logic and databases: A deductive approach,"ACM Comput. Surveys, vol. 16, pp. 153185,1984.
[12] A. Ghafoor and P. B. Berra, "An efficient communication structure for distributed commit protocols,"IEEE J. Selected Areas Commun., vol. 7, pp. 375389, Apr. 1989.
[13] K. C. Guh, C. Sun, and C. T. Yu, "Real time retrieval and update of materialized transitive closure," presented at the IEEE Int. Conf. on Data Engineering, Apr. 1991.
[14] G. Gardarin and C. De Maindreville, "Evaluation of database recursive logic programs as recurrent function series," inProc. ACMSIGMOD Conf., Washington, DC, May 1986.
[15] J. Han and W. Lu, "Asynchronous chain recursions,"IEEE Trans. Knowl. Data Eng., vol. 1, pp. 185195, June 1989.
[16] L. J. Henschen and S. Naqvi, "On compiling queries in recursive firstorder databases,"J. ACM, vol. 1, no. 1, pp. 4785, 1984.
[17] Y. E. Ioannidis and R. Ramakrishnan, "Efficient transitive closure algorithms," inProc. 14th Int. Conf. on Very Large Data Bases, Los Angeles, Aug. 1988, pp. 382394.
[18] Y. E. Ioannidis and E. Wong, "Transforming nonlinear recursion to linear recursion," inProc. Second Int. Conf. on Expert Database Systems, Apr. 1988, pp. 187207.
[19] H. V. Jagadish and R. Agrawal, "A study of transitive closure as a recursion mechanism," inProc. 1987 ACM SIGMOD Conf. (San Francisco, CA), 1987, pp. 331334.
[20] H. V. Jagadish, "A compressed transitive closure technique for efficient fixedpoint query processing," inProc. Second Int. Conf. on Expert Database Systems, Apr. 1988, pp. 209223.
[21] M. Kifer and E. L. Lozinskii, "A frame work for an efficient implementation of deductive database," inProc. Advanced Database Symp., Tokyo, Japan, 1986.
[22] H. Lu, K. Mikkilineni, and J. P. Richardson, "Design and evaluation of algorithms to compute the transitive closure of a database relation," inProc. Third Int. Conf. on Data Engineering, Los Angeles, Feb. 35, 1987, pp. 112119.
[23] J. F. Naughton, R. Ramakrishnan, Y. Sagiv, and J. D. Ullman, "Efficient evaluation of right, left, and multilinear rules," inProc. 1989 ACMSIGMOD Conf. Management of Data(Portland, OR), June 1989, pp. 235242.
[24] L. Raschid and S. Y. W. Su, "A parallel processing strategy for evaluating recursive queries," inProc. 12th Int. Conf. on Very Large Data Bases, Kyoto, Japan, Aug. 2528, 1986, pp. 412419.
[25] Y. Sagiv, "Optimizing Datalog programs," inProc. ACM 1987 SIGMODSIGACT Symp. Principles Database Syst., San Diego, CA, Mar. 1987.
[26] J. Srivastava and D. Rotem, "Analytical model of materialized view maintenance," inProc. ACM PODS, 1988, pp. 126134.
[27] D. Troy, C. Yu, and W. Zhang, "Linearization of nonlinear recursive rules,"IEEE Trans. Software Eng., vol. 15, pp. 11091119, Sept. 1989.
[28] J. D. Ullman, "Implementation of logical query languages for databases,"ACM TODS, vol. 10, no. 3, pp. 289321, 1985.
[29] P. Valduriez and S. Khoshafian, "Transitive closure of transitively closed closed relations," inProc. Second Int. Conf. on Expert Database Systems, Apr. 1988, pp. 177185.
[30] O. Wolfson and A. Siblerschatz, "Distributed processing of logic programs," inProc. ACM SIGMOD, Chicago, June 1988, pp. 329336.
[31] W. Zhang, C. T. Yu, and D. Troy, "A necessary and sufficient condition for a doubly recursive rule to be equivalent to a linear recursive rule,"ACM Trans. Database Syst., vol. 15, no. 3, pp. 459482, Sept. 1990.