{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T03:12:24Z","timestamp":1725505944913},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540785675"},{"type":"electronic","value":"9783540785682"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78568-2_13","type":"book-chapter","created":{"date-parts":[[2008,4,1]],"date-time":"2008-04-01T17:55:41Z","timestamp":1207072541000},"page":"141-155","source":"Crossref","is-referenced-by-count":9,"title":["Summarization Graph Indexing: Beyond Frequent Structure-Based Approach"],"prefix":"10.1007","author":[{"given":"Lei","family":"Zou","sequence":"first","affiliation":[]},{"given":"Lei","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Huaming","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Yansheng","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Qiang","family":"Lou","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"unstructured":"Available at: http:\/\/amalfi.dis.unina.it\/graph","key":"13_CR1"},{"unstructured":"Berman, H.M., Westbrook, J., Feng, Z., Gilliland, G., Bhat, T.N., Weissig, H., Shindyalov, I.N., Bourne., P.E.: Frequent subtree mining - an overview. Nucleic Acids Research\u00a023(10) (2000)","key":"13_CR2"},{"key":"13_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","DOI":"10.1007\/11564126_44","volume-title":"Knowledge Discovery in Databases: PKDD 2005","author":"D. Cai","year":"2005","unstructured":"Cai, D., Shao, Z., He, X., Yan, X., Han, J.: Community mining from multi-relational networks. In: Jorge, A.M., Torgo, L., Brazdil, P.B., Camacho, R., Gama, J. (eds.) PKDD 2005. LNCS (LNAI), vol.\u00a03721, Springer, Heidelberg (2005)"},{"doi-asserted-by":"crossref","unstructured":"Cheng, J., Ke, Y., Ng, W., Lu, A.: fg-index: Towards verification-free query processing on graph databases. In: SIGMOD (2007)","key":"13_CR4","DOI":"10.1145\/1247480.1247574"},{"key":"13_CR5","volume-title":"Introduction to Algorithm","author":"T.H. Cormen","year":"2000","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithm, 2nd edn. MIT Press, Cambridge (2000)","edition":"2"},{"unstructured":"Huan, D.W.W.J., Wang, W.: Graph database indexing using structured graph decomposition. In: ICDE (2007)","key":"13_CR6"},{"unstructured":"Fortin, S.: The graph isomorphism problem. Department of Computing Science, University of Alberta (1996)","key":"13_CR7"},{"doi-asserted-by":"crossref","unstructured":"Jiang, P.Y.H., Wang, H., Zhou, S.: Gstring: A novel approach for efficient search in graph databases. In: ICDE (2007)","key":"13_CR8","DOI":"10.1109\/ICDE.2007.367902"},{"unstructured":"He, H., Singh, A.K.: Closure-tree: An index structure for graph queries. In: ICDE (2006)","key":"13_CR9"},{"key":"13_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45372-5_2","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"A. Inokuchi","year":"2000","unstructured":"Inokuchi, A., Washio, T., Motoda, H.: An apriori-based algorithm for mining frequent substructures from graph data. In: Zighed, A.D.A., Komorowski, J., \u017bytkow, J.M. (eds.) PKDD 2000. LNCS (LNAI), vol.\u00a01910, Springer, Heidelberg (2000)"},{"unstructured":"James, C.A., Weininger, D., Delany, J.: Daylight theory manual daylisght version 4.82. Daylight Chemical Information Systems, Inc. (2003)","key":"13_CR11"},{"doi-asserted-by":"crossref","unstructured":"Ke, Y., Cheng, J., Ng, W.: Correlation search in graph databases. In: SIGKDD (2007)","key":"13_CR12","DOI":"10.1145\/1281192.1281236"},{"doi-asserted-by":"crossref","unstructured":"Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: ICDM (2001)","key":"13_CR13","DOI":"10.1109\/ICDM.2001.989534"},{"doi-asserted-by":"crossref","unstructured":"Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: ICDM (2001)","key":"13_CR14","DOI":"10.1109\/ICDM.2001.989534"},{"doi-asserted-by":"crossref","unstructured":"Petrakis, E.G.M., Faloutsos, C.: Similarity searching in medical image databases. IEEE Transactions on Knowledge and Data Enginnering\u00a09(3) (1997)","key":"13_CR15","DOI":"10.1109\/69.599932"},{"doi-asserted-by":"crossref","unstructured":"Shasha, D., Wang, J.T.-L., Giugno, R.: Algorithmics and applications of tree and graph searching. In: PODS (2002)","key":"13_CR16","DOI":"10.1145\/543613.543620"},{"doi-asserted-by":"crossref","unstructured":"Tousidou, E., Bozanis, P., Manolopoulos, Y.: Signature-based structures for objects with set-valued attributes. Inf. Syst.\u00a027(2) (2002)","key":"13_CR17","DOI":"10.1016\/S0306-4379(01)00047-3"},{"doi-asserted-by":"crossref","unstructured":"Willett., P.: Chemical similarity searching. J. Chem. Inf. Comput. Sci.\u00a038(6) (1998)","key":"13_CR18","DOI":"10.1021\/ci9800211"},{"unstructured":"Yan, X., Han., J.: Gspan: Graph-based substructure pattern mining. In: Proc. of Int. Conf. on Data Mining (2002)","key":"13_CR19"},{"doi-asserted-by":"crossref","unstructured":"Yan, X., Yu, P.S., Han, J.: Graph indexing: A frequent structure-based approach. In: SIGMOD (2004)","key":"13_CR20","DOI":"10.1145\/1007568.1007607"},{"unstructured":"Zhang, N., \u00d6zsu, M.T., Ilyas, I.F., Aboulnaga, A.: Fix: Feature-based indexing technique for XML documents. In: VLDB (2006)","key":"13_CR21"},{"doi-asserted-by":"crossref","unstructured":"Zhang, S., Hu, M., Yang, J.: Treepi: A novel graph indexing method. In: ICDE (2007)","key":"13_CR22","DOI":"10.1109\/ICDE.2007.368955"},{"unstructured":"Zhao, P., Yu, J.X., Yu, P.S.: Graph Indexing: Tree + Delta >\u2009=Graph. In: VLDB (2007)","key":"13_CR23"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78568-2_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:13:13Z","timestamp":1619521993000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78568-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540785675","9783540785682"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78568-2_13","relation":{},"subject":[]}}