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 条
  • [41] Processing top-k queries in distributed hash tables
    Akbarinia, Reza
    Pacitti, Esther
    Valduriez, Patrick
    EURO-PAR 2007 PARALLEL PROCESSING, PROCEEDINGS, 2007, 4641 : 489 - +
  • [42] Scalable blind search and broadcasting over distributed hash tables
    Vishnevsky, Vladimir
    Safonov, Alexander
    Yakimov, Mikhail
    Shim, Eunsoo
    Gelman, Alexander D.
    COMPUTER COMMUNICATIONS, 2008, 31 (02) : 292 - 303
  • [43] Security considerations for peer-to-peer distributed hash tables
    Sit, E
    Morris, R
    PEER-TO-PEER SYSTEMS, 2002, 2429 : 261 - 269
  • [44] Survey on hierarchical routing schemes in “flat” distributed hash tables
    Dmitry Korzun
    Andrei Gurtov
    Peer-to-Peer Networking and Applications, 2011, 4 : 346 - 375
  • [45] Controlling incoming connections using certificates and distributed hash tables
    Lagutin, Dmitrij
    Kari, Hannu H.
    NEXT GENERATION TELETRAFFIC AND WIRED/WIRELESS ADVANCED NETWORKING, PROCEEDINGS, 2007, 4712 : 455 - +
  • [46] Domus - An architecture for cluster-oriented Distributed Hash Tables
    Rufino, Jose
    Pina, Antonio
    Alves, Albano
    Exposto, Jose
    PARALLEL PROCESSING AND APPLIED MATHEMATICS, 2006, 3911 : 296 - 303
  • [47] Load balancing in hypercubic distributed hash tables with heterogeneous processors
    Liu, JN
    Adler, M
    ALGORITHMS ESA 2004, PROCEEDINGS, 2004, 3221 : 496 - 507
  • [48] Secure bootstrapping of distributed hash tables in dynamic wireless networks
    Cheng, L.
    Jean, K.
    Ocampo, R.
    Galis, A.
    Kersch, P.
    Szabo, R.
    2007 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-14, 2007, : 1917 - +
  • [49] Expressive Query Support for Multidimensional Data in Distributed Hash Tables
    Malensek, Matthew
    Pallickara, Sangmi Lee
    Pallickara, Shrideep
    2012 IEEE/ACM FIFTH INTERNATIONAL CONFERENCE ON UTILITY AND CLOUD COMPUTING (UCC 2012), 2012, : 31 - 38
  • [50] Performance management of Peer-to-Peer distributed hash tables
    Doyen, G
    Nataf, E
    Festor, O
    EUNICE 2005: NETWORKS AND APPLICATIONS TOWARDS A UBIQUITOUSLY CONNECTED WORLD, 2006, 196 : 233 - 246