Computing label-constraint reachability in graph databases

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2010, Pages 123-134

  Jin, Ruoming ^a   Hong, Hui ^a   Wang, Haixun ^b   Ruan, Ning ^a   Xiang, Yang ^a  

^a KENT STATE UNIVERSITY   (United States)

^b MICROSOFT RESEARCH ASIA   (China)

Author keywords

generalized transitive closure; hoeffding and bernstein bounds; label constraint reachability; maximal directed spanning tree

Indexed keywords

BIOLOGICAL NETWORKS; EDGE LABELS; EXPERIMENTAL EVALUATION; FUNDAMENTAL RESEARCH; GENERALIZED TRANSITIVE CLOSURE; GRAPH DATA; GRAPH DATABASE; LABELED GRAPHS; MAXIMAL DIRECTED SPANNING TREE; REACHABILITY; REACHABILITY QUERIES; REAL-WORLD GRAPHS; SAMPLING TECHNIQUE; SOCIAL NETWORKS; SPANNING TREE ALGORITHMS; SYNTHETIC DATASETS; TRANSITIVE CLOSURE; TREE-BASED;

AMBER; GRAPH THEORY; GRAPHIC METHODS; LABELS; PARALLEL ARCHITECTURES; SEMANTIC WEB;

TREES (MATHEMATICS);

AMBER; EVALUATION; EXPERIMENTATION; LABELS; MATHEMATICS; TREES;

EID: 77954721373     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1807167.1807183     Document Type: Conference Paper

References (25)

1. Serge Abiteboul and Victor Vianu. Regular path queries with constraints. In PODS, pages 122-133, 1997.
2. 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.
3. Ian Anderson. Combinatorics of Finite Sets. Clarendon Press, Oxford, 1987.
4. A. L. Barabasi and R. Albert. Emergence of scaling in random networks. Science, 286(5439):509-512, 1999.
5. M.de Berg, M.van Kreveld, M.Overmars, and O.Schwarzkopf. Computational Geometry. Springer, 2000.
6. Deepayan Chakrabarti, Yiping Zhan, and Christos Faloutsos. R-mat: A recursive model for graph mining. In Fourth SIAM International Conference on Data Mining, 2004.
7. Y. J. Chu and T. H. Liu. On the shortest arborescence of a directed graph. Science Sinica, 14:1396-1400, 1965.
8. Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. Introduction to Algorithms. McGraw Hill, 1990.
9. J. Edmonds. Optimum branchings. J. Research of the National Bureau of Standards, 71B:233-240, 1967.
10. Gang Gou and Rada Chirkova. Efficiently querying large xml data repositories: A survey. IEEE Trans. Knowl. Data Eng., 19(10):1381-1403, 2007.
11. V. Heidrich-Meisner and C. Igel. Hoeffding and bernstein races for selecting policies in evolutionary direct policy search. In ICML '09.
12. W. Hoeffding. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58(301):13-30, March 1963.
13. Thorsson V Ranish JA Christmas R Buhler J Eng JK Bumgarner R Goodlett DR Aebersold R Hood L. Ideker, T. Integrated genomic and proteomic analyses of a systematically perturbed metabolic network. In Science, pages 929-934, 2001.
14. R. Jin, H. Hong, H. Wang, N. Ruan, and Y. Xiang. Computing label-constraint reachability in graph databases. Technical Report TR-KSU-CS-2010-1, Computer Science, Kent State University, March 2010.
15. R. Jin, Y. Xiang, N. Ruan, and D. Fuhry. 3-hop: a high-compression indexing scheme for reachability query. SIGMOD, 2009.
16. R. Jin, Y. Xiang, N. Ruan, and H. Wang. Efficiently answering reachability queries on very large directed graphs. In SIGMOD Conference, pages 595-608, 2008.
17. Richard Johnsonbaugh and Martin Kalin. A graph generation software package. In SIGCSE, pages 151-154, 1991.
18. Rinaldi N.J. Robert F. Odom D.T. Bar-Joseph Z. Gerber G.K. Hannett N.M. Harbison C.R. Thompson C.M. Simon I. Zeitlinger J. Jennings E.G. Murray H.L. Gordon D.B. Ren B. Wyrick J.J. Tagne J. Volkert T.L. Fraenkel E. Gifford D.K. Lee, T.I. and R.A. Young. Transcriptional regulatory networks in saccharomyces cerevisiae. In Science, pages 799-804, 2002. (Pubitemid 35231527)
19. Jure Leskovec, Ajit Singh, and Jon M. Kleinberg. Patterns of influence in a recommendation network. In PAKDD '06.
20. Alberto O. Mendelzon and Peter T. Wood. Finding regular simple paths in graph databases. SIAM J. Comput., 24(6), 1995.
21. Tova Milo and Dan Suciu. Index structures for path expressions. In ICDT, pages 277-295, 1999.
22. Volodymyr Mnih, Csaba Szepesvári, and Jean-Yves Audibert. Empirical bernstein stopping. In ICML '08.
23. M. E. J. Newman. Power laws, pareto distributions and zipf's law. Contemporary Physics, 46:323, 2005.
24. Fabian M. Suchanek, Gjergji Kasneci, and Gerhard Weikum. Yago: a core of semantic knowledge. In WWW, pages 697-706, 2007.
25. 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.