{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T03:25:37Z","timestamp":1725852337747},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319320243"},{"type":"electronic","value":"9783319320250"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-32025-0_12","type":"book-chapter","created":{"date-parts":[[2016,3,24]],"date-time":"2016-03-24T08:47:38Z","timestamp":1458809258000},"page":"180-196","source":"Crossref","is-referenced-by-count":2,"title":["Efficiently Mining Homomorphic Patterns from Large Data Trees"],"prefix":"10.1007","author":[{"given":"Xiaoying","family":"Wu","sequence":"first","affiliation":[]},{"given":"Dimitri","family":"Theodoratos","sequence":"additional","affiliation":[]},{"given":"Zhiyong","family":"Peng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,3,25]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Amer-Yahia, S., Cho, S., Lakshmanan, L.V.S., Srivastava, D.: Minimization of tree pattern queries. In: SIGMOD Conference (2001)","DOI":"10.1145\/375663.375730"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Asai, T., Abe, K., Kawasoe, S., Arimura, H., Sakamoto, H., Arikawa, S.: Efficient substructure discovery from large semi-structured data. In: SDM (2002)","DOI":"10.1137\/1.9781611972726.10"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Bruno, N., Koudas, N., Srivastava, D.: Holistic twig joins: optimal XML pattern matching. In: SIGMOD (2002)","DOI":"10.1145\/564691.564727"},{"issue":"2","key":"12_CR4","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1109\/TKDE.2005.30","volume":"17","author":"Y Chi","year":"2005","unstructured":"Chi, Y., Xia, Y., Yang, Y., Muntz, R.R.: Mining closed and maximal frequent subtrees from databases of labeled rooted trees. IEEE Trans. Knowl. Data Eng. 17(2), 190\u2013202 (2005)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"2","key":"12_CR5","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s10115-004-0180-7","volume":"8","author":"Y Chi","year":"2005","unstructured":"Chi, Y., Yang, Y., Muntz, R.R.: Canonical forms for labelled trees and their applications in frequent subtree mining. Knowl. Inf. Syst. 8(2), 203\u2013234 (2005)","journal-title":"Knowl. Inf. Syst."},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Dries, A., Nijssen, S.: Mining patterns in networks using homomorphism. In: SDM (2012)","DOI":"10.1137\/1.9781611972825.23"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Goethals, B., Hoekx, E., den Bussche, J.V.: Mining tree queries in a graph. In: KDD (2005)","DOI":"10.1145\/1081870.1081881"},{"issue":"2","key":"12_CR8","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1137\/S0097539791218202","volume":"24","author":"P Kilpel\u00e4inen","year":"1995","unstructured":"Kilpel\u00e4inen, P., Mannila, H.: Ordered and unordered tree inclusion. SIAM J. Comput. 24(2), 340\u2013356 (1995)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"12_CR9","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/962446.962448","volume":"51","author":"G Miklau","year":"2004","unstructured":"Miklau, G., Suciu, D.: Containment and equivalence for a fragment of xpath. J. ACM 51(1), 2\u201345 (2004)","journal-title":"J. ACM"},{"key":"12_CR10","unstructured":"Termier, A., Rousset, M.-C., Sebag, M.: TreeFinder: a first step towards XML data mining. In: ICDM (2002)"},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/978-3-319-28194-0","volume-title":"Database Systems for Advanced Applications","author":"X Wu","year":"2015","unstructured":"Wu, X., Theodoratos, D.: Leveraging homomorphisms and bitmaps to enable the mining of embedded patterns from large data trees. In: Renz, M., Shahabi, C., Zhou, X., Cheema, M.A. (eds.) DASFAA 2015. LNCS, vol. 9049, pp. 3\u201320. Springer, Heidelberg (2015)"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Wu, X., Theodoratos, D., Wang, W.H.: Answering XML queries using materialized views revisited. In: CIKM (2009)","DOI":"10.1145\/1645953.1646015"},{"issue":"6","key":"12_CR13","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1016\/j.is.2013.02.003","volume":"38","author":"X Wu","year":"2013","unstructured":"Wu, X., Theodoratos, D., Wang, W.H., Sellis, T.: Optimizing XML queries: bitmapped materialized views vs. indexes. Inf. Syst. 38(6), 863\u2013884 (2013)","journal-title":"Inf. Syst."},{"issue":"1\u20132","key":"12_CR14","first-page":"33","volume":"66","author":"MJ Zaki","year":"2005","unstructured":"Zaki, M.J.: Efficiently mining frequent embedded unordered trees. Fundam. Inform. 66(1\u20132), 33\u201352 (2005)","journal-title":"Fundam. Inform."},{"issue":"8","key":"12_CR15","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1109\/TKDE.2005.125","volume":"17","author":"MJ Zaki","year":"2005","unstructured":"Zaki, M.J.: Efficiently mining frequent trees in a forest: algorithms and applications. IEEE Trans. Knowl. Data Eng. 17(8), 1021\u20131035 (2005)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"11","key":"12_CR16","first-page":"807","volume":"4","author":"F Zhu","year":"2011","unstructured":"Zhu, F., Qu, Q., Lo, D., Yan, X., Han, J., Yu, P.S.: Mining top-k large structural patterns in a massive network. PVLDB 4(11), 807\u2013818 (2011)","journal-title":"PVLDB"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Zhu, F., Yan, X., Han, J., Yu, P.S., Cheng, H.: Mining colossal frequent patterns by core pattern fusion. In: ICDE, pp. 706\u2013715 (2007)","DOI":"10.1109\/ICDE.2007.367916"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-32025-0_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T17:49:08Z","timestamp":1559411348000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-32025-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319320243","9783319320250"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-32025-0_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}