Design of a New Distributed NoSQL Database with Distributed Hash Tables

被引:0
|
作者
San Roman Guzman, Agustin [1 ]
Valdeolmillos, Diego [1 ]
Rivas, Alberto [1 ]
Gonzalez Arrieta, Angelica [1 ]
Chamoso, Pablo [1 ]
机构
[1] Univ Salamanca, BISITE Res Grp, Calle Espejo 2, Salamanca 37007, Spain
关键词
NoSQL; distributed; decentralized; availability; scalability;
D O I
10.1093/jigpal/jzab003
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Databases play a fundamental role in today's world, being used by most companies, especially those that offer services through the Internet. Today there is a wide variety of database models, each adapted for use according to the specific requirements of each application. Traditionally, the relational models with centralized architectures have been used mostly due to their simplicity and general-purpose query language, which made relational systems suitable for almost any application. However, with the growth of the Internet in recent decades, both in the number of users and in the amount of information, those centralized models began to suffer availability and scalability issues. To address those issues, the use of decentralized architectures and alternative database models began to arise, eventually replacing relational databases and centralized architectures when the requirements on availability and scalability are high. Those database models alternative to the traditional relational model are grouped under the name of NoSQL (Not only Structured Query Language). In this article, we present a NoSQL database developed as an end of degree work, with a flexible data model based on documents and a fully decentralized architecture based on the Gossip protocol for node discovery and a distributed hash table, in particular the rendezvous hashing algorithm, used to distribute and replicate the data across all the nodes. The main goals of the system are to achieve high availability (the data should be almost always accessible) and high scalability (the system should be able to scale by increasing the number of nodes to increase its capacity both on data and number of users). High availability is achieved thanks to the replication of the data, while high scalability is achieved by its decentralized architecture, which allows multiple entry points from the requests, and the data distribution, effectively increasing the database capacity by increasing the number of nodes.
引用
收藏
页码:566 / 577
页数:12
相关论文
共 50 条
  • [21] Information Dissemination in Distributed Organic Computing Systems with Distributed Hash Tables
    Roth, Michael
    Schmitt, Julia
    Kluge, Florian
    Ungerer, Theo
    15TH IEEE INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE AND ENGINEERING (CSE 2012) / 10TH IEEE/IFIP INTERNATIONAL CONFERENCE ON EMBEDDED AND UBIQUITOUS COMPUTING (EUC 2012), 2012, : 554 - 561
  • [22] Auto-adaptive distributed hash tables
    Dury, A
    2005 6TH INTERNATIONAL WORKSHOP ON GRID COMPUTING (GRID), 2005, : 268 - 273
  • [23] Dynamic load balancing in distributed hash tables
    Bienkowski, M
    Korzeniowski, M
    der Heide, FMA
    PEER-TO-PEER SYSTEMS IV, 2005, 3640 : 217 - 225
  • [24] Atomic data access in distributed hash tables
    Lynch, N
    Malkhi, D
    Ratajczak, D
    PEER-TO-PEER SYSTEMS, 2002, 2429 : 295 - 305
  • [25] Reliability and load balancing in distributed Hash tables
    Rieche, S
    Niedermayer, H
    Götz, S
    Wehrle, K
    PEER-TO-PEER SYSTEMS AND APPLICATIONS, 2005, 3485 : 119 - 135
  • [26] Simple load balancing for distributed hash tables
    Byers, J
    Considine, J
    Mitzenmacher, M
    PEER-TO-PEER SYSTEMS II, 2003, 2735 : 80 - 87
  • [27] Multiple Choice Tries and Distributed Hash Tables
    Devroye, Luc
    Lugosi, Gabor
    Park, Gahyun
    Szpankowski, Wojciech
    RANDOM STRUCTURES & ALGORITHMS, 2009, 34 (03) : 337 - 367
  • [28] Multiple Choice Tries and Distributed Hash Tables
    Devroye, Luc
    Lugosi, Gabor
    Park, Gahyun
    Szpankowski, Wojciech
    PROCEEDINGS OF THE EIGHTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2007, : 891 - +
  • [29] PaxonDHT: Achieving consensus in distributed hash tables
    Temkow, B
    Bosneag, AM
    Li, XJ
    Brockmeyer, M
    INTERNATIONAL SYMPOSIUM ON APPLICATIONS AND THE INTERNET , PROCEEDINGS, 2006, : 236 - +
  • [30] Enhanced distributed hash tables for complex queries
    Garg, Pankaj
    Kumar, Amit
    Saran, Huzur
    2006 1ST INTERNATIONAL CONFERENCE ON COMMUNICATION SYSTEMS SOFTWARE & MIDDLEWARE, VOLS 1 AND 2, 2006, : 514 - +