Abstract
Subgraph indexing, i.e., finding all occurrences of a query graph Q in a very large connected database graph G, becomes an important research problem with great practical implications. To the best of our knowledge, most of subgraph indexing methods focus on the static database graphs. However, in many real applications, database graphs change over time. In this paper, we propose an indexing structure, BR-index, for large dynamic graphs. The large database graph is partitioned into a set of overlapping index regions. Features (small subgraphs) are extracted from these regions and used to index them. The updates to G can be localized to a small number of these regions. To further improve the efficiency in updates and query processing, several novel techniques and data structures are invented, which include feature lattice, maximal features, and overlapping regions. Experiments show that the BR-index outperforms alternatives in queries and updates.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cheng, J., Ke, Y., Ng, W., Lu, A.: fg-index: Towards verification-free query processing on graph databases. In: Proc. of SIGMOD (2007)
Cordella, L., Foggia, P., Sansone, C., Vento, M.: A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs. In: PAMI (2004)
Dost, B., Shlomi, T., Gupta, N., Ruppin, E., Bafna, V., Sharan, R.: QNet: A tool for querying protein interaction networks. In: Speed, T., Huang, H. (eds.) RECOMB 2007. LNCS (LNBI), vol. 4453, pp. 1–15. Springer, Heidelberg (2007)
Giugno, R., Shasha, D.: GraphGrep: A Fast and Universal Method for Querying Graphs. In: Proc. of ICPR (2002)
He, H., Singh, A.K.: Closure-tree: an index structure for graph queries. In: Proc. of ICDE (2006)
He, H., Singh, A.K.: Graphs-at-a-time: Query Language and Access Methods for Graph Databases. In: Proc. of SIGMOD (2008)
Jiang, H., Wang, H., Yu, P., Zhou, S.: Gstring: A novel approach for efficient search in graph databases. In: Proc. of ICDE (2007)
Shasha, D., Wang, J., Giugno, R.: Algorithmic and applications of tree and graph searching. In: PODS (2002)
Tian, Y., Patel, J.: TALE: A Tool for Approximate Large Graph Matching. In: Proc. of ICDE (2008)
Ullmann, J.: An algorithm for subgraph isomorphism. J. ACM (1976)
Viger, F., Latapy, M.: Efficient and simple generation of random simple connected graphs with prescribed degree sequence. In: Wang, L. (ed.) COCOON 2005. LNCS, vol. 3595, pp. 440–449. Springer, Heidelberg (2005) www.cs.sunysb.edu/ãlgorith/implement/viger/implement.shtml
Wang, X., Smalter, A., Huan, J., Lushington, G.: G-Hash: Towards Fast Kernel-based Similarity Search in Large Graph Databases. In: Proc. of EDBT (2009)
Williams, D., Huan, J., Wang, W.: Graph database indexing using structured graph decomposition. In: Proc. of ICDE (2007)
Xiao, Y., Wu, W., Pei, J., Wang, W., He, Z.: Efficiently indexing shortest paths by exploiting symmetry in graphs. In: Proc. of EDBT (2009)
Yan, X., Yu, P., Han, J.: Graph indexing, a frequent structure-based approach. In: Proc. of SIGMOD (2004)
Yan, X., Yu, P., Han, J.: Substructure similarity search in graph databases. In: Proc. of SIGMOD (2005)
Zhang, S., Li, J., Gao, H., Zou, Z.: A Novel Approach for Efficient Supergraph Query Processing on Graph Databases. In: Proc. of EDBT (2009)
Zhang, S., Hu, M., Yang, J.: Treepi: a new graph indexing method. In: Proc. of ICDE (2007)
Zhang, S., Li, S., Yang, J.: GADDI: Distance Index based Subgraph Matching in Biological Networks. In: Proc. of EDBT (2009)
Zhang, S., Yang, J., Jin, W.: SAPPER: Subgraph Indexing and Approximate Matching in Large Graphs. In: Proc. of VLDB (2010)
Zhao, P., Yu, J.X., Yu, P.S.: Graph indexing: Tree + delta ≥ graph. In: Proc. of VLDB (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yang, J., Jin, W. (2011). BR-Index: An Indexing Structure for Subgraph Matching in Very Large Dynamic Graphs. In: Bayard Cushing, J., French, J., Bowers, S. (eds) Scientific and Statistical Database Management. SSDBM 2011. Lecture Notes in Computer Science, vol 6809. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22351-8_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-22351-8_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22350-1
Online ISBN: 978-3-642-22351-8
eBook Packages: Computer ScienceComputer Science (R0)