Storage Management for Evolving Databases

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 in 24 , we devise efcient 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.

• Type: Conference
• Year: 1997
• Where: FOCS
• Authors: Jon M. Kleinberg, Rajeev Motwani, Prabhakar Raghavan, Suresh Venkatasubramanian
• Keywords: Digital Libraries, FOCS 1997, Problems, Sliding-window Indices, Theoretical Computer Science