2013 IEEE 29th International Conference on Data Engineering (ICDE) (2006)
Apr. 3, 2006 to Apr. 7, 2006
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDE.2006.66
Simonas Saltenis , Aalborg University, Denmark
Christian S. Jensen , Aalborg University, Denmark
Albrecht Schmidt , Aalborg University, Denmark
This paper describes an approach to incorporating the notion of expiration time into data management based on the relational model. Expiration times indicate when tuples cease to be current in a database. The paper presents a formal data model and a query algebra that handle expiration times transparently and declaratively. In particular, expiration times are exposed to users only on insertion and update, and when triggers fire due to the expiration of a tuple; for queries, they are handled behind the scenes and do not concern the user. Notably, tuples are removed automatically from (materialised) query results as they expire in the (base) relations. For application developers, the benefits of using expiration times are leaner application code, lower transaction volume, smaller databases, and higher consistency for replicated data with lower overhead. Expiration times turn out to be especially useful in open architectures and loosely-coupled systems, which abound on the World Wide Web as well as in mobile networks, be it as Web Services or as ad hoc and intermittent networks of mobile devices.
Simonas Saltenis, Christian S. Jensen, Albrecht Schmidt, "Expiration Times for Data Management", 2013 IEEE 29th International Conference on Data Engineering (ICDE), vol. 00, no. , pp. 36, 2006, doi:10.1109/ICDE.2006.66