{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T17:40:21Z","timestamp":1740246021757,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642142451"},{"type":"electronic","value":"9783642142468"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14246-8_30","type":"book-chapter","created":{"date-parts":[[2010,7,6]],"date-time":"2010-07-06T14:09:26Z","timestamp":1278425366000},"page":"297-308","source":"Crossref","is-referenced-by-count":0,"title":["DSI: A Method for Indexing Large Graphs Using Distance Set"],"prefix":"10.1007","author":[{"given":"Yubo","family":"Kou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yukun","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaofeng","family":"Meng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. In: STOC 1971, pp. 151\u2013158 (1971)","DOI":"10.1145\/800157.805047"},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"Shasha, D., Wang, J.T.L., Giugno, R.: Algorithmics and Applications of Tree and Graph Searching. In: PODS 2002, pp. 39\u201352 (2002)","DOI":"10.1145\/543613.543620"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Kuramochi, M., Karypis, G.: Finding Frequent Patterns in a Large Sparse Graph. In: DMKD 2004, pp. 243\u2013271 (2004)","DOI":"10.1137\/1.9781611972740.32"},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"Fiedler, M., Borgelt, C.: Subgraph Support in a Single Large Graph. In: ICDM Workshops 2007, pp. 399\u2013404 (2007)","DOI":"10.1109\/ICDMW.2007.74"},{"key":"30_CR5","doi-asserted-by":"crossref","unstructured":"Yan, X., Yu, P.S., Han, J.: Graph indexing: A frequent structure-based approach. In: SIGMOD 2004, pp. 335\u2013346 (2004)","DOI":"10.1145\/1007568.1007607"},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"Yan, X., Yu, P.S., Han, J.: Substructure similarity search in graph databases. In: SIGMOD 2005, pp. 766\u2013777 (2005)","DOI":"10.1145\/1066157.1066244"},{"key":"30_CR7","unstructured":"He, H., Singh, A.K.: Closure-tree: An index structure for graph queries. In: ICDE 2006, p. 38 (2006)"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"Williams, D.W., Huan, J., Wang, W.: Graph Database Indexing Using Structured Graph Decomposition. In: ICDE 2007, pp. 976\u2013985 (2007)","DOI":"10.1109\/ICDE.2007.368956"},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"Jiang, H., Wang, H., Yu, P.S., Zhou, S.: GString: A Novel Approach for Efficient Search in Graph Databases. In: ICDE 2007, pp. 566\u2013575 (2007)","DOI":"10.1109\/ICDE.2007.367902"},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"Cheng, J., Ke, Y., Ng, W.: FG-Index: Towards Verification-Free Query Processing on Graph Databases. In: SIGMOD 2007, pp. 857\u2013872 (2007)","DOI":"10.1145\/1247480.1247574"},{"key":"30_CR11","unstructured":"Zhao, P., Yu, J.X., Yu, P.S.: Graph Indexing: Tree + Delta \u2265 Graph. In: VLDB 2007, pp. 938\u2013949 (2007)"},{"key":"30_CR12","unstructured":"Chen, C., Yan, X., Yu, P.S., Han, J., Zhang, D.-Q., Gu, X.: Towards graph containment search and indexing. In: VLDB 2007, pp. 926\u2013937 (2007)"},{"key":"30_CR13","doi-asserted-by":"crossref","unstructured":"Wang, C., Chen, L.: Continuous Subgraph Pattern Search over Graph Streams. In: ICDE 2009, pp. 393\u2013404 (2009)","DOI":"10.1109\/ICDE.2009.132"},{"key":"30_CR14","doi-asserted-by":"crossref","unstructured":"Tong, H., Gallagher, B., Faloutsos, C., E-Rad, T.: Fast Best-Effort Pattern Matching in Large Attributed Graphs. In: SIGKDD 2007, pp. 737\u2013746 (2007)","DOI":"10.1145\/1281192.1281271"},{"key":"30_CR15","doi-asserted-by":"crossref","unstructured":"He, H., Singh, A.K.: Graphs-at-a-time Query Language and Access Methods for Graph Databases. In: SIGMOD 2008, pp. 405\u2013418 (2008)","DOI":"10.1145\/1376616.1376660"},{"key":"30_CR16","doi-asserted-by":"crossref","unstructured":"Tian, Y., Patel, J.M.: Tale A tool for approximate large graph matching. In: ICDE 2008, pp. 963\u2013972 (2008)","DOI":"10.1109\/ICDE.2008.4497505"},{"key":"30_CR17","doi-asserted-by":"crossref","unstructured":"Zhang, S., Li, S., Yang, J.: GADDI Distance Index based Subgraph Matching in Biological Networks. In: EDBT 2008, pp. 192\u2013203 (2008)","DOI":"10.1145\/1516360.1516384"},{"key":"30_CR18","doi-asserted-by":"crossref","unstructured":"Zou, L., Chen, L., Lu, Y.: Top-K Subgraph Matching Query in A Large Graph. In: First PH.D. Workshop CIKM 2007, pp. 139\u2013146 (2007)","DOI":"10.1145\/1316874.1316897"},{"key":"30_CR19","doi-asserted-by":"crossref","unstructured":"Zou, L., Chen, L., Yu, J.X., Lu, Y.: A Novel Spectral Coding in a Large Graph Database. In: EDBT 2008: pp. 181\u2013192 (2008)","DOI":"10.1145\/1353343.1353369"},{"key":"30_CR20","unstructured":"DBLP Dataset, http:\/\/dblp.uni-trier.de\/xml\/"},{"key":"30_CR21","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)"}],"container-title":["Lecture Notes in Computer Science","Web-Age Information Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14246-8_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T17:20:58Z","timestamp":1740244858000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14246-8_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642142451","9783642142468"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14246-8_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}