Approximate range mode and range median queries

Lecture Notes in Computer Science

Volumn 3404, Issue , 2005, Pages 377-388

  Bose, Prosenjit ^a   Kranakis, Evangelos ^a   Morin, Pat ^a   Tang, Yihui ^a  

^a CARLETON UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DATA STRUCTURES; PARAMETER ESTIMATION;

RANGE MEDIAN; RANGE MODE; SPACE DATA STRUCTURES;

QUERY LANGUAGES;

EID: 24144495062     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31856-9_31     Document Type: Conference Paper

References (13)

1. N. Alon and B. Schieber. Optimal preprocessing for answering on-line product queries. Technical Report 71/87, Tel-Aviv University, 1987.
2. A. Arasu and G. S. Manku. Approximate counts and quantiles over sliding windows. In Proceedings of the ACM Symposium on Principles of Database Systems (PODS), 2004.
3. S. Battiato, D. Cantone, D. Catalano, G. Cincotti, and M. Hofri. An efficient algorithm for the approximate median selection problem. In Proceedings of the Fourth Italian Conference, 2000.
4. M. Ben-Or. Lower bounds for algebraic computation trees. In Proceedings of the 15th annual ACM Symposium on the Theory of Computing, pages 80-86, 1983.
5. M. Blum, R. W. Floyd, V. Pratt, R. L. Rivest, and R. E. Tarjan. Time bounds for selection. Journal of Computer and System Sciences, 7(4):448-461, 1973.
6. M. Datar, A. Gionis, P. Indyk, and R. Motwani. Maintaining stream statistics over sliding windows. SIAM Journal of Computing, 31(6):1794-1813, 2002.
7. E. D. Demaine, A. Lópex-Ortiz, and J. I. Munro. Frequency estimation of internet packet streams with limited space. In Proceedings of the 10th Annual European Symposium on Algorithms, pages 348-360, 2002.
8. J. R. Driscoll, N. Sarnak, D. D. Sleator, and R. E. Tarjan. Making data structures persistent. Journal of Computer and System Sciences, 38(1):86-124, 1989.
9. H. N. Gabow and R. E. Tarjan. A linear-time algorithm for a special case of disjoint set union. Journal of Computer and System Sciences, 30(2):209-221, 1985.
10. D. Krizanc, P. Morin, and M. Smid. Range mode and range median queries on lists and trees. In Proceedings of the 14th Annual International Symposium on Algorithms and Computation (ISAAC 2003), 2003.
11. X. Lin, H. Liu, J. Xu, and J. X. Yu. Continuously maintaining quantile summaries of the most recent n elements over a data stream. In Proceedings of the 20th International Conference on Data Engineering, 2004.
12. G. S. Manku, S. Rajagopalan, and B. Lindsay. Approximate median and other quantiles in one pass and with limited memory. In Proceedings of the 1998 ACM SIGMOD International Conference on Management of Data, pages 426-435, 1998.
13. A. C. Yao. Space-time tradeoff for answering range queries. In Proceedings of the 14th annual ACM Symposium on the Theory of Computing, pages 128-136, 1982.