Out-of-order event processing in kinetic data structures

M.A. Abam, P.K. Agarwal, M. Berg, de, H. Yu

Research output: Contribution to journalArticleAcademicpeer-review

1 Citation (Scopus)
90 Downloads (Pure)


We study the problem of designing kinetic data structures (KDS’s for short) when event times cannot be computed exactly and events may be processed in a wrong order. In traditional KDS’s this can lead to major inconsistencies from which the KDS cannot recover. We present more robust KDS’s for the maintenance of several fundamental structures such as kinetic sorting and kinetic tournament trees, which overcome the difficulty by employing a refined event scheduling and processing technique. We prove that the new event scheduling mechanism leads to a KDS that is correct except for finitely many short time intervals. We analyze the maximum delay of events and the maximum error in the structure, and we experimentally compare our approach to the standard event scheduling mechanism.
Original languageEnglish
Pages (from-to)250-273
Issue number2
Publication statusPublished - 2011

Fingerprint Dive into the research topics of 'Out-of-order event processing in kinetic data structures'. Together they form a unique fingerprint.

Cite this