| B. Jiang, "Making the Partial Transitive Closure an Elementary Database Operation," Proc. GI Conf. Database Systems for Office Automation, Engineering, and Scientific Applications, Zurich, 1989. |
....this family of algorithms can be generalized to solve path problems and to solve problems in which some selection criteria have been specified for source or destination nodes. 1. INTRODUCTION Transitive closure is regarded to be an important operation for the next generation of database systems [1, 5, 6, 12, 13, 15, 17, 19, 21], and considerable research has been devoted to designing algorithms for computing the transitive closure of database relations [2, 4, 9 11, 16, 24] These algorithms can be classified into three major families. Iterative algorithms, such as semi naive [4] logarithmic [10, 24] and variations ....
B. Jiang, "Making the Partial Transitive Closure an Elementary Database Operation," Proc. GI Conf. Database Systems for Office Automation, Engineering, and Scientific Applications, Zurich, 1989.
....etc. we had to take physical I O costs into account, since the data representing the graph is in the objectbase. New algorithms have been designed, implemented, and extensively tested and evaluated in comparison with various others [Jia90a, Jia92c] 7 Publications Outside publications: HS91, Jia89, Jia90b, Jia91, Jia92a, Jia92b, LS92b, SLT91, SLT90, SS90a, SS90b, SS91b, SS91a, SST92, SSW91, Sch92a, Sch92b, Tre91, TS92] Internal reports and non refereed publications: DHL 92, Jia90a, LS92c, RRS92, RS92, TRSB92, TS91] Theses: Boo91, Fie91, Fra91, Fri91, Gar91, Ger90, Goh91, Gro91, ....
B. Jiang. Making the partial transitive closure an elementary database operation. In Proceedings of the GI/SI Conference on Database Systems for Office Automation, Engineering, and Scientific Applications, pages 231--245, Zurich, March 1989. Spring-Verlag, IFB 204.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC