A case for redundant arrays of inexpensive disks (RAID)
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
LH: Linear Hashing for distributed files
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Distributed operating systems
Distributed file organization with scalable cost/performance
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Distributing a search tree among a growing number of processors
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
The Zebra striped network file system
ACM Transactions on Computer Systems (TOCS)
The HP AutoRAID hierarchical storage system
ACM Transactions on Computer Systems (TOCS) - Special issue on operating system principles
LH*—a scalable, distributed data structure
ACM Transactions on Database Systems (TODS)
Tolerating multiple failures in RAID architectures with optimal storage and uniform declustering
Proceedings of the 24th annual international symposium on Computer architecture
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
LH*RS: a high-availability scalable distributed data structure using Reed Solomon Codes
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
k-RP*s: a scalable distributed data structure for high-performance multi-attribute access
DIS '96 Proceedings of the fourth international conference on on Parallel and distributed information systems
LH*LH: A scalable High Performance Data Structure for Switched Multicomputers
EDBT '96 Proceedings of the 5th International Conference on Extending Database Technology: Advances in Database Technology
Design and Implementation of DDH: A Distributed Dynamic Hashing Algorithm
FODO '93 Proceedings of the 4th International Conference on Foundations of Data Organization and Algorithms
Distributed RAID - A New Multiple Copy Algorithm
Proceedings of the Sixth International Conference on Data Engineering
Chained Declustering: A New Availability Strategy for Multiprocessor Database Machines
Proceedings of the Sixth International Conference on Data Engineering
RP*: A Family of Order Preserving Scalable Distributed Data Structures
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
High-Availability LH* Schemes with Mirroring
COOPIS '96 Proceedings of the First IFCIS International Conference on Cooperative Information Systems
LH*s: a high-availability and high-security scalable distributed data structure
RIDE '97 Proceedings of the 7th International Workshop on Research Issues in Data Engineering (RIDE '97) High Performance Database Management for Large-Scale Applications
Proceedings of the 12th annual ACM international workshop on Geographic information systems
LH*RS---a highly-available scalable distributed data structure
ACM Transactions on Database Systems (TODS)
Building and Querying a P2P Virtual World
Geoinformatica
Indexing distributed complex data for complex queries
dg.o '04 Proceedings of the 2004 annual national conference on Digital government research
Using a distributed quadtree index in peer-to-peer networks
The VLDB Journal — The International Journal on Very Large Data Bases
SPREAD: an adaptive scheme for redundant and fair storage in dynamic heterogeneous storage systems
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Maintaining and checking parity in highly available Scalable Distributed Data Structures
Journal of Systems and Software
| Hi-index | 0.00 |
LH*g is a high-availability extension of the LH* Scalable Distributed Data Structure. An LH*g file scales up with constant key search and insert performance, while surviving any single-site unavailability (failure). We achieve high-availability through a new principle of record grouping. A group is a logical structure of up to k records, where k is a file parameter. Every group contains a parity record allowing for the reconstruction of an unavailable member. The basic scheme may be generalized to support the unavailability of any number of sites, at the expense of storage and messaging. Other known high-availability schemes are static, or require more storage, or provide worse search performance.