Efficient Maintenance of Ephemeral Data

Research output: Contribution to book/anthology/report/conference proceedingArticle in proceedingResearchpeer-review


Motivated by the increasing prominence of loosely-coupled systems, such as mobile and sensor networks, the characteristics of which include intermittent connectivity and volatile data, we study the tagging of data with so-called expiration times. More specifically, when data are inserted into a database, they may be stamped with time values indicating when they expire, i.e., when they are regarded as stale or invalid and thus are no longer considered part of the database. In a number of applications, expiration times are known and can be assigned at insertion time. We present data structures and algorithms for online management of data stamped with expiration times. The algorithms are based on fully functional treaps, which are a combination of binary search trees with respect to a primary attribute and heaps with respect to a secondary attribute. The primary attribute implements primary keys, and the secondary attribute stores expiration times in a minimum heap, thus keeping a priority queue of tuples to expire. A detailed and comprehensive experimental study demonstrates the well-behavedness and scalability of the approach as well as its efficiency with respect to a number of competitors.
Original languageEnglish
Title of host publicationProceedings of the Eleventh International Conference on Database Systems for Advanced Applications
Publication date2006
ISBN (Print)3540333371
Publication statusPublished - 2006
EventInternational Conference on Database Systems for Advanced Applications - Singapore, Singapore
Duration: 12 Apr 200615 Apr 2006
Conference number: 11


ConferenceInternational Conference on Database Systems for Advanced Applications
SeriesLecture Notes in Computer Science


Dive into the research topics of 'Efficient Maintenance of Ephemeral Data'. Together they form a unique fingerprint.

Cite this