Ιδρυματικό Αποθετήριο
Πολυτεχνείο Κρήτης
Πολυτεχνείο Κρήτης
EN
|
EL
| URI | http://purl.tuc.gr/dl/dias/254058C8-2138-4CF6-A624-918ACF6570DB | - |
| Αναγνωριστικό | http://link.springer.com/article/10.1007%2Fs00778-004-0135-3 | - |
| Αναγνωριστικό | https://doi.org/10.1007/s00778-004-0135-3 | - |
| Γλώσσα | en | - |
| Μέγεθος | 16 pages | en |
| Τίτλος | Tracking set-expression cardinalities over continuous update streams | en |
| Δημιουργός | Ganguly, Sumit | en |
| Δημιουργός | Garofalakis Minos | en |
| Δημιουργός | Γαροφαλακης Μινως | el |
| Δημιουργός | Rastogi Rajeev | en |
| Εκδότης | Springer Verlag | en |
| Περίληψη | There is growing interest in algorithms for processing and querying continuous data streams (i.e., data seen only once in a fixed order) with limited memory resources. In its most general form, a data stream is actually an update stream, i.e., comprising data-item deletions as well as insertions. Such massive update streams arise naturally in several application domains (e.g., monitoring of large IP network installations or processing of retail-chain transactions). Estimating the cardinality of set expressions defined over several (possibly distributed) update streams is perhaps one of the most fundamental query classes of interest; as an example, such a query may ask “what is the number of distinct IP source addresses seen in passing packets from both router R 1 and R 2 but not router R 3?”. Earlier work only addressed very restricted forms of this problem, focusing solely on the special case of insert-only streams and specific operators (e.g., union). In this paper, we propose the first space-efficient algorithmic solution for estimating the cardinality of full-fledged set expressions over general update streams. Our estimation algorithms are probabilistic in nature and rely on a novel, hash-based synopsis data structure, termed ”2-level hash sketch”. We demonstrate how our 2-level hash sketch synopses can be used to provide low-error, high-confidence estimates for the cardinality of set expressions (including operators such as set union, intersection, and difference) over continuous update streams, using only space that is significantly sublinear in the sizes of the streaming input (multi-)sets. Furthermore, our estimators never require rescanning or resampling of past stream items, regardless of the number of deletions in the stream. We also present lower bounds for the problem, demonstrating that the space usage of our estimation algorithms is within small factors of the optimal. Finally, we propose an optimized, time-efficient stream synopsis (based on 2-level hash sketches) that provides similar, strong accuracy-space guarantees while requiring only guaranteed logarithmic maintenance time per update, thus making our methods applicable for truly rapid-rate data streams. Our results from an empirical study of our synopsis and estimation techniques verify the effectiveness of our approach. | en |
| Τύπος | Peer-Reviewed Journal Publication | en |
| Τύπος | Δημοσίευση σε Περιοδικό με Κριτές | el |
| Άδεια Χρήσης | http://creativecommons.org/licenses/by/4.0/ | en |
| Ημερομηνία | 2015-10-29 | - |
| Ημερομηνία Δημοσίευσης | 2004 | - |
| Θεματική Κατηγορία | Data streams | en |
| Θεματική Κατηγορία | Set expressions | en |
| Θεματική Κατηγορία | Data synopses | en |
| Θεματική Κατηγορία | Approximate query processing | en |
| Θεματική Κατηγορία | Randomized algorithms | en |
| Βιβλιογραφική Αναφορά | S. Ganguly, M. Garofalakis and R. Rastogi, "Tracking set-expression cardinalities over continuous update streams", VLDB J., vol. 13, no. 4, pp. 354-369, Dec. 2004. doi:10.1007/s00778-004-0135-3 | en |
Copyright © DIAS 2013
