{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:58:03Z","timestamp":1743091083034,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319181196"},{"type":"electronic","value":"9783319181202"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-18120-2_1","type":"book-chapter","created":{"date-parts":[[2015,4,8]],"date-time":"2015-04-08T08:08:06Z","timestamp":1428480486000},"page":"3-20","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Leveraging Homomorphisms and Bitmaps to Enable the Mining of Embedded Patterns from Large Data Trees"],"prefix":"10.1007","author":[{"given":"Xiaoying","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dimitri","family":"Theodoratos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,4,9]]},"reference":[{"key":"1_CR1","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":"1_CR2","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-540-39644-4_6","volume-title":"Discovery Science","author":"T Asai","year":"2003","unstructured":"Asai, T., Arimura, H., Uno, T., Nakano, S.: Discovering frequent substructures in large unordered trees. In: Grieser, G., Tanaka, Y., Yamamoto, A. (eds.) DS 2003. LNCS (LNAI), vol. 2843, pp. 47\u201361. Springer, Heidelberg (2003)"},{"key":"1_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"},{"key":"1_CR4","unstructured":"Chi, Y., Muntz, R.R., Nijssen, S., Kok, J.N.: Frequent subtree mining - an overview. Fundam. Inform. 66(1\u20132) (2005)"},{"key":"1_CR5","doi-asserted-by":"crossref","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) (2005)","DOI":"10.1109\/TKDE.2005.30"},{"key":"1_CR6","doi-asserted-by":"crossref","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) (2005)","DOI":"10.1007\/s10115-004-0180-7"},{"key":"1_CR7","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":"1_CR8","unstructured":"Feng, Z., Hsu, W., Lee, M.-L.: Efficient pattern discovery for semistructured data. In: ICTAI (2005)"},{"key":"1_CR9","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"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: SIGMOD Conference (2000)","DOI":"10.1145\/342009.335372"},{"key":"1_CR11","unstructured":"Hido, S., Kawano, H.: Amiot: Induced ordered tree mining in tree-structured databases. In: ICDM (2005)"},{"issue":"2","key":"1_CR12","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":"1_CR13","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"},{"issue":"4","key":"1_CR14","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1145\/2536779","volume":"38","author":"B Mozafari","year":"2013","unstructured":"Mozafari, B., Zeng, K., D\u2019Antoni, L., Zaniolo, C.: High-performance complex event processing over hierarchical data. ACM Trans. Database Syst. 38(4), 21 (2013)","journal-title":"ACM Trans. Database Syst."},{"key":"1_CR15","unstructured":"Nijssen, S., Kok, J.N.: Efficient discovery of frequent unordered trees (2003)"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Nijssen, S., Kok, J.N.: A quickstart in frequent structure mining can make a difference. In: KDD (2004)","DOI":"10.1145\/1014052.1014134"},{"issue":"14","key":"1_CR17","first-page":"1738","volume":"6","author":"P Ogden","year":"2013","unstructured":"Ogden, P., Thomas, D.B., Pietzuch, P.: Scalable XML query processing using parallel pushdown transducers. PVLDB 6(14), 1738\u20131749 (2013)","journal-title":"PVLDB"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Tan, H., Hadzic, F., Dillon, T.S., Chang, E., Feng, L.: Tree model guided candidate generation for mining frequent subtrees from xml documents. TKDD 2(2) (2008)","DOI":"10.1145\/1376815.1376818"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Tatikonda, S., Parthasarathy, S., Kur\u00e7, T.M.: Trips and tides: new algorithms for tree mining. In: CIKM (2006)","DOI":"10.1145\/1183614.1183680"},{"key":"1_CR20","unstructured":"Termier, A., Rousset, M.-C., Sebag, M.: Treefinder: a first step towards xml data mining. In ICDM (2002)"},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"Termier, A., Rousset, M.-C., Sebag, M., Ohara, K., Washio, T., Motoda, H.: Dryadeparent, an efficient and robust closed attribute tree mining algorithm. IEEE Trans. Knowl. Data Eng. 20(3) (2008)","DOI":"10.1109\/TKDE.2007.190695"},{"key":"1_CR22","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/978-3-540-24775-3_54","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"C Wang","year":"2004","unstructured":"Wang, C., Hong, M., Pei, J., Zhou, H., Wang, W., Shi, B.-L.: Efficient pattern-growth methods for frequent tree pattern mining. In: Dai, H., Srikant, R., Zhang, C. (eds.) PAKDD 2004. LNCS (LNAI), vol. 3056, pp. 441\u2013451. Springer, Heidelberg (2004)"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Wang, K., Liu, H.: Discovering structural association of semistructured data. IEEE Trans. Knowl. Data Eng. 12(3) (2000)","DOI":"10.1109\/69.846290"},{"issue":"12","key":"1_CR24","doi-asserted-by":"publisher","first-page":"2244","DOI":"10.1109\/TKDE.2011.137","volume":"24","author":"X Wu","year":"2012","unstructured":"Wu, X., Souldatos, S., Theodoratos, D., Dalamagas, T., Vassiliou, Y., Sellis, T.K.: Processing and evaluating partial tree pattern queries on xml data. IEEE Trans. Knowl. Data Eng. 24(12), 2244\u20132259 (2012)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"1_CR25","doi-asserted-by":"crossref","unstructured":"Wu, X., Theodoratos, D., Kementsietsidis, A.: Configuring bitmap materialized views for optimizing xml queries. World Wide Web, pp. 1\u201326 (2014)","DOI":"10.1007\/s11280-013-0272-y"},{"key":"1_CR26","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":"1_CR27","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."},{"key":"1_CR28","unstructured":"Xiao, Y., Yao, J.-F., Li, Z., Dunham, M.H.: Efficient data mining for maximal frequent subtrees. In: ICDM (2003)"},{"key":"1_CR29","unstructured":"Zaki, M.J.: Efficiently mining frequent embedded unordered trees. Fundam. Inform. 66(1\u20132) (2005)"},{"key":"1_CR30","doi-asserted-by":"crossref","unstructured":"Zaki, M.J.: Efficiently mining frequent trees in a forest: Algorithms and applications. IEEE Trans. Knowl. Data Eng. 17(8) (2005)","DOI":"10.1109\/TKDE.2005.125"},{"key":"1_CR31","doi-asserted-by":"crossref","unstructured":"Zaki, M.J., Hsiao. C.-J.: Efficient algorithms for mining closed itemsets and their lattice structure. IEEE Trans. Knowl. Data Eng. 17(4) (2005)","DOI":"10.1109\/TKDE.2005.60"},{"key":"1_CR32","doi-asserted-by":"crossref","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) (2011)","DOI":"10.14778\/3402707.3402720"},{"key":"1_CR33","doi-asserted-by":"crossref","unstructured":"Zou, L., Lu, Y.S., Zhang, H., Hu, R.: PrefixTreeESpan: a pattern growth algorithm for mining embedded subtrees. In: WISE (2006)","DOI":"10.1007\/11912873_51"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-18120-2_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T11:26:20Z","timestamp":1674559580000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-18120-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319181196","9783319181202"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18120-2_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"9 April 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}