Efficient Maintenance of Ephemeral Data

  • Albrecht Schmidt
  • Christian S. Jensen
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3882)


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.


Sensor Network Hash Table Memory Allocation Database Size Binary Search Tree 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Ailamaki, A., DeWitt, D., Hill, M.: Data page layouts for relational databases on deep memory hierarchies. The VLDB Journal 11, 198–215 (2002)CrossRefMATHGoogle Scholar
  2. 2.
    Arasu, A., Babu, S., Widom, J.: CQL: A Language for Continuous Queries over Streams and Relations. In: Lausen, G., Suciu, D. (eds.) DBPL 2003. LNCS, vol. 2921, pp. 1–19. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  3. 3.
    Bass, L., Clements, P., Kazman, R.: Software Architecture in Practice. Addison-Wesley, Reading (2003)Google Scholar
  4. 4.
    Bernstein, P., Hadzilacos, V., Goodman, N.: Concurrency Control and Recovery in Database Systems. Addison-Wesley, Reading (1987)Google Scholar
  5. 5.
    Codd, E.F.: A Relational Model of Data for Large Shared Data Banks. Comm. ACM 13, 377–387 (1970)CrossRefMATHGoogle Scholar
  6. 6.
    Diwan, A., Tarditi, D., Moss, J.: Memory System Performance of Programs with Intensive Heap Allocation. ACM TOCS 13, 244–273 (1995)CrossRefGoogle Scholar
  7. 7.
    Driscoll, J., Sarnak, N., Sleator, D., Tarjan, R.: Making Data Structures Persistent. Journal of Computer and System Sciences 38, 86–124 (1989)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    Garcia-Molina, H., Labio, W., Yang, J.: Expiring Data in a Warehouse. In: Proc. VLDB, pp. 500–511 (1998)Google Scholar
  9. 9.
    Jensen, C.S.: Vacuuming. The TSQL2 Temporal Query Language, 447–460 (1995)Google Scholar
  10. 10.
    Jensen, C.S., Lomet, D.: Transaction Timestamping in (Temporal) Databases. In: Proc. VLDB, pp. 441–450 (2001)Google Scholar
  11. 11.
    Knuth, D.: The Art of Computer Programming. Sorting and Searching, vol. 3. Addison-Wesley, Reading (1998)MATHGoogle Scholar
  12. 12.
    Lehman, T., Carey, M.: Query Processing in Main Memory Database Management Systems. In: Proc. ACM SIGMOD, pp. 239–250 (1986)Google Scholar
  13. 13.
    Lomet, D., Salzberg, B.: Access Methods for Multiversion Data. In: Proc. ACM SIGMOD, pp. 315–324 (1989)Google Scholar
  14. 14.
    McCreight, E.: Priority Search Trees. SIAM Journal on Computing 14, 257–276 (1985)MathSciNetCrossRefMATHGoogle Scholar
  15. 15.
    Odersky, M., et al.: The Scala Programming Language (2005),
  16. 16.
    Okasaki, C.: Purely Functional Data Structures. Cambridge University Press, Cambridge (1998)CrossRefMATHGoogle Scholar
  17. 17.
    Schmidt, A., Jensen, C.S., Šaltenis, S.: Expiration Times for Data Management. IEEE ICDE ( to appear, 2006)Google Scholar
  18. 18.
    Schmidt, A., Jensen, C.S.: Efficient Management of Short-Lived Data. Technical Report (2005),
  19. 19.
    Seidel, R., Aragon, C.: Randomized Search Trees. Algorithmica 16(4/5), 464–497 (1996)MathSciNetCrossRefMATHGoogle Scholar
  20. 20.
    The World Wide Web Consortium. HTTP - Hypertext Transfer Protocol (2005),
  21. 21.
    Šaltenis, S., Jensen, C.S.: Indexing of Moving Objects for Location-Based Services. In: Proc. IEEE ICDE, pp. 463–472 (2002)Google Scholar
  22. 22.
    Wang, M., Chan, N., Papadimitriou, S., Faloutsos, C., Madhyastha, T.: Data Mining Meets Performance Evaluation: Fast Algorithms for Modeling Bursty Traffic. In: Proc. IEEE ICDE, pp. 507–516 (2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Albrecht Schmidt
    • 1
  • Christian S. Jensen
    • 1
  1. 1.Department of Computer ScienceAalborg UniversityDenmark

Personalised recommendations