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

SIGMOD-PODS'09 - Proceedings of the International Conference on Management of Data and 28th Symposium on Principles of Database Systems

Volumn , Issue , 2009, Pages 813-826

  Jin, Ruoming ^a   Xiang, Yang ^a   Ruan, Ning ^a   Fuhry, David ^a  

^a KENT STATE UNIVERSITY   (United States)

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;

ALGORITHMS; DATABASE SYSTEMS; ELECTRIC CONTROL EQUIPMENT; INDEXING (OF INFORMATION); WIRELESS TELECOMMUNICATION SYSTEMS;

GRAPH THEORY;

EID: 70849135701     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1559845.1559930     Document Type: Conference Paper

References (20)

1. 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.
2. Renzo Angles and Claudio Gutierrez. Survey of graph database models. ACM Comput. Surv., 40(1):1-39, 2008.
3. M.de Berg, M.van Kreveld, M.Overmars, and O.Schwarzkopf. Computational Geometry. Springer, 2000.
4. Li Chen, Amarnath Gupta, and M. Erdem Kurul. Stack-based algorithms for pattern matching on dags. In VLDB '05: Proceedings of the 31st international conference on Very large data bases, pages 493-504, 2005.
5. Yangjun Chen and Yibin Chen. An efficient algorithm for answering graph reachability queries. In ICDE, pages 893-902, 2008.
6. 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.
7. 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.
8. V. Chvá Greedy heuristic for the set-covering problem. Math. Oper. Res, 4:233-235, 1979.
9. Edith Cohen, Eran Halperin, Haim Kaplan, and Uri Zwick. Reachability and distance queries via 2-hop labels. In Proceedings of the 13th annual ACM-SIAM Symposium on Discrete algorithms, pages 937-946, 2002.
10. 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.
11. H. V. Jagadish. A compression technique to materialize transitive closure. ACM Trans. Database Syst., 15(4):558-598, 1990.
12. 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.
13. Richard Johnsonbaugh and Martin Kalin. A graph generation software package. In SIGCSE '91: Proceedings of the twenty-second SIGCSE technical symposium on Computer science education, pages 151-154, New York, NY, USA, 1991. ACM.
14. Guy Kortsarz and David Peleg. Generating sparse 2-spanners. In SWAT '92: Proceedings of the Third Scandinavian Workshop on Algorithm Theory, pages 73-82, 1992.
15. R. Schenkel, A. Theobald, and G. Weikum. HOPI: An efficient connection index for complex XML document collections. In EDBT, 2004.
16. K. Simon. An improved algorithm for transitive closure on acyclic digraphs. Theor. Comput. Sci., 58(1-3):325-346, 1988.
17. Yuanyuan Tian, Richard A. Hankins, and Jignesh M. Patel. Efficient aggregation for graph summarization. In SIGMOD Conference, 2008.
18. Silke Triß;ulf Leser. Fast and practical indexing and querying of very large graphs. In SIGMOD '07: Proceedings of the 2007 ACM SIGMOD international conference on Management of data, pages 845-856, 2007.
19. Haixun Wang, Hao He, Jun Yang, Philip S. Yu, and Jeffrey Xu Yu. Dual labeling: Answering graph reachability queries in constant time. In ICDE '06: Proceedings of the 22nd International Conference on Data Engineering (ICDE'06), page 75, 2006.
20. Xifeng Yan, Philip S. Yu, and Jiawei Han. Substructure similarity search in graph databases. In SIGMOD Conference, pages 766-777, 2005.