Online maintenance of very large random samples on flash storage
- 1 August 2008
- journal article
- Published by Association for Computing Machinery (ACM) in Proceedings of the VLDB Endowment
- Vol. 1 (1), 970-983
- https://doi.org/10.14778/1453856.1453961
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- Design of flash-based DBMSPublished by Association for Computing Machinery (ACM) ,2007
- A design for high-performance flash disksACM SIGOPS Operating Systems Review, 2007
- FlashDBPublished by Association for Computing Machinery (ACM) ,2007
- Block recycling schemes and their cost-based optimization in nand flash memory based storage systemPublished by Association for Computing Machinery (ACM) ,2007
- External memory algorithms and data structuresACM Computing Surveys, 2001
- The log-structured merge-tree (LSM-tree)Acta Informatica, 1996
- Skip lists: a probabilistic alternative to balanced treesCommunications of the ACM, 1990
- Random sampling from hash filesACM SIGMOD Record, 1990
- An efficient algorithm for sequential random samplingACM Transactions on Mathematical Software, 1987
- Random sampling with a reservoirACM Transactions on Mathematical Software, 1985