Lower bounds for quantile estimation in random-order and multi-pass streaming

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4596 LNCS, Issue , 2007, Pages 704-715

  Guha, Sudipto ^a   McGregor, Andrew ^b  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; DATA STRUCTURES; MATHEMATICAL MODELS; RANDOM PROCESSES;

EXPONENTIAL SEPARATION; MULTI-PASS STREAMING; QUANTILE ESTIMATION;

PARAMETER ESTIMATION;

EID: 38149056509     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73420-8_61     Document Type: Conference Paper

References (24)

1. Chan, T.M., Chen, E.Y.: Multi-pass geometric algorithms. In: Symposium on Computational Geometry, pp. 180-189 (2005)
2. Chang, K.L., Kannan, R.: The space complexity of pass-efficient algorithms for clustering. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 1157-1166 (2006)
3. Cormode, G., Korn, F., Muthukrishnan, S., Srivastava, D.: Space- and time-efficient deterministic algorithms for biased quantiles over data streams. In: PODS, pp. 263-272 (2006)
4. Cormode, G., Muthukrishnan, S.: An improved data stream summary: the countmin sketch and its applications. J. Algorithms 55(1), 58-75 (2005)
5. Demaine, E.D., López-Ortiz, A., Munro, J.I.: Frequency estimation of internet packet streams with limited space. In: Möhring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 348-360. Springer, Heidelberg (2002)
6. Drineas, P., Kannan, R.: Pass efficient algorithms for approximating large matrices. In: Symposium, A.C.M.-S.I.A.M. (ed.) ACM-SIAM Symposium on Discrete Algorithms, pp. 223-232 (2003)
7. Feigenbaum, J., Kannan, S., McGregor, A., Suri, S., Zhang, J.: On graph problems in a semi-streaming model. Theoretical Computer Science 348(2-3), 207-216 (2005)
8. Feigenbaum, J., Kannan, S., Strauss, M., Viswanathan, M.: Testing and spotchecking of data streams. Algorithmica 34(1), 67-80 (2002)
9. Gilbert, A.C., Kotidis, Y., Muthukrishnan, S., Strauss, M.: How to summarize the universe: Dynamic maintenance of quantiles. In: International Conference on Very Large Data Bases (VLDB), pp. 454-465 (2002)
10. Greenwald, M., Khanna, S.: Space-efficient online computation of quantile summaries. In: ACM SIGMOD International Conference on Management of Data, pp. 58-66. ACM Press, New York (2001)
11. Guha, S., McGregor, A.: Approximate quantiles and the order of the stream. In: ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 273-279. ACM Press, New York (2006)
12. Guha, S., McGregor, A.: Space-efficient sampling. In: AISTATS, pp. 169-176 (2007)
13. Guha, S., McGregor, A., Venkatasubramanian, S.: Streaming and sublinear approximation of entropy and information distances. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 733-742 (2006)
14. Gupta, A., Zane, F.: Counting inversions in lists. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 253-254 (2003)
15. Kannan, S.: Open problems in streaming. DIMACS Workshop (2001), (Slides: dimacs.rutgers.edu/Workshops/Streaming/abstracts.html)
16. Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (1997)
17. Manku, G.S., Rajagopalan, S., Lindsay, B.G.: Approximate medians and other quantiles in one pass and with limited memory. In: ACM SIGMOD International Conference on Management of Data, pp. 426-435. ACM Press, New York (1998)
18. Manku, G.S., Rajagopalan, S., Lindsay, B.G.: Random sampling techniques for space efficient online computation of order statistics of large datasets. In: ACM SIGMOD International Conference on Management of Data, pp. 251-262. ACM Press, New York (1999)
19. McGregor, A.: Finding graph matchings in data streams. In: APPROX-RANDOM, pp. 170-181 (2005)
20. Miltersen, P.B., Nisan, N., Safra, S., Wigderson, A.: On data structures and asymmetric communication complexity. J. Comput. Syst. Sci. 57(1), 37-49 (1998)
21. Munro, J.I., Paterson, M.: Selection and sorting with limited storage. Theor. Comput. Sci. 12, 315-323 (1980)
22. Nisan, N., Wigderson, A.: Rounds in communication complexity revisited. SIAM J. Comput. 22(1), 211-219 (1993)
23. Shrivastava, N., Buragohain, C., Agrawal, D., Suri, S.: Medians and beyond: new aggregation techniques for sensor networks. In: SenSys, pp. 239-249 (2004)
24. Yao, A.C.: Lower bounds by probabilistic arguments. In: IEEE Symposium on Foundations of Computer Science, pp. 420-428. IEEE Computer Society Press, Los Alamitos (1980)