z-logo
Premium
List of contributors
Author(s) -
François Fredricx
Publication year - 2014
Publication title -
the international journal of health planning and management
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.672
H-Index - 41
eISSN - 1099-1751
pISSN - 0749-6753
DOI - 10.1002/hpm.2241
Subject(s) - citation , information retrieval , computer science , library science , world wide web
Data expiration is an essential component of data warehousing solutions: whenever large amounts of data are repeatedly collected over a period of time, it is essential to have a clear approach to identifying parts of the data nolonger needed and a policy that allows disposing and/or archiving these parts of the data. Such policies are necessary even if adding storage to accommodate an ever-growing collection of data were possible, since the growing amount of data needs to be examined during querying and in turn leads to deterioration of query performance over time. The approaches to data expiration range from ad-hoc administrative policies or regulations to sophisticated data analysis-based techniques. The approaches have, however, one thing in common: intuitively, they try to identify the parts of the data collection that are not needed in the future. The key to deciding if a piece of information will be needed in the future lies in identifying what queries can be asked over the collection of data and how the collection can evolve from its current state. The various techniques proposed in the literature differ in the way they identify parts of data no longer needed. This chapter formalizes the notion of data expiration in terms of how the data is used to answer queries. We survey existing approaches to the problem in a unified framework and discuss their features and limits, and the limits of data expiration based techniques in general. The particular focus of the chapter is on comparing the space performance of various data expiration methods.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here