On-Line Stream Merging, Max Span, and Min Coverage

  • Wun-Tat Chan
  • Tak-Wah Lam
  • Hing-Fung Ting
  • Prudence W. H. Wong
Conference paper

DOI: 10.1007/3-540-44849-7_14

Volume 2653 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Chan WT., Lam TW., Ting HF., Wong P.W.H. (2003) On-Line Stream Merging, Max Span, and Min Coverage. In: Petreschi R., Persiano G., Silvestri R. (eds) Algorithms and Complexity. CIAC 2003. Lecture Notes in Computer Science, vol 2653. Springer, Berlin, Heidelberg

Abstract

This paper introduces the notions of span and coverage for analyzing the performance of on-line algorithms for stream merging. We show that these two notions can solely determine the competitive ratio of any such algorithm. Furthermore, we devise a simple greedy algorithm that can attain the ideal span and coverage, thus giving a better performance guarantee than existing algorithms with respect to either the maximum bandwidth or the total bandwidth. The new notions also allow us to obtain a tighter analysis of existing algorithms.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Wun-Tat Chan
    • 1
  • Tak-Wah Lam
    • 2
  • Hing-Fung Ting
    • 2
  • Prudence W. H. Wong
    • 2
  1. 1.Department of ComputingHong Kong Polytechnic UniversityHong Kong
  2. 2.Department of Computer ScienceUniversity of Hong KongHong Kong