Abstract
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.
Chapter PDF
Similar content being viewed by others
References
Lobry, O., Collet, C., Déchamboux, P.: The VIRTUOSE Distributed Object Store. In: Proceedings of 8th International Workshop on Database and Expert Systems Applications (DEXA 1997), pp. 482–487 (1997)
Stonebraker, M.: The Case for Shared Nothing. Database Engineering 9, 4–9 (1986)
Lo, Y.-L., Hua, K.A., Young, H.C.: GeMDA: A Multidimensional Data Partitioning Technique for Multiprocessor Database Systems. Journal of Distributed and Parallel Databases 9, 211–236 (2001)
DeWitt, D.J., Gray, J.: Parallel Database Systems: The Future of High Performance Database Systems. Communications of the ACM 35, 85–98 (1992)
Ezeife, C.I., Barker, K.: Distributed Object-based Design: Vertical Fragmentation of Classes. Distributed and Parallel Databases 6, 317–350 (1998)
Barker, K., Bhar, S.: A Graphical Approach to Allocating Class Fragments in Distributed Objectbase Systems. In: Distributed and Parallel Databases, pp. 207–239. Kluwer Academic Publishers (2001)
Litwin, W., Neimat, M.-A., Schneider, D.: RP*: A Family of Order Preserving Scalable Distributed Data Structures. In: Proceedings of the 20th International Conference on Very Large Databases, pp. 342–353 (1994)
Litwin, W., Neimat, M.-A., Schneider, D.A.: LH*–A Scalable, Distributed Data Structure. ACM Transactions on Database Systems 21, 480–525 (1996)
Devine, R.: Design and Implementation of DDH: A Distributed Dynamic Hashing Algorithm. In: Lomet, D.B. (ed.) FODO 1993. LNCS, vol. 730, pp. 101–114. Springer, Heidelberg (1993)
Litwin, W., Neimat, M.-A.: High-Availability LH* Schemes with Mirroring. In: International Conference on Cooperating Information Systems, Brussels, pp. 196–205 (1996)
Sapiecha, K., Lukawski, G.: Fault-Tolerant Protocols for Scalable Distributed Data Structures. In: Wyrzykowski, R., Dongarra, J., Meyer, N., Waśniewski, J. (eds.) PPAM 2005. LNCS, vol. 3911, pp. 1018–1025. Springer, Heidelberg (2006)
Ndiaye, Y., Diéne, A.W., Litwin, W., Risch, T.: Scalable Distributed Data Structures for High-Performance Databases. WDAS 9, 45–69 (2000)
Diéne, A.W., Litwin, W.: Performance Measurements of RP*: A Scalable Distributed Data Structure For Range Partitioning. In: Intl. Conf. on Information Society in the 21st Century: Emerging Techn. and New Challenges, Aizu City, Japan (2000)
Lindberg, R.: A Java Implementation of a Highly Available, Scalable and Distributed Data Structure LH*g. Master’s Thesis No: LiTH–IDA–Ex–97/65 (1997)
Hidouci, W.K., Zegour, D.E.: Actor Oriented Databases. WSEAS Transaction on Computers 3, 653–660 (2004)
Bedla, M., Sapiecha, K.: A Store of Java Objects on a Multicomputer. In: Proc. of the 10th International Conference on Enterprise Information Systems (ICEIS), Barcelona, Spain, pp. 374–379 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 IFIP International Federation for Information Processing
About this paper
Cite this paper
Bedla, M., Sapiecha, K. (2012). Scalable Store of Java Objects Using Range Partitioning. In: Szmuc, T., Szpyrka, M., Zendulka, J. (eds) Advances in Software Engineering Techniques. CEE-SET 2009. Lecture Notes in Computer Science, vol 7054. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28038-2_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-28038-2_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28037-5
Online ISBN: 978-3-642-28038-2
eBook Packages: Computer ScienceComputer Science (R0)