메뉴 건너뛰기




Volumn , Issue , 2009, Pages 813-826

3-HOP: A high-compression indexing scheme for reachability query

Author keywords

2 hop; 3 hop; Graph indexing; Path tree; Reachability queries; Transitive closure

Indexed keywords

BASIC IDEA; CHAIN STRUCTURE; DIRECTED ACYCLIC GRAPHS; DIRECTED GRAPHS; EFFICIENT ALGORITHM; EMPIRICAL STUDIES; GRAPH INDEXING; INDEXING SCHEME; QUERY TIME; REACHABILITY; REACHABILITY QUERIES; SPARSE GRAPHS; TRANSITIVE CLOSURE;

EID: 70849135701     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1559845.1559930     Document Type: Conference Paper
Times cited : (196)

References (20)
  • 1
    • 84976825239 scopus 로고
    • Efficient management of transitive relationships in large data and knowledge bases
    • R. Agrawal, A. Borgida, and H. V. Jagadish. Efficient management of transitive relationships in large data and knowledge bases. In SIGMOD, pages 253-262, 1989.
    • (1989) SIGMOD , pp. 253-262
    • Agrawal, R.1    Borgida, A.2    Jagadish, H.V.3
  • 2
    • 39849085497 scopus 로고    scopus 로고
    • Survey of graph database models
    • Renzo Angles and Claudio Gutierrez. Survey of graph database models. ACM Comput. Surv., 40(1):1-39, 2008.
    • (2008) ACM Comput. Surv. , vol.40 , Issue.1 , pp. 1-39
    • Angles, R.1    Gutierrez, C.2
  • 5
    • 52649167740 scopus 로고    scopus 로고
    • An efficient algorithm for answering graph reachability queries
    • Yangjun Chen and Yibin Chen. An efficient algorithm for answering graph reachability queries. In ICDE, pages 893-902, 2008.
    • (2008) ICDE , pp. 893-902
    • Chen, Y.1    Chen, Y.2
  • 6
    • 33745613502 scopus 로고    scopus 로고
    • Fast computation of reachability labeling for large graphs
    • Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin, Haixun Wang, and Philip S. Yu. Fast computation of reachability labeling for large graphs. In EDBT, pages 961-979, 2006.
    • (2006) EDBT , pp. 961-979
    • Cheng, J.1    Yu Jeffrey, X.2    Lin, X.3    Wang, H.4    Yu Philip, S.5
  • 7
    • 43349108490 scopus 로고    scopus 로고
    • Fast computing reachability labelings for large graphs with high compression rate
    • Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin, Haixun Wang, and Philip S. Yu. Fast computing reachability labelings for large graphs with high compression rate. In EDBT, pages 193-204, 2008.
    • (2008) EDBT , pp. 193-204
    • Cheng, J.1    Yu Jeffrey, X.2    Lin, X.3    Wang, H.4    Yu Philip, S.5
  • 8
    • 0000301097 scopus 로고
    • Greedy heuristic for the set-covering problem
    • V. Chvá Greedy heuristic for the set-covering problem. Math. Oper. Res, 4:233-235, 1979.
    • (1979) Math. Oper. Res , vol.4 , pp. 233-235
    • Chvá, V.1
  • 10
    • 0024610615 scopus 로고
    • A fast parametric maximum flow algorithm and applications
    • G. Gallo, M. D. Grigoriadis, and R. E. Tarjan. A fast parametric maximum flow algorithm and applications. SIAM J. Comput., 18(1):30-55, 1989.
    • (1989) SIAM J. Comput. , vol.18 , Issue.1 , pp. 30-55
    • Gallo, G.1    Grigoriadis, M.D.2    Tarjan, R.E.3
  • 11
    • 0025631041 scopus 로고
    • A compression technique to materialize transitive closure
    • H. V. Jagadish. A compression technique to materialize transitive closure. ACM Trans. Database Syst., 15(4):558-598, 1990.
    • (1990) ACM Trans. Database Syst. , vol.15 , Issue.4 , pp. 558-598
    • Jagadish, H.V.1
  • 12
    • 57149132520 scopus 로고    scopus 로고
    • Efficiently answering reachability queries on very large directed graphs
    • Ruoming Jin, Yang Xiang, Ning Ruan, and Haixun Wang. Efficiently answering reachability queries on very large directed graphs. In SIGMOD Conference, pages 595-608, 2008.
    • (2008) SIGMOD Conference , pp. 595-608
    • Jin, R.1    Xiang, Y.2    Ruan, N.3    Wang, H.4
  • 15
    • 21144445200 scopus 로고    scopus 로고
    • HOPI: An efficient connection index for complex XML document collections
    • R. Schenkel, A. Theobald, and G. Weikum. HOPI: An efficient connection index for complex XML document collections. In EDBT, 2004.
    • (2004) EDBT
    • Schenkel, R.1    Theobald, A.2    Weikum, G.3
  • 16
    • 0024019807 scopus 로고
    • An improved algorithm for transitive closure on acyclic digraphs
    • K. Simon. An improved algorithm for transitive closure on acyclic digraphs. Theor. Comput. Sci., 58(1-3):325-346, 1988.
    • (1988) Theor. Comput. Sci. , vol.58 , Issue.1-3 , pp. 325-346
    • Simon, K.1
  • 20
    • 29844431949 scopus 로고    scopus 로고
    • Substructure similarity search in graph databases
    • Xifeng Yan, Philip S. Yu, and Jiawei Han. Substructure similarity search in graph databases. In SIGMOD Conference, pages 766-777, 2005.
    • (2005) SIGMOD Conference , pp. 766-777
    • Yan, X.1    Yu Philip, S.2    Han, J.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.