{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T08:28:35Z","timestamp":1758270515793,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642223501"},{"type":"electronic","value":"9783642223518"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22351-8_20","type":"book-chapter","created":{"date-parts":[[2011,7,18]],"date-time":"2011-07-18T13:46:41Z","timestamp":1310996801000},"page":"322-331","source":"Crossref","is-referenced-by-count":3,"title":["BR-Index: An Indexing Structure for Subgraph Matching in Very Large Dynamic Graphs"],"prefix":"10.1007","author":[{"given":"Jiong","family":"Yang","sequence":"first","affiliation":[]},{"given":"Wei","family":"Jin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Cheng, J., Ke, Y., Ng, W., Lu, A.: fg-index: Towards verification-free query processing on graph databases. In: Proc. of SIGMOD (2007)","DOI":"10.1145\/1247480.1247574"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Cordella, L., Foggia, P., Sansone, C., Vento, M.: A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs. In: PAMI (2004)","DOI":"10.1109\/TPAMI.2004.75"},{"key":"20_CR3","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-71681-5_1","volume-title":"Research in Computational Molecular Biology","author":"B. Dost","year":"2007","unstructured":"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.\u00a04453, pp. 1\u201315. Springer, Heidelberg (2007)"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Giugno, R., Shasha, D.: GraphGrep: A Fast and Universal Method for Querying Graphs. In: Proc. of ICPR (2002)","DOI":"10.1109\/ICPR.2002.1048250"},{"key":"20_CR5","unstructured":"He, H., Singh, A.K.: Closure-tree: an index structure for graph queries. In: Proc. of ICDE (2006)"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"He, H., Singh, A.K.: Graphs-at-a-time: Query Language and Access Methods for Graph Databases. In: Proc. of SIGMOD (2008)","DOI":"10.1145\/1376616.1376660"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Jiang, H., Wang, H., Yu, P., Zhou, S.: Gstring: A novel approach for efficient search in graph databases. In: Proc. of ICDE (2007)","DOI":"10.1109\/ICDE.2007.367902"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Shasha, D., Wang, J., Giugno, R.: Algorithmic and applications of tree and graph searching. In: PODS (2002)","DOI":"10.1145\/543613.543620"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Tian, Y., Patel, J.: TALE: A Tool for Approximate Large Graph Matching. In: Proc. of ICDE (2008)","DOI":"10.1109\/ICDE.2008.4497505"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Ullmann, J.: An algorithm for subgraph isomorphism. J. ACM (1976)","DOI":"10.1145\/321921.321925"},{"key":"20_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/11533719_45","volume-title":"Computing and Combinatorics","author":"F. Viger","year":"2005","unstructured":"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.\u00a03595, pp. 440\u2013449. Springer, Heidelberg (2005) www.cs.sunysb.edu\/\u00e3lgorith\/implement\/viger\/implement.shtml"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1145\/1516360.1516416"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Williams, D., Huan, J., Wang, W.: Graph database indexing using structured graph decomposition. In: Proc. of ICDE (2007)","DOI":"10.1109\/ICDE.2007.368956"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Xiao, Y., Wu, W., Pei, J., Wang, W., He, Z.: Efficiently indexing shortest paths by exploiting symmetry in graphs. In: Proc. of EDBT (2009)","DOI":"10.1145\/1516360.1516418"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"Yan, X., Yu, P., Han, J.: Graph indexing, a frequent structure-based approach. In: Proc. of SIGMOD (2004)","DOI":"10.1145\/1007568.1007607"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Yan, X., Yu, P., Han, J.: Substructure similarity search in graph databases. In: Proc. of SIGMOD (2005)","DOI":"10.1145\/1066157.1066244"},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"Zhang, S., Li, J., Gao, H., Zou, Z.: A Novel Approach for Efficient Supergraph Query Processing on Graph Databases. In: Proc. of EDBT (2009)","DOI":"10.1145\/1516360.1516385"},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"Zhang, S., Hu, M., Yang, J.: Treepi: a new graph indexing method. In: Proc. of ICDE (2007)","DOI":"10.1109\/ICDE.2007.368955"},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"Zhang, S., Li, S., Yang, J.: GADDI: Distance Index based Subgraph Matching in Biological Networks. In: Proc. of EDBT (2009)","DOI":"10.1145\/1516360.1516384"},{"key":"20_CR20","doi-asserted-by":"crossref","unstructured":"Zhang, S., Yang, J., Jin, W.: SAPPER: Subgraph Indexing and Approximate Matching in Large Graphs. In: Proc. of VLDB (2010)","DOI":"10.14778\/1920841.1920988"},{"key":"20_CR21","unstructured":"Zhao, P., Yu, J.X., Yu, P.S.: Graph indexing: Tree + delta \u2265 graph. In: Proc. of VLDB (2007)"}],"container-title":["Lecture Notes in Computer Science","Scientific and Statistical Database Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22351-8_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,12]],"date-time":"2019-06-12T22:32:32Z","timestamp":1560378752000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22351-8_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642223501","9783642223518"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22351-8_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}