-
2
-
-
85084160673
-
Venti: A new approach to archival data storage
-
S. Quinlan and S. Dorward, "Venti: A New Approach to Archival Data Storage, " in FAST, 2002.
-
(2002)
FAST
-
-
Quinlan, S.1
Dorward, S.2
-
3
-
-
47749140025
-
Bigtable: A distributed storage system for structured data
-
F. Chang, J. Dean, S. Ghemawat, W. C. Hsieh, D. A. Wallach, M. Burrows, T. Chandra, A. Fikes, and R. E. Gruber, "Bigtable: A Distributed Storage System for Structured Data, " in OSDI, 2006.
-
(2006)
OSDI
-
-
Chang, F.1
Dean, J.2
Ghemawat, S.3
Hsieh, W.C.4
Wallach, D.A.5
Burrows, M.6
Chandra, T.7
Fikes, A.8
Gruber, R.E.9
-
4
-
-
84991957861
-
Design tradeoffs for SSD performance
-
N. Agrawal, V. Prabhakaran, T. Wobber, J. Davis, M. Manasse, and R. Panigrahy, "Design Tradeoffs for SSD Performance, " in USENIX, 2008.
-
(2008)
USENIX
-
-
Agrawal, N.1
Prabhakaran, V.2
Wobber, T.3
Davis, J.4
Manasse, M.5
Panigrahy, R.6
-
5
-
-
27344441029
-
Algorithms and data structures for flash memories
-
E. Gal and S. Toledo, "Algorithms and Data Structures for Flash Memories, " in ACM Computing Surveys, vol. 37, no. 2, 2005.
-
(2005)
ACM Computing Surveys
, vol.37
, Issue.2
-
-
Gal, E.1
Toledo, S.2
-
6
-
-
67650065541
-
DFTL: A flash translation layer employing demand-based selective caching of page-level address mappings
-
A. Gupta, Y. Kim, and B. Urgaonkar, "DFTL: A Flash Translation Layer Employing Demand-Based Selective Caching of Page-Level Address Mappings, " in ASPLOS, 2009.
-
(2009)
ASPLOS
-
-
Gupta, A.1
Kim, Y.2
Urgaonkar, B.3
-
7
-
-
85075012374
-
BPLRU: A buffer management scheme for improving random writes in flash storage
-
H. Kim and S. Ahn, "BPLRU: A Buffer Management Scheme for Improving Random Writes in Flash Storage, " in FAST, 2008.
-
(2008)
FAST
-
-
Kim, H.1
Ahn, S.2
-
8
-
-
70449694274
-
Flashing up the storage layer
-
I. Koltsidas and S. Viglas, "Flashing Up the Storage Layer, " in VLDB, 2008.
-
(2008)
VLDB
-
-
Koltsidas, I.1
Viglas, S.2
-
9
-
-
70849083382
-
Online maintenance of very large random samples on flash storage
-
S. Nath and P. Gibbons, "Online Maintenance of Very Large Random Samples on Flash Storage, " in VLDB, 2008.
-
(2008)
VLDB
-
-
Nath, S.1
Gibbons, P.2
-
10
-
-
79960029416
-
FlashStore: High throughput persistent key-value store
-
B. Debnath, S. Sengupta, and J. Li, "FlashStore: High Throughput Persistent Key-Value Store, " in VLDB, 2010.
-
(2010)
VLDB
-
-
Debnath, B.1
Sengupta, S.2
Li, J.3
-
11
-
-
80052401250
-
ChunkStash: Speeding up inline deduplication using flash memory
-
B. Debnath, S. Sengupta, and J. Li, "ChunkStash: Speeding Up Inline Deduplication Using Flash Memory, " in USENIX ATC, 2010.
-
(2010)
USENIX ATC
-
-
Debnath, B.1
Sengupta, S.2
Li, J.3
-
12
-
-
79959924575
-
SkimpyStash: A RAM space skimpy key-value store on flash-based storage
-
B. Debnath, S. Sengupta, and J. Li, "SkimpyStash: A RAM Space Skimpy Key-Value Store on Flash-based Storage, " in SIGMOD, 2011.
-
(2011)
SIGMOD
-
-
Debnath, B.1
Sengupta, S.2
Li, J.3
-
13
-
-
80051910990
-
-
Iometer. http://www.iometer.org/.
-
Iometer
-
-
-
15
-
-
0028092498
-
Balanced allocations
-
Y. Azar, A. Broder, A. Karlin, and E. Upfal, "Balanced Allocations, " in SIAM Journal on Computing, 1994.
-
(1994)
SIAM Journal on Computing
-
-
Azar, Y.1
Broder, A.2
Karlin, A.3
Upfal, E.4
-
16
-
-
70849094136
-
FlashLogging: Exploiting flash devices for synchronous logging performance
-
S. Chen, "FlashLogging: Exploiting Flash Devices for Synchronous Logging Performance, " in SIGMOD, 2009.
-
(2009)
SIGMOD
-
-
Chen, S.1
-
18
-
-
83455207833
-
Microhash: An efficient index structure for flash-based sensor devices
-
D. Zeinalipour-yazti, S. Lin, V. Kalogeraki, D. Gunopulos, and W. A. Najjar, "Microhash: An Efficient Index Structure for Flash-based Sensor Devices, " in FAST, 2005.
-
(2005)
FAST
-
-
Zeinalipour-Yazti, D.1
Lin, S.2
Kalogeraki, V.3
Gunopulos, D.4
Najjar, W.A.5
-
19
-
-
84966471061
-
-
Samsung SSD. http://www.samsung.com/global/business/semiconductor/ productInfo.do?fmly-id=161&partnum=MCCOE64G5MPP.
-
Samsung SSD
-
-
-
21
-
-
85066881368
-
Avoiding the disk bottleneck in the data domain deduplication file system
-
B. Zhu, K. Li, and H. Patterson, "Avoiding the Disk Bottleneck in the Data Domain Deduplication File System, " in FAST, 2008.
-
(2008)
FAST
-
-
Zhu, B.1
Li, K.2
Patterson, H.3
-
22
-
-
84933071250
-
Sparse indexing: Large scale, inline deduplication using sampling and locality
-
M. Lillibridge, K. Eshghi, D. Bhagwat, V. Deolalikar, G. Trezise, and P. Camble, "Sparse Indexing: Large Scale, Inline Deduplication Using Sampling and Locality, " in FAST, 2009.
-
(2009)
FAST
-
-
Lillibridge, M.1
Eshghi, K.2
Bhagwat, D.3
Deolalikar, V.4
Trezise, G.5
Camble, P.6
-
23
-
-
80051911846
-
-
MurmurHash Fuction. http://en.wikipedia.org/wiki/MurmurHash.
-
MurmurHash Fuction
-
-
-
24
-
-
78149371810
-
Cache-, hash-, and space-efficient bloom filters
-
F. Putze, P. Sanders, and J. Singler, "Cache-, Hash-, and Space-Efficient Bloom Filters, " ACM Journal of Experimental Algorithmics, vol. 14, 2009.
-
(2009)
ACM Journal of Experimental Algorithmics
, vol.14
-
-
Putze, F.1
Sanders, P.2
Singler, J.3
-
25
-
-
0028428699
-
An algorithm for approximate membership checking with application to password security
-
U. Manber and S. Wu, "An algorithm for approximate membership checking with application to password security, " Information Processing Letters, vol. 50, no. 4, 1994.
-
(1994)
Information Processing Letters
, vol.50
, Issue.4
-
-
Manber, U.1
Wu, S.2
-
26
-
-
72949117506
-
The dynamic bloom filters
-
January
-
D. Guo, J. Wu, H. Chen, Y. Yuan, and X. Luo, "The Dynamic Bloom Filters, " IEEE Transactions on Knowledge and Data Engineering, vol. 22, no. 1, January 2010.
-
(2010)
IEEE Transactions on Knowledge and Data Engineering
, vol.22
, Issue.1
-
-
Guo, D.1
Wu, J.2
Chen, H.3
Yuan, Y.4
Luo, X.5
-
27
-
-
85076745795
-
Cheap and large CAMs for high performance data-intensive networked systems
-
A. Anand, C. Muthukrishnan, S. Kappes, A. Akella, and S. Nath, "Cheap and Large CAMs for High Performance Data-Intensive Networked Systems, " NSDI, 2010.
-
(2010)
NSDI
-
-
Anand, A.1
Muthukrishnan, C.2
Kappes, S.3
Akella, A.4
Nath, S.5
-
28
-
-
72249085354
-
FAWN: A fast array of wimpy nodes
-
D. Andersen, J. Franklin, M. Kaminsky, A. Phanishayee, L. Tan, and V. Vasudevan, "FAWN: A Fast Array of Wimpy Nodes, " in SOSP, 2009.
-
(2009)
SOSP
-
-
Andersen, D.1
Franklin, J.2
Kaminsky, M.3
Phanishayee, A.4
Tan, L.5
Vasudevan, V.6
-
29
-
-
80051864536
-
BloomFlash: Bloom filter on flash-based storage
-
March
-
B. Debnath, S. Sengupta, J. Li, D. Lilja, and D. Du, "BloomFlash: Bloom Filter on Flash-based Storage, " Microsoft Research Technical Report, no. MSR-TR-2010-161, March 2010.
-
(2010)
Microsoft Research Technical Report, No. MSR-TR-2010-161
-
-
Debnath, B.1
Sengupta, S.2
Li, J.3
Lilja, D.4
Du, D.5
-
30
-
-
84985869010
-
Buffered bloom filters on solid state storage
-
September
-
M. Canim, G. Mihaila, B. Bhattacharjee, C. Lang, and K. Ross, "Buffered Bloom Filters on Solid State Storage, " in First International Workshop on Accelerating Data Management Systems Using Modern Processor and Storage Architectures (ADMS), September 2010.
-
(2010)
First International Workshop on Accelerating Data Management Systems Using Modern Processor and Storage Architectures (ADMS)
-
-
Canim, M.1
Mihaila, G.2
Bhattacharjee, B.3
Lang, C.4
Ross, K.5
|