![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Chaoyi Pang Chaoyi Pang, Guozhu Dong , Kotagiri Ramamohanarao : Incremental maintenance of shortest distance and transitive closure in first-order logic and SQL. ACM Trans. Database Syst. 30 (3): 698-721 (2005) Chaoyi Pang, Kerry L. Taylor , Xiuzhen Zhang , Mark A. Cameron : Generating Multidimensional Schemata from Relational Aggregation Queries. WISE 2004 : 584-589 Chaoyi Pang, Kotagiri Ramamohanarao , Guozhu Dong : Incremental FO (+, <) Maintenance of All-Pairs Shortest Paths for Undirected Graphs after Insertions and Deletions. ICDT 1999 : 365-382 Guozhu Dong , Chaoyi Pang: Maintaining Transitive Closure in First Order After Node-Set and Edge-Set Deletions. Inf. Process. Lett. 62 (4): 193-199 (1997) 1 [ 3 ] 2 [ 1 ] [ 2 ] [ 4 ] 3 [ 2 ] [ 4 ] 4 [ 3 ] 5 [ 3 ] ![]() ©2006 Association for Computing Machinery |