{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T14:07:44Z","timestamp":1673446064640},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2004,12,1]],"date-time":"2004-12-01T00:00:00Z","timestamp":1101859200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["VLDB"],"published-print":{"date-parts":[[2004,12]]},"DOI":"10.1007\/s00778-004-0134-4","type":"journal-article","created":{"date-parts":[[2004,9,14]],"date-time":"2004-09-14T17:18:29Z","timestamp":1095182309000},"page":"318-332","source":"Crossref","is-referenced-by-count":20,"title":["Finding hot query patterns over an XQuery stream"],"prefix":"10.1007","volume":"13","author":[{"given":"Liang Huai","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mong Li","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wynne","family":"Hsu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1007\/s00778-003-0095-z","volume":"12","author":"Abadi","year":"2003","unstructured":"Abadi DJ, Carney D, Cetintemel U, Cherniack M, Convey C, Lee S, Stonebraker M, Tatbul N, Zdonik S (2003) Aurora: a new model and architecture for data stream management. VLDB J 12(2):120-139","journal-title":"VLDB J"},{"key":"CR2","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In: VLDB, pp 487-499"},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"Arasu A, Babcock B, Babu S, McAlister J, Widom J (2002) Characterizing memory requirements for queries over continuous data streams. In: ACM PODS, pp 221-232","DOI":"10.1145\/543613.543642"},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"Asai T, Arimura H(2002) Online algorithms for mining semi-structured data stream. In: ICDM, pp 27-34","DOI":"10.1109\/ICDM.2002.1183882"},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"Asai T, Abe K, Kawasoe S(2002) Efficient substructure discovery from large semi-structured data. In: 2nd SIAM international conference on data mining","DOI":"10.1137\/1.9781611972726.10"},{"key":"CR6","unstructured":"Babcock B, Datar M, Motwani R (2002) Sampling from a moving window over streaming data. In: SODA, pp 633-634"},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"Babcock B, Babu S, Datar M, Motwani R (2003) Chain: operator scheduling for memory minimization in data stream systems. In: ACM SIGMOD, pp 253-264","DOI":"10.1145\/872757.872789"},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"Carney D, Cetintemel U, Rasin A, Zdonik SB, Cherniack M, Stonebraker M (2003) Operator scheduling in a data stream manager. In: VLDB, pp 838-849","DOI":"10.1016\/B978-012722442-8\/50079-3"},{"key":"CR9","doi-asserted-by":"crossref","unstructured":"Chandrasekaran S, Cooper O, Deshpande A, Franklin MJ, Hellerstein JM, Hong W, Krishnamurthy S, Madden S, Raman V, Reiss F, Shah MA (2003) Telegraphcq: continuous dataflow processing for an uncertain world. In: CIDR","DOI":"10.1145\/872757.872857"},{"key":"CR10","doi-asserted-by":"crossref","unstructured":"Charikar M, Chen K, Colton MF (2002) Finding frequent items in data streams. In: 29th international colloquium on automata, languages and programming, pp 693-703","DOI":"10.1007\/3-540-45465-9_59"},{"key":"CR11","unstructured":"Chen L, Rundensteiner EA, Wang S (2002) Xcache - a semantic caching system for XML queries. In: ACM SIGMOD, pp 618"},{"key":"CR12","doi-asserted-by":"crossref","unstructured":"Cormode G, Datar M, Indyk P, Muthukrishnan S (2002) Comparing data streams using hamming norms (how to zero in). In: VLDB, pp 335-345","DOI":"10.1016\/B978-155860869-6\/50037-8"},{"key":"CR13","doi-asserted-by":"crossref","unstructured":"Cranor C, Johnson T, Spataschek O, Shkapenyuk V (2003) Gigascope: a stream database for network applications. In: ACM SIGMOD","DOI":"10.1145\/872757.872838"},{"key":"CR14","doi-asserted-by":"crossref","unstructured":"Das A, Gehrke J, Riedewald M (2003) Approximate join processing over data streams. In: ACM SIGMOD, pp 40-51","DOI":"10.1145\/872757.872765"},{"key":"CR15","doi-asserted-by":"crossref","unstructured":"Datar M, Gionis A, Indyk P, Motwani R (2002) Maintaining stream statistics over sliding windows. In: SODA, pp 635-644","DOI":"10.1137\/S0097539701398363"},{"key":"CR16","doi-asserted-by":"crossref","unstructured":"Dobra A, Garofalakis M, Gehrke J, Rastogi R (2002) Processing complex aggregate queries over data streams. In: ACM SIGMOD, pp 61-72","DOI":"10.1145\/564691.564699"},{"key":"CR17","doi-asserted-by":"crossref","unstructured":"Domingos P, Hulten G (2000) Mining high-speed data streams. In: ACM SIGKDD, pp 71-80","DOI":"10.1145\/347090.347107"},{"key":"CR18","doi-asserted-by":"crossref","unstructured":"Ganguly S, Garofalakis M, Rastogi R (2003) Processing set expressions over continuous update streams. In: ACM SIGMOD, pp 265-276","DOI":"10.1145\/872757.872790"},{"key":"CR19","doi-asserted-by":"crossref","unstructured":"Gibbons PB, Matias Y (1998) New sampling-based summary statistics for improving approximate query answers. In: ACM SIGMOD, pp 331-342","DOI":"10.1145\/276304.276334"},{"key":"CR20","first-page":"Special","volume":"Science","author":"Gibbons","year":"1999","unstructured":"Gibbons PB, Matias Y (1999) Synopsis data structures for massive data sets. DIMACS Series in Discrete Mathematics and Theoretical Computer Science: Special Issue on External Memory Algorithms and Visualization, pp 39-70","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer"},{"key":"CR21","unstructured":"Gilbert AC, Kotidis Y, Muthukrishnan S, Strauss M (2001) Surfing wavelets on streams: one-pass summaries for approximate aggregate queries. In: VLDB, pp 79-88"},{"key":"CR22","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1109\/TKDE.2003.1198387","volume":"15","author":"Guha","year":"2003","unstructured":"Guha S, Meyerson A, Mishra N, Motwani R, O?Callaghan L (2003) Clustering data streams: theory and practice. IEEE Trans Knowl Data Eng 15(3):515--528","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"CR23","doi-asserted-by":"crossref","unstructured":"Hidber C (1999) Online association rule mining. In: ACM SIGMOD, pp 145--156","DOI":"10.1145\/304182.304195"},{"key":"CR24","doi-asserted-by":"crossref","unstructured":"Hulten G, Spencer L, Domingos P (2001) Mining time-changing data streams. In: ACM SIGKDD, pp 97-106","DOI":"10.1145\/502512.502529"},{"key":"CR25","unstructured":"Luccio F, Enriquez AM, Rieumont PO, Pagli L (2001) Exact rooted subtree matching in sublinear time. Technical report, University of Pisa, Italy. ftp:\/\/ftp.di.unipi.it\/pub\/techreports\/TR-01-14.ps.Z"},{"key":"CR26","doi-asserted-by":"crossref","unstructured":"Madden S, Shah M, Hellerstein JM, Raman V (2002) Continuously adaptive continuous queries over streams. In: ACM SIGMOD, pp 49-60","DOI":"10.1145\/564691.564698"},{"key":"CR27","doi-asserted-by":"crossref","unstructured":"Manku GS, Motwani R (2002) Approximate frequency counts over data streams. In: VLDB, pp 346-357","DOI":"10.1016\/B978-155860869-6\/50038-X"},{"key":"CR28","first-page":"400","volume":"3","author":"Mazlack","year":"2001","unstructured":"Mazlack L (2001) Granulation of quantitative association rules. Int J Fuzzy Sys 3(3):400-408","journal-title":"Int J Fuzzy Sys"},{"key":"CR29","doi-asserted-by":"crossref","unstructured":"Miklau G, Suciu D (2002) Containment and equivalence for an XPath fragment. In: ACM PODS, pp 65-76","DOI":"10.1145\/543613.543623"},{"key":"CR30","unstructured":"Motwani R, Widom J, Arasu A, Babcock B, Babu S, Datar M, Manku G, Olston C, Rosenstein J, Varma R (2003) Query processing, resource management, and approximation in a data stream management system. In: CIDR"},{"key":"CR31","first-page":"27","volume":"24","author":"Naughton","year":"2001","unstructured":"Naughton JF, DeWitt DJ, Maier D(2001) The Niagara Internet query system. IEEE Data Eng Bull 24(2):27-33","journal-title":"IEEE Data Eng Bull"},{"key":"CR32","doi-asserted-by":"crossref","unstructured":"Neven F, Schwentick T (2003) XPath containment in the presence of disjunction, DTDs, and variables. In: ICDT, pp 330-345","DOI":"10.1007\/3-540-36285-1_21"},{"key":"CR33","doi-asserted-by":"crossref","unstructured":"Papadimitriou S, Brockwell A, Faloutsos C (2003) Adaptive, hands-off stream mining. In: VLDB, pp 560-571","DOI":"10.1016\/B978-012722442-8\/50056-2"},{"key":"CR34","unstructured":"Savasere A, Omiecinski E, Navathe SB (1995) An efficient algorithm for mining association rules in large databases. In: VLDB, pp 432-444"},{"key":"CR35","doi-asserted-by":"crossref","unstructured":"Schwentick T (2004) XPath query containment. In: ACM SIGMOD Record 33(1):101-109","DOI":"10.1145\/974121.974140"},{"key":"CR36","doi-asserted-by":"crossref","unstructured":"Shasha D, Wang JTL, Giugno R (2002) Algorithmics and applications of tree and graph searching. In: ACM PODS, pp 39-52","DOI":"10.1145\/543613.543620"},{"key":"CR37","doi-asserted-by":"crossref","unstructured":"Srikant R, Agrawal R (1996) Mining quantitative association rules in large relatioal tables. In: ACM SIGMOD, pp 1-12","DOI":"10.1145\/235968.233311"},{"key":"CR38","doi-asserted-by":"crossref","unstructured":"Tatbul N, Cetintemel U, Zdonik SB, Cherniack M, Stonebraker M (2003) Load shedding in a data stream manager. In: VLDB","DOI":"10.1016\/B978-012722442-8\/50035-5"},{"key":"CR39","doi-asserted-by":"crossref","unstructured":"Termier A, Rousset MC, Sebag M (2002) TreeFinder: a first step towards XML data mining. In: IEEE ICDM","DOI":"10.1109\/ICDM.2002.1183987"},{"key":"CR40","unstructured":"Toivonen H (1996) Sampling large database for association rules. In: VLDB, pp 134-145"},{"key":"CR41","first-page":"353","volume":"12","author":"Wang","year":"2000","unstructured":"Wang K, Liu H (2000) Discovering structural association of semistructured data. IEEE TKDE 12(3):353-371","journal-title":"IEEE TKDE"},{"key":"CR42","doi-asserted-by":"crossref","unstructured":"Wang H, Fan W, Yu PS, Han J (2003) Mining concept-drifting data streams using ensemble classifiers. In: ACM SIGKDD, pp 226-235","DOI":"10.1145\/956750.956778"},{"key":"CR43","doi-asserted-by":"crossref","unstructured":"Wood P (2003) Containment for XPath fragments under DTD constraints. In: ICDT, pp 300-314","DOI":"10.1007\/3-540-36285-1_20"},{"key":"CR44","unstructured":"XML Path Language (XPath). http:\/\/www.w3.org\/TR\/xpath"},{"key":"CR45","unstructured":"Yang LH, Lee ML, Hsu W (2003) Mining frequent query patterns in XML. In: DASFAA, pp 355-362"},{"key":"CR46","doi-asserted-by":"crossref","unstructured":"Yang LH, Lee ML, Hsu W (2003) Efficient mining of frequent query patterns for caching. In: VLDB","DOI":"10.1016\/B978-012722442-8\/50015-X"},{"key":"CR47","doi-asserted-by":"crossref","unstructured":"Zaki M (2002) Efficiently mining frequent trees in a forest. In: ACM SIGKDD","DOI":"10.1145\/775047.775058"},{"key":"CR48","doi-asserted-by":"crossref","unstructured":"Zhu Y, Shasha D (2003) Efficient elastic burst detection in data streams. In: ACM SIGKDD, pp 336-345","DOI":"10.1145\/956750.956789"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-004-0134-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-004-0134-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-004-0134-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,25]],"date-time":"2021-06-25T17:38:33Z","timestamp":1624642713000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-004-0134-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,12]]},"references-count":48,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2004,12]]}},"alternative-id":["134"],"URL":"https:\/\/doi.org\/10.1007\/s00778-004-0134-4","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,12]]}}}