An efficient algorithm for answering graph reachability queries

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2008, Pages 893-902

  Chen, Yangjun ^a   Chen, Yibin ^a  

^a UNIVERSITY OF WINNIPEG   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS; TECHNOLOGY;

DATA ENGINEERING; DIRECTED GRAPHS; EFFICIENT ALGORITHMS; INTERNATIONAL CONFERENCES; REACH ABILITY; REACHABILITY QUERIES; RECURSION; TRANSITIVE CLOSURES;

GRAPH THEORY;

EID: 52649167740     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2008.4497498     Document Type: Conference Paper

References (31)

1. 1.5 √e/(logn) ), Information Processing Letters, 37(1991), 237-240.
2. A. S. Asratian, T. Denley, and R. Haggkvist, Bipartite Graphs and their Applications, Cambridge University, 1998.
3. J. Banerjee, W. Kim, S. Kim and J.F. Garza, "Clustering a DAG for CAD Databases," IEEE Trans. on Knowledge and Data Engineering, Vol. 14, No. 11, Nov. 1988, pp. 1684-1699.
4. K.S. Booth and G.S. Leuker, "Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms," J. Comput. Sys. Sci., 13(3):335-379, Dec. 1976.
5. M. Carey et al., "An Incremental Join Attachment for Starburst," in: Proc. 16th VLDB Conf., Brisbane, Australia, 1990, pp. 662-673.
6. Y. Chen, Graph Decomposition and Recursive Closures, in Proc. CaiSE 2003 Forum at 15th Conf. on Advanced Information Systems Engineering, June 2003, Klagenfurt/-Velden, Austria, pp. 5-8.
7. Y. Chen, "On the Graph Traversal and Linear Binary-chain Programs," IEEE Transactions on Knowledge and Data Engineering, Vol. 15, No. 3, May 2003, pp. 573-596.
8. N.H. Cohen, "Type-extension tests can be performed in constant time," ACM Transactions on Programming Languages and Systems, 13:626-629, 1991.
9. E. Cohen, E. Halperin, H. Kaplan, and U. Zwick, Reachability and distance queries via 2-hop labels, SIAM J. Comput, vol. 32, No. 5, pp. 1338-1355, 2003.
10. J. Cheng, J.X. Yu, X. Lin, H. Wang, and P.S. Yu, Fast computation of reachability labeling for large graphs, in Proc. EDBT, Munich, Germany, May 26-31, 2006.
11. 2 Relations: An Integrated View on Flat Tables and Hierarchies," Proc. ACM SIGMOD Conf., Washington D.C., 1986, pp. 356-367.
12. R.P. Dilworth, A decomposition theorem for partially ordered sets, Ann. Math. 51 (1950), pp. 161-166.
13. J.E. Hopcroft, and R.M. Karp, An n2.5 algorithm for maximum matching in bipartite graphs, SIAM J. Comput. 2(1973), 225-231.
14. H.V. Jagadish, "A Compression Technique to Materialize Transitive Closure," ACM Trans. Database Systems, Vol. 15, No. 4, 1990, pp. 558-598.
15. A.V. Karzanov, Determining the Maximal Flow in a Network by the Method of Preflow, Soviet Math. Dokl., Vol. 15, 1974, pp. 434-437.
16. T. Keller, G. Graefe and D. Maier, "Efficient Assembly of Complex Objects," Proc. ACM SIGMOD Conf. Denver, Colo., 1991, pp. 148-157.
17. W. Kim, "Object-Oriented Database Systems: Promises, Reality, and Future," Proc. 19th VLDB conf, Dublin, Ireland, 1993, pp. 676-687.
18. H.A. Kuno and E.A. Rundensteiner, "Incremental Maintenance of Materialized Object-Oriented Views in MultiView: Strategies and Performance Evaluation," IEEE Transactions on Knowledge and Data Engineering, vol. 10. No. 5,1998, pp. 768-792.
19. E.L. Lawler, Combinatorial Optimization and Matroids, Holt, Rinehart, and Winston, New York (1976).
20. K. Mehlhom, Graph Algorithms and NP-Completeness: Data Structure and Algorithm 2, Springer-Verlag, Berlin, 1984.
21. M. Stonebraker, L. Rowe and M. Hirohama, 'The Implementation of POSTGRES," IEEE Trans. Knowledge and Data Eng., vol. 2, no. 1, 1990, pp. 125-142.
22. R. Schenkel, A. Theobald, and G. Weikum, HOPI: an efficient connection index for complex XML document collections, in Proc. EDBT, 2004.
23. R. Schenkel, A. Theobald, and G. Weikum, Efficient creation and incrementation maintenance of HOPI index for complex xml document collection, in Proc. ICDE, 2006.
24. L.D. Shapiro, "Join Processing in Database Systems with Large Main Memories," ACAi Trans. Database Systems, vol. 11, no. 3, 1986, pp. 239-264.
25. R. Tarjan: Depth-first Search and Linear Graph Algorithms, SIAM J. Compt. Vol. 1, No. 2. June 1972, pp. 146 -140.
26. J. Teuhola, "Path Signatures: A Way to Speed up Recursion in Relational Databases," IEEE Trans. on Knowledge and Data Engineering, Vol. 8, No. 3, June 1996, pp. 446-454.
27. H.S. Warren, "A Modification of Warshall's Algorithm for the Transitive Closure of Binary Relations," Commun. ACM 18, 4 (April 1975), 218-220.
28. H. Wang, H. He, J. Yang, P.S. Yu, and J. X. Yu, Dual Labeling: Answering Graph Reachability Queries in Constant time, in Proc. of Int. Conf. on Data Engineering, Atlanta, USA, April -8 2006.
29. S. Warshall, "A Theorem on Boolean Matrices," JACM, 9. l(Jan. 1962), 11-12.
30. C. Zhang, J. Naughton, D. DeWitt, Q. Luo and G. Lohman, "On Supporting Containment Queries in Relational Database Management Systems, in Proc. of ACM SIGMOD Intl. Conf. on Management of Data, California, USA, 2001.
31. Y. Zibin and J. Gil, "Efficient Subtyping Tests with PQ-Encoding," Proc. of the 2001 ACM SIGPLAN Conf. on Object-Oriented Programming Systems, Languages and Application, Florida, October 14-18, 2001, pp. 96-107.