Streaming Algorithms for Selection and Approximate Sorting

  • Richard M. Karp
Conference paper

DOI: 10.1007/978-3-540-77050-3_2

Volume 4855 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Karp R.M. (2007) Streaming Algorithms for Selection and Approximate Sorting. In: Arvind V., Prasad S. (eds) FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2007. Lecture Notes in Computer Science, vol 4855. Springer, Berlin, Heidelberg

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Richard M. Karp
    • 1
  1. 1.International Computer Science Institute, Berkeley, USA, and University of California at BerkeleyUSA