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 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. © 2009 Springer Science+Business Media, LLC.

Full Text

Duke Authors

Cited Authors

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

Published Date

  • June 1, 2011

Published In

Volume / Issue

  • 60 / 2

Start / End Page

  • 250 - 273

Electronic International Standard Serial Number (EISSN)

  • 1432-0541

International Standard Serial Number (ISSN)

  • 0178-4617

Digital Object Identifier (DOI)

  • 10.1007/s00453-009-9335-y

Citation Source

  • Scopus