Out-of-order event processing in kinetic data structures

Published

Journal Article

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 two fundamental structures, kinetic sorting and 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. © Springer-Verlag Berlin Heidelberg 2006.

Duke Authors

Cited Authors

  • Abam, MA; Agarwal, PK; De Berg, M; Yu, H

Published Date

  • January 1, 2006

Published In

Volume / Issue

  • 4168 LNCS /

Start / End Page

  • 624 - 635

Electronic International Standard Serial Number (EISSN)

  • 1611-3349

International Standard Serial Number (ISSN)

  • 0302-9743

Citation Source

  • Scopus