Numerical recipes in C (2nd ed.): the art of scientific computing
Numerical recipes in C (2nd ed.): the art of scientific computing
LH: Linear Hashing for distributed files
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Linear hashing: a new tool for file and table addressing
Readings in database systems (2nd ed.)
Distributed file organization with scalable cost/performance
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
EVENODD: An Efficient Scheme for Tolerating Double Disk Failures in RAID Architectures
IEEE Transactions on Computers - Special issue on fault-tolerant computing
IBM Systems Journal
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
Database management systems
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Snowball: Scalable Storage on Networks of Workstations with Balanced Load
Distributed and Parallel Databases
Indexing Techniques for Advanced Database Systems
Indexing Techniques for Advanced Database 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
Distributed RAID - A New Multiple Copy Algorithm
Proceedings of the Sixth International Conference on Data Engineering
COMPCON '96 Proceedings of the 41st IEEE International Computer Conference
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
LH*G: A High-Availability Scalable Distributed Data Structure By Record Grouping
IEEE Transactions on Knowledge and Data Engineering
ADST: An Order Preserving Scalable Distributed Data Structure with Constant Access Costs
SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
A Very Efficient Order Preserving Scalable Distributed Data Structure
DEXA '01 Proceedings of the 12th International Conference on Database and Expert Systems Applications
Reliability Mechanisms for Very Large Storage Systems
MSS '03 Proceedings of the 20 th IEEE/11 th NASA Goddard Conference on Mass Storage Systems and Technologies (MSS'03)
Algebraic Signatures for Scalable Distributed Data Structures
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Research and implementation of management software for SAN based on clustering technology
VRCAI '04 Proceedings of the 2004 ACM SIGGRAPH international conference on Virtual Reality continuum and its applications in industry
An Efficient Data Location Protocol for Self.organizing Storage Clusters
Proceedings of the 2003 ACM/IEEE conference on Supercomputing
LH*RS---a highly-available scalable distributed data structure
ACM Transactions on Database Systems (TODS)
Fault-scalable Byzantine fault-tolerant services
Proceedings of the twentieth ACM symposium on Operating systems principles
LH*RS: a highly available distributed data storage
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
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
EH*RS: a high-availability scalable distributed data structure
ICA3PP'07 Proceedings of the 7th international conference on Algorithms and architectures for parallel processing
Transactions for distributed wikis on structured overlays
DSOM'07 Proceedings of the Distributed systems: operations and management 18th IFIP/IEEE international conference on Managing virtualization of networks and services
A self-organized, fault-tolerant and scalable replication scheme for cloud storage
Proceedings of the 1st ACM symposium on Cloud computing
LH*RSP2P: a fast and high churn resistant scalable distributed data structure for P2P systems
International Journal of Internet Technology and Secured Transactions
SDDSfL vs. local disk-a comparative study for Linux
Annales UMCS, Informatica
Fault-Tolerant protocols for scalable distributed data structures
PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
Self-star Properties in Complex Information Systems
| Hi-index | 0.01 |
LH*RS is a new high-availability Scalable Distributed Data Structure (SDDS). The data storage scheme and the search performance of LH*RS are basically these of LH*. LH*RS manages in addition the parity information to tolerate the unavailability of k ⪈ 1 server sites. The value of k scales with the file, to prevent the reliability decline. The parity calculus uses the Reed -Solomon Codes. The storage and access performance overheads to provide the high-availability are about the smallest possible. The scheme should prove attractive to data-intensive applications.