Estimating statistical aggregates on probabilistic data streams
暂无分享,去创建一个
Andrew McGregor | S. Muthukrishnan | T. S. Jayram | Erik Vee | Erik Vee | S. Muthukrishnan | A. Mcgregor | S. Muthukrishnan | Erik Vee
[1] T. S. Jayram,et al. Efficient aggregation algorithms for probabilistic data , 2007, SODA '07.
[2] Michael Stonebraker,et al. Load management and high availability in the Medusa distributed stream processing system , 2004, SIGMOD '04.
[3] Andrew McGregor,et al. Estimating statistical aggregates on probabilistic data streams , 2007, PODS.
[4] Sudipto Guha,et al. Space-Efficient Sampling , 2007, AISTATS.
[5] Luca Trevisan,et al. Counting Distinct Elements in a Data Stream , 2002, RANDOM.
[6] Gerhard Weikum,et al. ACM Transactions on Database Systems , 2005 .
[7] Theodore Johnson,et al. Gigascope: a stream database for network applications , 2003, SIGMOD '03.
[8] J. D. Lipson. Elements of algebra and algebraic computing , 1981 .
[9] Graham Cormode,et al. Sketching probabilistic data streams , 2007, SIGMOD '07.
[10] Setsuo Ohsuga,et al. INTERNATIONAL CONFERENCE ON VERY LARGE DATA BASES , 1977 .
[11] S. Muthukrishnan,et al. Data streams: algorithms and applications , 2005, SODA '03.
[12] T. S. Jayram,et al. OLAP over uncertain and imprecise data , 2007, The VLDB Journal.
[13] Sampath Kannan,et al. More on reconstructing strings from random traces: insertions and deletions , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..
[14] Joan Feigenbaum,et al. Graph distances in the streaming model: the value of space , 2005, SODA '05.
[15] Jennifer Widom,et al. Models and issues in data stream systems , 2002, PODS.
[16] Norbert Fuhr,et al. A probabilistic relational algebra for the integration of information retrieval and database systems , 1997, TOIS.
[17] Dan Suciu,et al. Efficient query evaluation on probabilistic databases , 2004, The VLDB Journal.
[18] Noga Alon,et al. The space complexity of approximating the frequency moments , 1996, STOC '96.
[19] Sampath Kannan,et al. Reconstructing strings from random traces , 2004, SODA '04.
[20] J. Ian Munro,et al. Selection and sorting with limited storage , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).
[21] Ravi Kannan,et al. The space complexity of pass-efficient algorithms for clustering , 2006, SODA '06.
[22] Piotr Indyk,et al. Algorithms for dynamic geometric problems over data streams , 2004, STOC '04.
[23] T. S. Jayram,et al. Efficient allocation algorithms for OLAP over imprecise data , 2006, VLDB.
[24] Sanjeev Khanna,et al. Space-efficient online computation of quantile summaries , 2001, SIGMOD '01.
[25] Philippe Flajolet,et al. Probabilistic Counting Algorithms for Data Base Applications , 1985, J. Comput. Syst. Sci..