Parallel database systems: the future of high performance database systems
Communications of the ACM
LH*—a scalable, distributed data structure
ACM Transactions on Database Systems (TODS)
Distributed Object Based Design: Vertical Fragmentation of Classes
Distributed and Parallel Databases
GeMDA: A Multidimensional Data Partitioning Technique for Multiprocessor Database Systems
Distributed and Parallel Databases
A Graphical Approach to Allocating Class Fragments in Distributed Objectbase Systems
Distributed and Parallel Databases
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
RP*: A Family of Order Preserving Scalable Distributed Data Structures
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
The VIRTUOSE Distributed Object Store
DEXA '97 Proceedings of the 8th International Workshop on Database and Expert Systems Applications
High-Availability LH* Schemes with Mirroring
COOPIS '96 Proceedings of the First IFCIS International Conference on Cooperative Information Systems
Fault-Tolerant protocols for scalable distributed data structures
PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
Scalable Distributed Two-Layer Data Structures SD2DS
International Journal of Distributed Systems and Technologies
| Hi-index | 0.00 |
Scalable Store of Objects (SSO) should allow for storing and maintaining a huge number of objects distributed over many nodes of a network. RP*N is a structure which belongs to a family of order-preserving, Range Partitioning Scalable Distributed Data Structures (RP* SDDS). The architectures of SDDS were designed to store records. Different structures of objects and complicated dependences between objects are the cause that a new architecture for RP* is needed. The paper describes a new object-oriented version of RP*N architecture and its implementation for Java objects. This version can be used in a fast and scalable store of Java objects. Performance of the implementation is evaluated and compared with serialization of objects on a disk and storing objects as a main-memory collection.