The Frequent Items Problem in Online Streaming Under Various Performance Measures

Joan Boyar, Kim Skak Larsen, Abyayananda Maiti

Research output: Contribution to journalJournal articleResearchpeer-review


This is a contribution to the ongoing study of properties of performance measures for online algorithms. It has long been known that competitive analysis suffers from draw-backs in certain situations, and many alternative measures have been proposed. More systematic comparative studies of performance measures have been initiated recently, and we continue this work, considering competitive analysis, relative interval analysis, and relative worst order analysis on the frequent items problem, a fundamental online streaming problem.
Original languageEnglish
JournalInternational Journal of Foundations of Computer Science
Issue number4
Pages (from-to)413-439
Publication statusPublished - 2015

Cite this