A uniform framework for ad-hoc indexes to answer reachability queries on large graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5463, Issue , 2009, Pages 138-152

  Zhu, Linhong ^a   Choi, Byron ^b   He, Bingsheng ^c   Yu, Jeffrey Xu ^d   Ng, Wee Keong ^a  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^b HONG KONG BAPTIST UNIVERSITY   (Hong Kong)

^c MICROSOFT RESEARCH ASIA   (China)

^d CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS; GRAPHIC METHODS; HEURISTIC ALGORITHMS; INDEXING (OF INFORMATION);

BIOLOGICAL DATABASE; GRAPH FRAMEWORK; GRAPH INDEXING; INDEX SCHEMES; REACHABILITY QUERIES; RECENT RESEARCHES; STRUCTURED DATABASE; UNIFORM FRAMEWORK;

QUERY PROCESSING;

EID: 67650132675     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-00887-0_12     Document Type: Conference Paper

References (21)

1. W3C: OWL web ontology language overview, http://www.w3.org/TR/owl- features
2. Wu, X., Lee, M.L., Hsu, W.: A prime number labeling scheme for dynamic ordered xml trees. In: ICDE, pp. 66-78 (2004)
3. Dietz, P.F.:Maintaining order in a linked list. In: STOC, pp. 122-127 (1982)
4. Chen, L., Gupta, A., Kurul, M.E.: Efficient algorithms for pattern matching on directed acyclic graphs. In: ICDE, pp. 384-385 (2005)
5. Wu, G., Zhang, K., Liu, C., Li, J.: Adapting prime number labeling scheme for directed acyclic graphs. In: Li Lee, M., Tan, K.-L., Wuwongse, V. (eds.) DASFAA 2006. LNCS, vol. 3882, pp. 787-796. Springer, Heidelberg (2006) (Pubitemid 43978682)
6. Chen, L., Gupta, A., Kurul, M.E.: Stack-based algorithms for pattern matching on dags. In: VLDB, pp. 493-504 (2005) (Pubitemid 43991028)
7. Agrawal, R., Borgida, A., Jagadish, H.V.: Efficient management of transitive relationships in large data and knowledge bases. In: SIGMOD, pp. 253-262 (1989)
8. Jin, R., Xiang, Y., Ruan, N., Wang, H.: Efficiently answering reachability queries on very large directed graphs. In: SIGMOD, pp. 595-608 (2008)
9. Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and distance queries via 2-hop labels. SIAM J. Comput. 32(5), 1338-1355 (2003)
10. Schenkel, R., Theobald, A., Weikum, G.: Efficient creation and incremental maintenance of the hopi index for complex xml document collections. In: ICDE, pp. 360-371 (2005)
11. Wang, H., He, H., Yang, J., Yu, P.S., Yu, J.X.: Dual labeling: Answering graph reachability queries in constant time. In: ICDE, pp. 75-75 (2006)
12. Gibson, D., Kumar, R., Tomkins, A.: Discovering large dense subgraphs in massive graphs. In: VLDB, pp. 721-732 (2005) (Pubitemid 43991047)
13. Cheng, J., Yu, J.X., Lin, X., Wang, H., Yu, P.S.: Fast computation of reachability labeling for large graphs. In: Ioannidis, Y., Scholl, M.H., Schmidt, J.W., Matthes, F., Hatzopoulos, M., B̈ohm, K., Kemper, A., Grust, T., B̈ohm, C. (eds.) EDBT 2006. LNCS, vol. 3896, pp. 961-979. Springer, Heidelberg (2006) (Pubitemid 43986862)
14. Trißl, S., Leser, U.: Fast and practical indexing and querying of very large graphs. In: SIGMOD, pp. 845-856 (2007) (Pubitemid 47630858)
15. He, H.,Wang, H., Yang, J., Yu, P.S.: Compact reachability labeling for graph-structured data. In: CIKM (2005)
16. Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. The Bell system technical journal 49(1), 291-307 (1970)
17. Karypis lab: Family of Multilevel Partitioning Algorithms, http://glaros.dtc.umn.edu/gkhome/metis/metis/overview
18. Pothen, A., Simon, H.D., Liou, K.P.: Partitioning sparse matrices with eigenvectors of graphs. SIAM J. Matrix Anal. Appl. 11(3), 430-452 (1990)
19. Tarjan, R.E.: Depth-first search and linear graph algorithms. SIAMJ. Comput. 1(2), 146-160 (1972)
20. Schenkel, R., Theobald, A., Weikum, G.: Hopi: An efficient connection index for complex xml document collections. In: Bertino, E., Christodoulakis, S., Plexousakis, D., Christophides, V., Koubarakis, M., B̈ohm, K., Ferrari, E. (eds.) EDBT 2004. LNCS, vol. 2992, pp. 237-255. Springer, Heidelberg (2004)
21. Batagelj, V., Mrvar, A.: Pajek datasets, http://vlado.fmf.uni-lj.si/pub/ networks/data/