Graphs-at-a-time: Query language and access methods for graph databases

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2008, Pages 405-417

  He, Huahai ^a,b   Singh, Ambuj K ^a  

^a University of California   (United States)

^b GOOGLE INC   (United States)

Author keywords

Graph algebra; Graph query language; Query optimization

Indexed keywords

ACCESS METHODS; COMPOSITION OPERATORS; DO-MAINS; GRAPH ALGEBRA; GRAPH ALGEBRAS; GRAPH DATABASES; GRAPH QUERY LANGUAGE; LARGE GRAPHS; NP COMPLETENESSES; OF GRAPHS; ORDERS OF MAGNITUDES; QUERY OPTIMIZATION; RELATIONAL ALGEBRAS; SEARCH SPACES; SELECTION OPERATORS; SUBGRAPH ISOMORPHISMS; SUBGRAPHS;

ALGEBRA; CHEMICAL ANALYSIS; DATA STRUCTURES; DATABASE SYSTEMS; FORMAL LANGUAGES; LINGUISTICS; OPTIMIZATION; PATTERN MATCHING; SET THEORY;

QUERY LANGUAGES;

EID: 57149124877     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1376616.1376660     Document Type: Conference Paper

References (37)

1. S. Asthana et al. Predicting protein complex membership using probabilistic network reliability. Genome Research, May 2004.
2. S. Berretti, A. D. Bimbo, and E. Vicario. Efficient matching and indexing of graph models in content-based retrieval. In IEEE Trans, on Pattern Analysis and Machine Intelligence, volume 23, 2001.
3. S. Boag, D. Chamberlin, M. F. Fernández, D. Florescu, J. Robie, and J. Siḿeon. XQuery 1.0: An XML query language. W3C, http://www.w3.org/TR/xquery/, 2007.
4. C. Branden and J. Tooze. Introduction to protein structure. Garland, 2 edition, 1998.
5. S. Chaudhuri. An overview of query optimization in relational systems. In PODS, pages 34-43, 1998.
6. L. Chen, A. Gupta, and M. E. Kurul. Stack-based algorithms for pattern matching on dags. In Proc. of VLDB '05, pages 493-504, 2005.
7. J. Cheng, Y. Ke, W. Ng, and A. Lu. FG-Index: towards verification-free query processing on graph databases. In Proc. of SIGMOD '07, 2007.
8. J. Cheng, J. X. Yu, X. Lin, H. Wang, and P. S. Yu. Fast computation of reachability labeling for large graphs. In EDBT, pages 961-979, 2006.
9. E. Cohen, E. Halperin, H. Kaplan, and U. Zwick. Reachability and distance queries via 2-hop labels. SIAM J. Comput., 32(5):1338-1355, 2003.
10. M. P. Consens and A. O. Mendelzon. GraphLog: a visual formalism for real life recursion. In PODS, 1990.
11. P. Erdo″s and A. Ŕenyi. On random graphs I. Publ. Math. Debrecen, (6):290-297.
12. Gene Ontology, http://www.geneontology.org/.
13. R. H. Guting. GraphDB: Modeling and querying graphs in databases. In Proc. of VLDB'94, pages 297-308, 1994.
14. M. Gyssens, J. Paredaens, and D. van Gucht. A graph-oriented object database model. In Proc. of PODS '90, pages 417-424, 1990.
15. H. He and A. K. Singh. Closure-Tree: An Index Structure for Graph Queries. In Proc. of ICDE'06, Atlanta, 2006.
16. 5/2 algorithm for maximum matchings in bipartite graphs. SIAM J. Computing, 1973.
17. J. E. Hopcroft and J. D. Ullmnan, Introduction to Automata Theory, Languages, and Computation. Addison Wesley, 1979.
18. H. V. Jagadish, L. V. S, Lakshmanan, D. Srivastava, and K. Thompson. TAX: A tree algebra for XML. In Proc. of DBPL'01, 2001.
19. H. Jiang, H. Wang, P. S. Yu, and S. Zhou. GString: A novel approach for efficient search in graph databases. In ICDE, 2007.
20. J. Lee, J. Oh, and S. Hwang. STRG-Index: Spatio-temporal region graph indexing for large video databases. In Proc. of SIGMOD, 2005.
21. U. Leser. A query language for biological networks. Bioinformatics, 21:ii33-ii39, 2005.
22. F. Manola and E. Miller. RDF Primer. W3C, http://www.w3.org/TR/rdf- primer/, 2004.
23. E. Prud'hommeaux and A. Seaborne. SPARQL query language for RDF. W3C, http://www.w3.org/TR/rdf-sparql-query/, 2007.
24. R. Ramakrishnan and J. Gehrke. Database Management Systems, chapter 24 Deductive Databases. McGraw-Hill, third edition, 2003.
25. J. Rekers and A. Schurr. A graph grammar approach to graphical parsing. In 11th International IEEE Symposium on Visual Languages, 1995.
26. G. Rozenberg (Ed.). Handbook on Graph Grammars and Computing by Graph Transformation: Foundations, volume 1. World Scientific, 1997.
27. R. Schenkel, A. Theobald, and G. Weikum. Efficient creation and incremental maintenance of the HOPI index for complex XML document collections. In Proc. of ICDE '05, pages 360-371, 2005.
28. N. Shadbolt, T. Berners-Lee, and W. Hall. The semantic web revisited. IEEE Intelligent Systems, 21(3):96-101, 2006.
29. D. Shasha, J. T. L. Wang, and R. Giugno. Algorithmics and applications of tree and graph searching. In Proc. of PODS, 2002.
30. L. Sheng, Z. M. Ozsoyoglu, and G. Ozsoyoglu. A graph query language and its query processing. In ICDE, 1999.
31. Y. Tian, R. C. McEachin, C. Santos, D. J. States, and J. M. Patel. SAGA: a subgraph matching tool for biological graphs. Bioinformatics, 23(2), 2007.
32. S. Tril and U. Leser. Fast and practical indexing and querying of very large graphs. In Proc. of SIGMOD '07, pages 845-856, 2007.
33. H. Wrang, H. He, J. Yang, P. S. Yu, and J. X. Yu. Dual labeling: Answering graph reachability queries in constant time. In Proc. of ICDE '06, page 75, 2006.
34. D. W. Williams, J. Huan, and W. Wang. Graph database indexing using structured graph decomposition. In ICDE, 2007.
35. X. Yan, P. S. Yu, and J. Han. Graph Indexing: A frequent structure-based approach. In Proc. of SIGMOD, 2004.
36. S. Zhang, M. Hu, and J. Yang. TreePi: A novel graph indexing method. In ICDE, 2007.
37. P. Zhao, J. X. Yu, and P. S. Yu. Graph indexing: Tree + delta >= graph. In Proc. of VLDB, pages 938-949, 2007.