{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T14:45:42Z","timestamp":1777473942390,"version":"3.51.4"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,11,18]],"date-time":"2010-11-18T00:00:00Z","timestamp":1290038400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Evolving Systems"],"published-print":{"date-parts":[[2011,3]]},"DOI":"10.1007\/s12530-010-9020-z","type":"journal-article","created":{"date-parts":[[2010,11,17]],"date-time":"2010-11-17T14:36:37Z","timestamp":1290004597000},"page":"51-70","source":"Crossref","is-referenced-by-count":17,"title":["Finding top-k elements in a time-sliding window"],"prefix":"10.1007","volume":"2","author":[{"given":"Nuno","family":"Homem","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joao Paulo","family":"Carvalho","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,11,18]]},"reference":[{"key":"9020_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal C (ed) (2007) Data streams: models and algorithms, Springer, Berlin","DOI":"10.1007\/978-0-387-47534-9"},{"key":"9020_CR2","doi-asserted-by":"crossref","unstructured":"Babcock B, Datar M, Motwani R, O\u2019Callaghan L (2003) Maintaining variance and k-medians over data stream windows. In: Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pp 234\u2013243","DOI":"10.1145\/773153.773176"},{"key":"9020_CR3","unstructured":"Bertsekas D (1995) Dynamic programming and optimal control. vol 1. Athena Scientific, Nashua"},{"key":"9020_CR4","doi-asserted-by":"crossref","unstructured":"Braverman V, Ostrovsky R (2007) Smooth histograms for sliding window, in FOCS 2007, pp 283\u2013293","DOI":"10.1109\/FOCS.2007.4389500"},{"key":"9020_CR5","doi-asserted-by":"crossref","unstructured":"Cohen E, Strauss M (2006) Maintaining time-decaying stream aggregates. J Algorithms 59(1):19\u201336","DOI":"10.1016\/j.jalgor.2005.01.006"},{"key":"9020_CR6","doi-asserted-by":"crossref","unstructured":"Cormode G, Hadjieleftheriou M (2010) Methods for finding frequent items in data streams. VLDB J, vol 19","DOI":"10.1007\/s00778-009-0172-z"},{"key":"9020_CR7","doi-asserted-by":"crossref","unstructured":"Cormode G, Muthukrishnan S (2003) What\u2019s hot and what\u2019s not: tracking most frequent items dynamically. In: Proceedings of the 22nd ACM PODS symposium on principles of database systems, pp 296\u2013306","DOI":"10.1145\/773153.773182"},{"key":"9020_CR8","doi-asserted-by":"crossref","unstructured":"Datar M, Gionis A, Indyk P, Motwani R (2002) Maintaining stream statistics over sliding windows. SIAM J Comput 31(6):1794\u20131813","DOI":"10.1137\/S0097539701398363"},{"key":"9020_CR9","doi-asserted-by":"crossref","unstructured":"Demaine E, L\u00f3pez-Ortiz A, Munro J (2002) Frequency estimation of internet packet streams with limited space. In: Proceedings of the 10th ESA Annual European Symposium on Algorithms, pp 348\u2013360","DOI":"10.1007\/3-540-45749-6_33"},{"key":"9020_CR10","doi-asserted-by":"crossref","unstructured":"Dimitropoulos X, Hurley P, Kind A (2008) Probabilistic Lossy Counting: an efficient algorithm for finding heavy hitters, ACM SIGCOMM Comput Commun Rev, vol 38, no. 1","DOI":"10.1145\/1341431.1341433"},{"issue":"3","key":"9020_CR11","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1145\/859716.859719","volume":"21","author":"C Estan","year":"2003","unstructured":"Estan C, Varghese G (2003) New directions in traffic measurement and accounting: focusing on the elephants, ignoring the mice. ACM Trans Comput Syst 21(3):270\u2013313","journal-title":"ACM Trans Comput Syst"},{"key":"9020_CR12","unstructured":"Ganguly S (2003) Counting distinct items over update streams. Theoret Comput Sci 378(3):211\u2013222"},{"key":"9020_CR13","doi-asserted-by":"crossref","unstructured":"Gibbons P, Tirthapura S (2002) Distributed streams algorithms for sliding windows. In: Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures, pp 63\u201372","DOI":"10.1145\/564870.564880"},{"key":"9020_CR14","doi-asserted-by":"crossref","unstructured":"Gilbert A, Guha S, Indyk P, Kotidis Y, Muthukrishnan S, Strauss M (2002) Fast, small-space algorithms for approximate histogram maintenance In: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, pp 389\u2013398","DOI":"10.1145\/509961.509966"},{"key":"9020_CR15","doi-asserted-by":"crossref","unstructured":"Golab L, DeHaan D, Demaine E, Lopez-Ortiz A, Munro J, (2003), Identifying frequent items in sliding windows over on-line packet streams. In: Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement table of contents, pp 173\u2013178","DOI":"10.1145\/948205.948227"},{"key":"9020_CR16","unstructured":"Homem N, Carvalho J (2010) Estimating Top-k destinations in data streams, computational intelligence for knowledge-based systems design. Springer, Berlin\/Heidelberg, pp 290\u2013299"},{"key":"9020_CR17","doi-asserted-by":"crossref","unstructured":"Homem N, Carvalho J (2010) Finding top-k elements in data streams. Inform Sci 180(24):4958\u20134974","DOI":"10.1016\/j.ins.2010.08.024"},{"key":"9020_CR18","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/j.ins.2007.08.006","volume":"178","author":"T Hu","year":"2008","unstructured":"Hu T, Sung S, Xiong H, Fu Q (2008) Discovery of maximum length frequent itemsets. Inf Sci 178:69\u201387","journal-title":"Inf Sci"},{"key":"9020_CR19","unstructured":"Hua-Fu Li, Suh-Yin Lee (2009) Mining frequent itemsets over data streams using efficient window sliding techniques. Expert Syst Appl 36(2):1466\u20131477"},{"key":"9020_CR20","doi-asserted-by":"crossref","unstructured":"Lee L, Ting H (2006) A simpler and more efficient deterministic scheme for finding frequent items over sliding windows. In: Proceedings of the 25th ACM SIGMOD-SIGACT-SIGART symposium on principles of satabase systems, pp 290\u2013297","DOI":"10.1145\/1142351.1142393"},{"issue":"4","key":"9020_CR21","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1016\/j.datak.2008.11.001","volume":"68","author":"N Manerikar","year":"2009","unstructured":"Manerikar N, Palpanas T (2009) Frequent items in streaming data: an experimental evaluation of the state-of-the-art. Data Knowl Eng 68(4):415\u2013430","journal-title":"Data Knowl Eng"},{"key":"9020_CR22","doi-asserted-by":"crossref","unstructured":"Manku G, Motwani R (2002) Approximate frequency counts over data streams. In: Proceedings of the 28th ACM VLDB international conference on very large data bases, pp 346\u2013357","DOI":"10.1016\/B978-155860869-6\/50038-X"},{"key":"9020_CR23","doi-asserted-by":"crossref","unstructured":"Matias Y, Vitter J, Wang M (1998) Wavelet-based histograms for selectivity estimation. In: Proceedings of the 1998 ACM SIGMOD international conference on management of data, pp 448\u2013459","DOI":"10.1145\/276304.276344"},{"key":"9020_CR24","unstructured":"Matias Y, Vitter J, Wang M (2000) Dynamic maintenance of wavelet-based histograms. VLDB, pp 101\u2013110"},{"key":"9020_CR25","doi-asserted-by":"crossref","unstructured":"Metwally A, Agrawal D, Abbadi A (2005) Efficient computation of frequent and Top-k elements in data streams. Technical Report 2005-23. University of California, Santa Barbara","DOI":"10.1007\/978-3-540-30570-5_27"},{"key":"9020_CR26","doi-asserted-by":"crossref","unstructured":"Muthukrishnan S (2005) Data streams: algorithms and applications, foundations and trends. Theoret Comput Sci 1(2):117\u2013236","DOI":"10.1561\/0400000002"},{"key":"9020_CR27","unstructured":"Qiao L, Agrawal D, Abbadi A (2003) Supporting sliding window queries for continuous data streams. In: Proceedings of the 15th international conference on scientific and statistical database management, pp 85\u201394"},{"issue":"5","key":"9020_CR28","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1016\/j.ins.2008.10.027","volume":"179","author":"S Tanbeer","year":"2009","unstructured":"Tanbeer S, Ahmed C, Jeong B, Lee Y (2009a) Efficient single-pass frequent pattern mining using a prefix-tree. Inf Sci 179(5):559\u2013583","journal-title":"Inf Sci"},{"issue":"22","key":"9020_CR29","doi-asserted-by":"crossref","first-page":"3843","DOI":"10.1016\/j.ins.2009.07.012","volume":"179","author":"S Tanbeer","year":"2009","unstructured":"Tanbeer S, Ahmed C, Jeong B, Lee Y (2009b) Sliding window-based frequent pattern mining over data streams. Inf Sci 179(22):3843\u20133865","journal-title":"Inf Sci"},{"key":"9020_CR30","doi-asserted-by":"crossref","unstructured":"Tantono F, Manerikar N, Palpanas T (2008) Efficiently discovering recent frequent items in data streams In: Scientific and statistical database management, Lecture Notes in Computer Science, pp 222\u2013239","DOI":"10.1007\/978-3-540-69497-7_16"},{"key":"9020_CR31","doi-asserted-by":"crossref","unstructured":"Zhu Y, Shasha D (2002) Statistical monitoring of thousands of data streams in real time. In: Proceedings of the 28th international conference on very large data bases, pp 358\u2013369","DOI":"10.1016\/B978-155860869-6\/50039-1"}],"container-title":["Evolving Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12530-010-9020-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12530-010-9020-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12530-010-9020-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T10:00:23Z","timestamp":1559815223000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12530-010-9020-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,11,18]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,3]]}},"alternative-id":["9020"],"URL":"https:\/\/doi.org\/10.1007\/s12530-010-9020-z","relation":{},"ISSN":["1868-6478","1868-6486"],"issn-type":[{"value":"1868-6478","type":"print"},{"value":"1868-6486","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,11,18]]}}}