An Approximate Lp-Difference Algorithm for Massive Data Streams

Extended Abstract
  • Jessica H. Fong
  • Martin J. Strauss
Conference paper

DOI: 10.1007/3-540-46541-3_16

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1770)
Cite this paper as:
Fong J.H., Strauss M.J. (2000) An Approximate Lp-Difference Algorithm for Massive Data Streams. In: Reichel H., Tison S. (eds) STACS 2000. STACS 2000. Lecture Notes in Computer Science, vol 1770. Springer, Berlin, Heidelberg

Abstract

Several recent papers have shown how to approximate the difference Σi |aibi| or Σ |aibi|2 between two functions, when the function values ai and bi are given in a data stream, and their order is chosen by an adversary. These algorithms use little space (much less than would be needed to store the entire stream) and little time to process each item in the stream and give approximations with small relative error. Using different techniques, we show how to approximate the Lp-difference Σi |aibi|p for any rational-valued p ∈ (0,2], with comparable efficiency and error. We also show how to approximate Σi |aibi|p for larger values of p but with a worse error guarantee. These results can be used to assess the difference between two chronologically or physically separated massive data sets, making one quick pass over each data set, without buffering the data or requiring the data source to pause.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Jessica H. Fong
    • 1
  • Martin J. Strauss
    • 2
  1. 1.Princeton UniversityPrincetonUSA
  2. 2.AT&T Labs—ResearchFlorham ParkUSA

Personalised recommendations