Chapter

Algorithms and Complexity

Volume 2653 of the series Lecture Notes in Computer Science pp 70-82

Date:

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

  • Wun-Tat ChanAffiliated withDepartment of Computing, Hong Kong Polytechnic University
  • , Tak-Wah LamAffiliated withDepartment of Computer Science, University of Hong Kong
  • , Hing-Fung TingAffiliated withDepartment of Computer Science, University of Hong Kong
  • , Prudence W. H. WongAffiliated withDepartment of Computer Science, University of Hong Kong

* Final gross prices may vary according to local VAT.

Get Access

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.