Streaming Algorithms for Selection and Approximate Sorting
Companies such as Google, Yahoo and Microsoft maintain extremely large data repositories within which searches are frequently conducted. In an article entitled “Data-Intensive Supercomputing: The case for DISC” Randal Bryant describes such data repositories and suggests an agenda for appying them more broadly to massive data set problems of importance to the scientific community and society in general.
KeywordsInput Stream Binary Search Tree Left Child Disc Block Geometric Random Variable
Unable to display preview. Download preview PDF.
- 2.Bryant, R.E.: Data-intensive supercomputing: the case for DISC.Technical Report CMU-CS-07-128, Carnegie-Mellon University School of Computer Science (2007)Google Scholar
- 3.Chazelle, B.: The soft heap: an approximate priority queue with optimal error rate. Journal of the ACM 47 (2000)Google Scholar