Soft kinetic data structures

Document Type

Conference Proceeding

Publication Date

12-1-2001

Abstract

We introduce the framework of soft kinetic data structures (SKDS). A soft kinetic data structure is an approximate data structure that can be used to answer guéries on a set of moving objects with unpredictable motion. We analyze the guality of a soft kinetic data structure by giving a competitive analysis with respect to the dynamics of the system. We illustrate our approach by presenting soft kinetic data structures for maintaining classical data structures: sorted arrays, balanced search trees, heaps, and range trees. We also describe soft kinetic data structures for maintaining the Euclidean minimum spanning trees. Copyright © 2009 ACM, Inc.

Identifier

64049112220 (Scopus)

ISBN

[0898714907]

Publication Title

Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms

First Page

865

Last Page

872

This document is currently not available here.

Share

COinS