{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:25:52Z","timestamp":1725495952157},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540770169"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77018-3_26","type":"book-chapter","created":{"date-parts":[[2007,11,26]],"date-time":"2007-11-26T07:46:39Z","timestamp":1196063199000},"page":"244-255","source":"Crossref","is-referenced-by-count":4,"title":["Finding Frequent Items in Data Streams Using ESBF"],"prefix":"10.1007","author":[{"given":"ShuYun","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"XiuLan","family":"Hao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"HeXiang","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"YunFa","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"7","key":"26_CR1","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"B. Bloom","year":"1970","unstructured":"Bloom, B.: Space\/time tradeoffs in hash coding with allowable errors. Commun. ACM\u00a013(7), 422\u2013426 (1970)","journal-title":"Commun. ACM"},{"key":"26_CR2","unstructured":"Fang, M., et al.: Computing iceberg queries efficiently. In VLDB (August 1998)"},{"key":"26_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1007\/3-540-45465-9_59","volume-title":"Automata, Languages and Programming","author":"M. Charikar","year":"2002","unstructured":"Charikar, M., Chen, K., Farach-Colton, M.: Finding Frequent Items in Data Streams. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 693\u2013703. Springer, Heidelberg (2002)"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Manku, G., Motwani, R.: Approximate Frequency Counts over Data Streams. In: Proceedings of the 28th International Conference on Very Large Data Bases, pp. 346\u2013357 (2002)","DOI":"10.1016\/B978-155860869-6\/50038-X"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Xu Yu, J., Chong, Z., Lu, H., Zhou, A.: False Positive or False Negative:Mining Frequent Itemsets form High Speed Transactional Data Streams. In: Proceedings of the 30th International Conference on Very Large Data Bases, pp. 204\u2013215 (2004)","DOI":"10.1016\/B978-012088469-8\/50021-8"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"Cormode, G., Muthukrishnan, S.: Whats Hot and Whats Not: Tracking Most Frequent Items Dynamically. In: Proceedings of the 22nd Symposium on Principles of Databse Systems, pp. 296\u2013306 (June 2003)","DOI":"10.1145\/773153.773182"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Garofalakis, M., Gehrke, J., Rastogi, R.: Querying and mining data streams: you only get one look. In: the tutorial notes of the 28th Int\u2019l Conference on Very Large Databases, Hong Kong, China (August 2002)","DOI":"10.1145\/564691.564794"},{"key":"26_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/3-540-45749-6_33","volume-title":"Algorithms - ESA 2002","author":"E.D. Demaine","year":"2002","unstructured":"Demaine, E.D., Lopez-Ortiz, A., Munro, J.I.: Frequency Estimation of Internet Packet Streams with Limited Space. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 348\u2013360. Springer, Heidelberg (2002)"},{"issue":"3","key":"26_CR9","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1145\/859716.859719","volume":"21","author":"C. Estan","year":"2003","unstructured":"Estan, C., Varghese, G.: New Directions in Traffic Measurement and Accounting: Focusing on the Elephants, Ignoring the Mice. ACM Trans. Comput. Syst.\u00a021(3), 270\u2013313 (2003)","journal-title":"ACM Trans. Comput. Syst."},{"key":"26_CR10","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1145\/956863.956918","volume-title":"Proceedings of the Twelfth International Conference on Information and Knowledge Management","author":"C. Jin","year":"2003","unstructured":"Jin, C., Qian, W., Sha, C., Yu, J.X., Zhou, A.: Dynamically Maintaining Frequent Items over A Data Stream. In: Proceedings of the Twelfth International Conference on Information and Knowledge Management, pp. 287\u2013294. ACM Press, New York (2003)"},{"issue":"1","key":"26_CR11","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1145\/762471.762473","volume":"28","author":"R. Karp","year":"2003","unstructured":"Karp, R., Shenker, S., Papadimitriou, C.: A Simple Algorithm for Finding Frequent Elements in Streams and Bags. ACM Transactions on Database Systems\u00a028(1), 51\u201355 (2003)","journal-title":"ACM Transactions on Database Systems"},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"Metwally, A., Agrawal, D., El Abbadi, A.: Efficient Computation of Frequent and Top-k Elements in Data Streams. Technical Report 2005-23, University of California, Santa Barbara (September 2005)","DOI":"10.1007\/978-3-540-30570-5_27"},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"Fan, L., Cao, P., Almeida, J., Broder, A.Z.: Summary Cache: A Scalable Wide-Area Web Cache Sharing Protocol. IEEE\/ACM Transactons on networking\u00a08(3) (June 2000)","DOI":"10.1109\/90.851975"},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"Aguilar-Saborit, J., Trancoso, P., Muntes-Mulero, V., Larriba-Pey, J.L.: Dynamic Count Filters. SIGMOD Record\u00a035(1) (March 2006)","DOI":"10.1145\/1121995.1122000"},{"key":"26_CR15","doi-asserted-by":"crossref","unstructured":"Cohen, S., Matias, Y.: Spectral Bloom Filters. In: SIGMOD 2003, June 912 , San Diego, CA (2003)","DOI":"10.1145\/872757.872787"}],"container-title":["Lecture Notes in Computer Science","Emerging Technologies in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77018-3_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:53:31Z","timestamp":1619520811000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77018-3_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540770169"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77018-3_26","relation":{},"subject":[]}}