Sciweavers

43 search results - page 5 / 9
» Using MEMS-Based Storage in Disk Arrays
Sort
View
PDPTA
2004
13 years 9 months ago
Verification of Parity Data in Large Scale Storage Systems
Highly available storage uses replication and other redundant storage to recover from a component failure. If parity data calculated from an erasure correcting code is not updated...
Thomas J. E. Schwarz
DSN
2004
IEEE
13 years 11 months ago
A Decentralized Algorithm for Erasure-Coded Virtual Disks
A Federated Array of Bricks is a scalable distributed storage system composed from inexpensive storage bricks. It achieves high reliability with low cost by using erasure coding a...
Svend Frølund, Arif Merchant, Yasushi Saito...
VLDB
2004
ACM
143views Database» more  VLDB 2004»
14 years 27 days ago
Clotho: Decoupling memory page layout from storage organization
As database application performance depends on the utilization of the memory hierarchy, smart data placement plays a central role in increasing locality and in improving memory ut...
Minglong Shao, Jiri Schindler, Steven W. Schlosser...
AICCSA
2005
IEEE
112views Hardware» more  AICCSA 2005»
14 years 1 months ago
Multilevel chunking of multidimensional arrays
Multidimensional arrays have become very common in scientific and business applications. Such arrays are usually very large and hence they are stored on secondary or tertiary stor...
A. S. Sawires, Nagwa M. El-Makky, Khalil M. Ahmed
PODS
2006
ACM
216views Database» more  PODS 2006»
14 years 7 months ago
Cache-oblivious string B-trees
B-trees are the data structure of choice for maintaining searchable data on disk. However, B-trees perform suboptimally ? when keys are long or of variable length, ? when keys are...
Michael A. Bender, Martin Farach-Colton, Bradley C...