{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,8]],"date-time":"2025-02-08T05:26:12Z","timestamp":1738992372176,"version":"3.37.0"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,2,12]],"date-time":"2009-02-12T00:00:00Z","timestamp":1234396800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2009,6]]},"DOI":"10.1007\/s10618-009-0126-5","type":"journal-article","created":{"date-parts":[[2009,2,11]],"date-time":"2009-02-11T18:41:39Z","timestamp":1234377699000},"page":"472-516","source":"Crossref","is-referenced-by-count":3,"title":["Incremental sequence-based frequent query pattern mining from XML queries"],"prefix":"10.1007","volume":"18","author":[{"given":"Guoliang","family":"Li","sequence":"first","affiliation":[]},{"given":"Jianhua","family":"Feng","sequence":"additional","affiliation":[]},{"given":"Jianyong","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Lizhu","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,2,12]]},"reference":[{"key":"126_CR1","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules in large databases. In: VLDB, pp 487\u2013499"},{"key":"126_CR2","doi-asserted-by":"crossref","unstructured":"Aggarwal C, Ta N, Wang J, Feng J, Zaki MJ (2007) Xproj: a framework for projected structural clustering of xml documents. In: KDD","DOI":"10.1145\/1281192.1281201"},{"key":"126_CR3","doi-asserted-by":"crossref","unstructured":"Asai T, Abe K, Kawasoe S, Arimura H, Sakamoto H, Arikawa S (2002) Efficient substructure discovery from large semi-structured data. In: SDM","DOI":"10.1137\/1.9781611972726.10"},{"issue":"1","key":"126_CR4","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1023\/A:1026482903537","volume":"12","author":"Y Aumann","year":"1999","unstructured":"Aumann Y, Feldman R, Liphstat O, Mannila H (1999) Borders: an efficient algorithm for association generation in dynamic databases. J Intell Inf Syst 12(1): 61\u201373","journal-title":"J Intell Inf Syst"},{"key":"126_CR5","doi-asserted-by":"crossref","unstructured":"Ayres J, Flannick J, Gehrke J, Yiu T (2002) Sequential pattern mining using a bitmap representation. In: KDD","DOI":"10.1145\/775107.775109"},{"key":"126_CR6","doi-asserted-by":"crossref","unstructured":"Balmin A, Ozcan F, Beyer K, Cochrane R, Pirahesh H (2004) A framework for using materialized xpath views in xml query processing. In: VLDB, pp 60\u201371","DOI":"10.1016\/B978-012088469-8.50009-7"},{"issue":"1","key":"126_CR7","first-page":"32","volume":"21","author":"C Bettini","year":"1998","unstructured":"Bettini C, Wang XS, Jajodia S (1998) Mining temporal relationships with multiple granularities in time sequences. IEEE Data Eng Bull 21(1): 32\u201338","journal-title":"IEEE Data Eng Bull"},{"key":"126_CR8","doi-asserted-by":"crossref","unstructured":"Chen L, Rundensteiner EA, Wang S (2002) Xcache: a semantic caching system for xml queries. In: SIGMOD","DOI":"10.1145\/564691.564771"},{"key":"126_CR9","unstructured":"Chen Y, Yang L, Wang YG (2004) Incremental mining of frequent xml query patterns. In: ICDM, pp 343\u2013346"},{"key":"126_CR10","doi-asserted-by":"crossref","unstructured":"Chung C-W, Min J-K, Shim K (2002) Apex: an adaptive path index for xml data. In: SIGMOD Conference, pp 121\u2013132","DOI":"10.1145\/564691.564706"},{"key":"126_CR11","unstructured":"Dehaspe L, Toivonen H, King R (1998) Finding frequent substructures in chemical compounds. In: KDD, pp 30\u201336"},{"key":"126_CR12","doi-asserted-by":"crossref","unstructured":"Feng J, Qian Q, Wang J, Zhou L (2006) Exploit sequencing to accelerate hot xml query pattern mining. In: ACM SAC","DOI":"10.1145\/1141277.1141400"},{"key":"126_CR13","doi-asserted-by":"crossref","unstructured":"Feng J, Ta N, Li G (2007) Exploit sequencing views in semantic cache to accelerate xpath query evaluation. In: WWW","DOI":"10.1145\/1242572.1242839"},{"key":"126_CR14","unstructured":"Han J, Dong G, Yin Y (1999) Efficient mining of partial periodic patterns in time series database. In: ICDE, pp 106\u2013115"},{"key":"126_CR15","doi-asserted-by":"crossref","unstructured":"Han J, Pei J, Mortazavi-Asl B, Chen Q, Dayal U, Hsu M (2000) Freespan: frequent pattern-projected sequential pattern mining. In: KDD, pp 355\u2013359","DOI":"10.1145\/347090.347167"},{"key":"126_CR16","unstructured":"Hristidis V, Petropoulos M (2002) Semantic caching of xml databases. In: WebDB"},{"key":"126_CR17","doi-asserted-by":"crossref","unstructured":"Kaushik R, Shenoy P, Bohannon P, Gudes E (2002) Exploiting local similarity for indexing paths in graph-structured data. In: ICDE, pp 129\u2013140","DOI":"10.1109\/ICDE.2002.994703"},{"key":"126_CR18","doi-asserted-by":"crossref","unstructured":"Kuramochi M, Karypis G (2001) Frequent subgraph discovery. In: ICDM, pp 313\u2013320","DOI":"10.1109\/ICDM.2001.989534"},{"key":"126_CR19","unstructured":"Kwon J, Rao P, Moon B, Lee S (2005) Fist: scalable xml document filtering by sequencing twig patterns. In: VLDB, pp 217\u2013228"},{"key":"126_CR20","doi-asserted-by":"crossref","unstructured":"Li G, Feng J, Ta N, Zhang Y, Zhou L (2006a) Scend: an efficient semantic cache to exploit xpath query\/view answerability. In: WISE, pp 460\u2013473","DOI":"10.1007\/11912873_48"},{"key":"126_CR21","doi-asserted-by":"crossref","unstructured":"Li G, Feng J, Wang J, Zhang Y, Zhou L (2006b) Incremental mining of frequent query patterns from xml queries for caching. In: ICDM, pp 350\u2013361","DOI":"10.1109\/ICDM.2006.88"},{"key":"126_CR22","doi-asserted-by":"crossref","unstructured":"Luo Q, Krishnamurthy S, Mohan C, Pirahesh H, Woo H, Lindsay BG, Naughton JF (2002) Middle-tier database caching for e-business. In: SIGMOD, pp 600\u2013611","DOI":"10.1145\/564691.564763"},{"key":"126_CR23","unstructured":"Mandhani B, Suciu D (2005) Query caching and view selection for xml databases. In: VLDB"},{"key":"126_CR24","doi-asserted-by":"crossref","unstructured":"Masseglia F, Cathala F, Poncelet P (1998) The psp approach for mining sequential patterns. In: PKDD","DOI":"10.1007\/BFb0094818"},{"key":"126_CR25","doi-asserted-by":"crossref","unstructured":"Milo T, Suciu D (1999) Index structures for path expressions. In: ICDT, pp 277\u2013295","DOI":"10.1007\/3-540-49257-7_18"},{"key":"126_CR26","doi-asserted-by":"crossref","unstructured":"Ozden B, Ramaswamy S, Silberschatz A (1998) Cyclic association rules. In: ICDE, pp 412\u2013421","DOI":"10.1109\/ICDE.1998.655804"},{"key":"126_CR27","unstructured":"Pei J, Han J, Mortazavi-Asl B, Pinto H, Chen Q, Dayal U, Hsu M (2001) Prefixspan: Mining sequential patterns by prefix-projected growth. In: ICDE, pp 215\u2013224"},{"key":"126_CR28","first-page":"142","volume":"27","author":"H Pr\u00fcfer","year":"1918","unstructured":"Pr\u00fcfer H (1918) Neuer beweis eines satzes uber permutationen. Archiv fur Mathematik und Physik 27: 142\u2013144","journal-title":"Archiv fur Mathematik und Physik"},{"key":"126_CR29","unstructured":"Qun C, Lim A, Ong KW (2003) D(k)-index: an adaptive structural summary for graph-structured data. In: SIGMOD, pp 134\u2013144"},{"key":"126_CR30","unstructured":"Rao PR, Moon B (2004) Prix: indexing and querying xml using prufer sequences. In: ICDE, pp 288\u2013299"},{"key":"126_CR31","unstructured":"Re C, Brinkley J, Hinshaw K, Suciu D (2004) Distributed xquery. In: Information integration on the web (IIWeb)"},{"key":"126_CR32","doi-asserted-by":"crossref","unstructured":"Srikant R, Agrawal R (1996) Mining sequential patterns: generalizations and performance improvements. In: EDBT, pp 3\u201317","DOI":"10.1007\/BFb0014140"},{"key":"126_CR33","doi-asserted-by":"crossref","unstructured":"Termier A, Rousset M-C, Sebag M (2002) Treefinder: a first step towards xml data mining. In: ICDM, pp 450\u2013457","DOI":"10.1109\/ICDM.2002.1183987"},{"key":"126_CR34","doi-asserted-by":"crossref","unstructured":"Wang J, Han J (2004) Bide: efficient mining of frequent closed sequences. In: ICDE, pp 79\u201390","DOI":"10.1109\/ICDE.2004.1319986"},{"issue":"2","key":"126_CR35","first-page":"353","volume":"12","author":"K Wang","year":"2000","unstructured":"Wang K, Liu H (2000) Discovering structural association of semistructured data. IEEE TKDE 12(2): 353\u2013371","journal-title":"IEEE TKDE"},{"key":"126_CR36","doi-asserted-by":"crossref","unstructured":"Wang H, Park S, Fan W, Yu PS (2003) Vist: a dynamic index method for querying xml data by tree structures. In: SIGMOD, pp 110\u2013121","DOI":"10.1145\/872757.872774"},{"key":"126_CR37","unstructured":"Xu W (2005) The framework of an xml semantic caching system. In: WebDB"},{"key":"126_CR38","doi-asserted-by":"crossref","unstructured":"Yan X, Han J, Afshar R (2003) Clospan: mining closed sequential patterns in large databases. In: SDM","DOI":"10.1137\/1.9781611972733.15"},{"key":"126_CR39","doi-asserted-by":"crossref","unstructured":"Yang J, Wang W, Yu PS, Han J (2002) Mining long sequential patterns in a noisy environment. In: SIGMOD, pp 406\u2013417","DOI":"10.1145\/564691.564738"},{"key":"126_CR40","doi-asserted-by":"crossref","unstructured":"Yang LH, Lee M-L, Hsu W (2003a) Efficient mining of xml query patterns for caching. In: VLDB, pp 69\u201380","DOI":"10.1016\/B978-012722442-8\/50015-X"},{"key":"126_CR41","doi-asserted-by":"crossref","unstructured":"Yang LH, Lee M-L, Hsu W, Acharya S (2003b) Mining frequent query patterns from xml queries. In: DASFAA, pp 355\u2013362","DOI":"10.1109\/DASFAA.2003.1192401"},{"key":"126_CR42","doi-asserted-by":"crossref","unstructured":"Yang LH, Lee ML, Hsu W, Guo X (2004) 2pxminer: an efficient two pass mining of frequent xml query patterns. In: KDD","DOI":"10.1145\/1014052.1014148"},{"key":"126_CR43","doi-asserted-by":"crossref","unstructured":"Zaki MJ (2002) Efficiently mining frequent trees in a forest. In: SIGKDD, pp 71\u201380","DOI":"10.1145\/775047.775058"},{"issue":"8","key":"126_CR44","first-page":"1021","volume":"17","author":"MJ Zaki","year":"2005","unstructured":"Zaki MJ (2005) Efficiently mining frequent trees in a forest: algorithms and applications. IEEE TKDE 17(8): 1021\u20131035","journal-title":"IEEE TKDE"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-009-0126-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-009-0126-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-009-0126-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,7]],"date-time":"2025-02-07T16:46:51Z","timestamp":1738946811000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-009-0126-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,2,12]]},"references-count":44,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,6]]}},"alternative-id":["126"],"URL":"https:\/\/doi.org\/10.1007\/s10618-009-0126-5","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"type":"print","value":"1384-5810"},{"type":"electronic","value":"1573-756X"}],"subject":[],"published":{"date-parts":[[2009,2,12]]}}}