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 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.

[1]  Ronald L. Graham,et al.  Bounds for certain multiprocessing anomalies , 1966 .

[2]  Hector Garcia-Molina,et al.  Wave-indices: indexing evolving databases , 1997, SIGMOD '97.

[3]  György Turán,et al.  On the performance of on-line algorithms for partition problems , 1989, Acta Cybern..

[4]  Yuval Rabani,et al.  A Better Lower Bound for On-Line Scheduling , 1994, Inf. Process. Lett..

[5]  Tommy R. Jensen,et al.  Graph Coloring Problems , 1994 .

[6]  Jennifer Widom,et al.  Research problems in data warehousing , 1995, CIKM '95.

[7]  Jan Pedersen.  Optimizations for Dynamic Inverted Index Maintenance Inverted Indices , 1990 .

[8]  Wayne Goddard,et al.  Coloring with defect , 1997, SODA '97.

[9]  Jeffery R. Westbrook,et al.  Load Balancing for Response Time , 1995, J. Algorithms.

[10]  Frank Thomson Leighton,et al.  Efficient Algorithms for Dynamic Allocation of Distributed Memory , 1999, Algorithmica.

[11]  Amos Fiat,et al.  New algorithms for an ancient scheduling problem , 1992, STOC '92.

[12]  Noga Alon,et al.  Explicit construction of linear sized tolerant networks , 1988, Discret. Math..

[13]  Frank Thomson Leighton,et al.  Efficient algorithms for dynamic allocation of distributed memory , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[14]  Yossi Azar,et al.  On-line load balancing , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[15]  Amos Fiat,et al.  On-line load balancing with applications to machine scheduling and virtual circuit routing , 1993, STOC.

[16]  Gerhard J. Woeginger,et al.  New lower and upper bounds for on-line scheduling , 1994, Oper. Res. Lett..

[17]  Hector Garcia-Molina,et al.  Building a scalable and accurate copy detection mechanism , 1996, DL '96.

[18]  Bala Kalyanasundaram,et al.  On-Line Load Balancing of Temporary Tasks , 1997, J. Algorithms.

[19]  W. Bruce Croft,et al.  Fast Incremental Indexing for Full-Text Information Retrieval , 1994, VLDB.

[20]  Gerhard J. Woeginger,et al.  A Lower Bound for Randomized On-Line Scheduling Algorithms , 1994, Information Processing Letters.

[21]  Hector Garcia-Molina,et al.  SIFT - a Tool for Wide-Area Information Dissemination , 1995, USENIX.

[22]  Hector Garcia-Molina,et al.  Incremental updates of inverted lists for text document retrieval , 1994, SIGMOD '94.

[23]  David R. Karger,et al.  A better algorithm for an ancient scheduling problem , 1994, SODA '94.

[24]  Bala Kalyanasundaram,et al.  On-Line Load Balancing of Temporary Tasks , 1993, J. Algorithms.

[25]  B. Awerbuch,et al.  Load Balancing in the Lp Norm , 1995, FOCS 1995.