{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T23:51:27Z","timestamp":1776210687947,"version":"3.50.1"},"reference-count":31,"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-0135-3","type":"journal-article","created":{"date-parts":[[2004,9,14]],"date-time":"2004-09-14T17:18:29Z","timestamp":1095182309000},"page":"354-369","source":"Crossref","is-referenced-by-count":28,"title":["Tracking set-expression cardinalities over continuous update streams"],"prefix":"10.1007","volume":"13","author":[{"given":"Sumit","family":"Ganguly","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minos","family":"Garofalakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rajeev","family":"Rastogi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"Alon N, Gibbons PB, Matias Y, Szegedy M (1999) Tracking join and self-join sizes in limited storage. In: Proceedings of the 18th ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems, Philadeplphia","DOI":"10.1145\/303976.303978"},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"Alon N, Matias Y, Szegedy M (1996) The space complexity of approximating the frequency moments. In: Proceedings of the 28th annual ACM symposium on the theory of computing, Philadelphia, pp 20-29","DOI":"10.1145\/237814.237823"},{"key":"CR3","unstructured":"Alon N, Spencer JH (1992) The probabilistic method. Wiley, New York"},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"Bar-Yossef Z, Jayram TS, Kumar R, Sivakumar D, Trevisan L (2002) Counting distinct elements in a data stream. In: Proceedings of the 6th international workshop on randomization and approximation techniques in computer science (RANDOM?02), Cambridge, MA","DOI":"10.1007\/3-540-45726-7_1"},{"key":"CR5","unstructured":"Broder AZ, Charikar M, Frieze AM, Mitzenmacher M (1998) Min-wise independent permutations. In: Proceedings of the 30th ACM symposium on the theory of computing, pp 327-336"},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"Charikar M, Chaudhuri S, Motwani R, Narasayya V (2000) Towards estimation error guarantees for distinct values. In: Proceedings of the 19th ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems, Dallas, TX","DOI":"10.1145\/335168.335230"},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"Charikar M, Chen K, Farach-Colton M (2002) Finding frequent items in data streams. In: Proceedings of the international colloquium on automata, languages, and programming, Malaga, Spain","DOI":"10.1007\/3-540-45465-9_59"},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"Chen Z, Korn F, Koudas N, Muthukrishnan S (2000) Selectivity estimation for Boolean queries. In: Proceedings of the 19th ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems, Dallas, TX","DOI":"10.1145\/335168.335225"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1006\/jcss.1997.1534","volume":"55","author":"Cohen","year":"1997","unstructured":"Cohen E (1997) Size-estimation framework with applications to transitive closure and reachability. J Comput Sys Sci 55(3):441-453","journal-title":"J Comput Sys Sci"},{"key":"CR10","unstructured":"Cormen TH, Leiserson CE, Rivest RL (1990) Introduction to algorithms. MIT Press, Cambridge, MA"},{"key":"CR11","doi-asserted-by":"crossref","unstructured":"Dobra A, Garofalakis M, Gehrke J, Rastogi R (2002) Processing complex aggregate queries over data streams. In: Proceedings of the 2002 ACM SIGMOD international conference on management of data, Madison, WI, pp 61-72","DOI":"10.1145\/564691.564699"},{"key":"CR12","doi-asserted-by":"crossref","unstructured":"Feigenbaum J, Kannan S, Strauss M, Viswanathan M (1999) An approximate L1-difference algorithm for massive data streams. In: Proceedings of the 40th IEEE symposium on foundations of computer science, pp 501-511","DOI":"10.1109\/SFFCS.1999.814623"},{"key":"CR13","doi-asserted-by":"crossref","unstructured":"Feigenbaum J, Kannan S, Strauss M, Viswanathan M (1999) An approximate L 1-difference algorithm for massive data streams. In: Proceedings of the 40th annual IEEE symposium on foundations of computer science, New York","DOI":"10.1109\/SFFCS.1999.814623"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1016\/0022-0000(85)90041-8","volume":"31","author":"Flajolet","year":"1985","unstructured":"Flajolet P, Martin GN (1985) Probabilistic counting algorithms for data base applications. J Comput Sys Sci 31:182-209","journal-title":"J Comput Sys Sci"},{"key":"CR15","doi-asserted-by":"crossref","unstructured":"Ganguly S, Garofalakis M, Rastogi R (2003) Processing set expressions over continuous update streams. In: Proceedings of the 2003 ACM SIGMOD international conference on management of data, San Diego, CA","DOI":"10.1145\/872757.872790"},{"key":"CR16","first-page":"27th","volume":"in","author":"Garofalakis","year":"2001","unstructured":"Garofalakis M, Gibbons PB (2001) Approximate query processing: taming the terabytes. Tutorial in: 27th international conference on very large data bases, Rome, Italy","journal-title":"Tutorial"},{"key":"CR17","first-page":"28th","volume":"in","author":"Garofalakis","year":"2002","unstructured":"Garofalakis M, Gehrke J, Rastogi R (2002) Querying and mining data streams: you only get one look. Tutorial in: 28th international conference on very large data bases, Hong Kong","journal-title":"Tutorial"},{"key":"CR18","unstructured":"Gibbons PB (2001) Distinct sampling for highly-accurate answers to distinct values queries and event reports. In: Proceedings of the 27th international conference on very large data bases, Rome, Italy"},{"key":"CR19","doi-asserted-by":"crossref","unstructured":"Gibbons PB, Tirthapura S (2001) Estimating simple functions on the union of data streams. In: Proceedings of the 13th annual ACM symposium on parallel algorithms and architectures, Crete Island, Greece","DOI":"10.1145\/378580.378687"},{"key":"CR20","unstructured":"Gilbert AC, Kotidis Y, Muthukrishnan S, Strauss MJ (2001) Surfing wavelets on streams: one-pass summaries for approximate aggregate queries. In: Proceedings of the 27th international conference on very large data bases, Rome, Italy"},{"key":"CR21","doi-asserted-by":"crossref","unstructured":"Gilbert AC, Kotidis Y, Muthukrishnan S, Strauss MJ (2002) How to summarize the universe: dynamic maintenance of quantiles. In: Proceedings of the 28th international conference on very large data bases, pp 454-465, Hong Kong","DOI":"10.1016\/B978-155860869-6\/50047-0"},{"key":"CR22","doi-asserted-by":"crossref","unstructured":"Greenwald M, Khanna S (2001) Space-efficient online computation of quantile summaries. In: Proceedings of the 2001 ACM SIGMOD international conference on management of data, Santa Barbara, CA","DOI":"10.1145\/375663.375670"},{"key":"CR23","unstructured":"Haas PJ, Naughton JF, Seshadri S, Stokes L (1995) Sampling-based estimation of the number of distinct values of an attribute. In: Proceedings of the 21st international conference on very large data bases, pp 311-322"},{"key":"CR24","unstructured":"Indyk P (1999) A small approximately min-wise independent family of hash functions. In: Proceedings of the 10th annual ACM-SIAM symposium on discrete algorithms, Baltimore, MD, pp 454-456"},{"key":"CR25","doi-asserted-by":"crossref","unstructured":"Indyk P (2000) Stable distributions, pseudorandom generators, embeddings and data stream computation. In: Proceedings of the 41st annual IEEE symposium on foundations of computer science, Redondo Beach, CA, pp 189-197","DOI":"10.1109\/SFCS.2000.892082"},{"key":"CR26","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1137\/0405044","volume":"5","author":"Kalyanasundaram","year":"1992","unstructured":"Kalyanasundaram B, Schnitger G (1992) The probabilistic communication complexity of set intersection. SIAM J Discrete Math 5(4):545-557","journal-title":"SIAM J Discrete Math"},{"key":"CR27","doi-asserted-by":"crossref","unstructured":"Kushilevitz E, Nisan N (1997) Communication complexity. Cambridge University Press, Cambridge, UK","DOI":"10.1016\/S0065-2458(08)60342-3"},{"key":"CR28","doi-asserted-by":"crossref","unstructured":"Singh Manku G, Motwani R (2002) Approximate frequency counts over data streams. In: Proceedings of the 28th international conference on very large data bases, Hong Kong, pp 346-357","DOI":"10.1016\/B978-155860869-6\/50038-X"},{"key":"CR29","first-page":"a","volume":"SQL","author":"Melton","year":"1993","unstructured":"Melton J, Simon AR (1993) Understanding the new SQL: a complete guide. Morgan Kaufmann, San Francisco","journal-title":"Understanding the new"},{"key":"CR30","doi-asserted-by":"crossref","unstructured":"Motwani R, Raghavan P (1995) Randomized algorithms. Cambridge University Press, Cambridge, UK","DOI":"10.1017\/CBO9780511814075"},{"key":"CR31","doi-asserted-by":"crossref","unstructured":"Thaper N, Guha S, Indyk P, Koudas N (2002) Dynamic multidimensional histograms. In: Proceedings of the 2002 ACM SIGMOD international conference on management of data, Madison, WI, pp 428-439","DOI":"10.1145\/564691.564741"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-004-0135-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00778-004-0135-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-004-0135-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T04:20:13Z","timestamp":1585887613000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00778-004-0135-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,12]]},"references-count":31,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2004,12]]}},"alternative-id":["135"],"URL":"https:\/\/doi.org\/10.1007\/s00778-004-0135-3","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,12]]}}}