论文信息 - Cache-Oblivious Persistence

Cache-Oblivious Persistence

Partial persistence is a general transformation that takes a data structure and allows queries to be executed on any past state of the structure. The cache-oblivious model is the leading model of a modern multi-level memory hierarchy. We present the first general transformation for making cache-oblivious model data structures partially persistent.

[1] Robert E. Tarjan,et al. The pairing heap: A new form of self-adjusting heap , 2005, Algorithmica.

[2] Richard Cole,et al. Exponential Structures for Efficient Cache-Oblivious Algorithms , 2002, ICALP.

[3] R. Bayer,et al. Organization and maintenance of large ordered indices , 1970, SIGFIDET '70.

[4] Jing Wu,et al. A locality-preserving cache-oblivious dynamic dictionary , 2002, SODA '02.

[5] Robert E. Tarjan,et al. Making data structures persistent , 1986, STOC '86.

[6] Charles E. Leiserson,et al. Cache-Oblivious Algorithms , 2003, CIAC.

[7] John Iacono,et al. Confluent persistence revisited , 2011, SODA.

[8] Rudolf Bayer,et al. Organization and maintenance of large ordered indexes , 1972, Acta Informatica.

[9] Kostas Tsichlas,et al. Fully persistent B-trees , 2012, SODA.

[10] Robert E. Tarjan,et al. Planar point location using persistent search trees , 1986, CACM.

[11] Haim Kaplan,et al. Making data structures confluently persistent , 2001, SODA '01.

[12] Robert E. Tarjan,et al. Efficiency of a Good But Not Linear Set Union Algorithm , 1972, JACM.

[13] Robert E. Tarjan,et al. Self-adjusting binary search trees , 1985, JACM.

[14] Erik D. Demaine,et al. Retroactive data structures , 2007, TALG.

[15] Michael A. Bender,et al. Cache-Oblivious B-Trees , 2005, SIAM J. Comput..