Online maintenance of very large random samples on flash storage
暂无分享,去创建一个
[1] Jeffrey Scott Vitter,et al. Random sampling with a reservoir , 1985, TOMS.
[2] Jeffrey Scott Vitter,et al. An efficient algorithm for sequential random sampling , 1987, TOMS.
[3] William Pugh,et al. Skip Lists: A Probabilistic Alternative to Balanced Trees , 1989, WADS.
[4] Ping Xu,et al. Random sampling from hash files , 1990, SIGMOD '90.
[5] Kai Li,et al. Storage alternatives for mobile computers , 1994, OSDI '94.
[6] Chris Jermaine,et al. A Novel Index Supporting High Volume Data Warehouse Insertion , 1999, VLDB.
[7] Srikanta Tirthapura,et al. Estimating simple functions on the union of data streams , 2001, SPAA '01.
[8] Tei-Wei Kuo,et al. An efficient R-tree implementation over flash-memory storage systems , 2003, GIS '03.
[9] Surajit Chaudhuri,et al. Dynamic sample selection for approximate query processing , 2003, SIGMOD '03.
[10] Peter Desnoyers,et al. Capsule: an energy-optimized object storage system for memory-constrained sensor devices , 2006, SenSys '06.
[11] Sang-Won Lee,et al. Design of flash-based DBMS: an in-page logging approach , 2007, SIGMOD '07.
[12] Jongmoo Choi,et al. Block recycling schemes and their cost-based optimization in nand flash memory based storage system , 2007, EMSOFT '07.
[13] Suman Nath,et al. FlashDB: Dynamic Self-tuning Database for NAND Flash , 2007, 2007 6th International Symposium on Information Processing in Sensor Networks.
[14] Michael Isard,et al. A design for high-performance flash disks , 2007, OPSR.
[15] Hyojun Kim,et al. BPLRU: A Buffer Management Scheme for Improving Random Writes in Flash Storage , 2008, FAST.
[16] Rina Panigrahy,et al. Design Tradeoffs for SSD Performance , 2008, USENIX ATC.