Storage management for evolving databases
Jon M. Kleinberg, R. Motwani, Prabhakar Raghavan, Suresh Venkatasubramanian · 2002
The problem of maintaining data that arrives continuously over time is increasingly prevalent in databases and digital libraries. Building on a model for sliding window indices developed by N. Shivakumar and H. Garcia-Molina (1997), we devise efficient algorithms for some of the central problems that arise. We also show connections between the problems in this model and some fundamental problems in optimization and graph theory.