System Architecture and Data Allocation/Coordination Technologies of Autonomous Decentralized Database System for High Assurance

Author(s):  
Carlos Perez-Leguizamo ◽  
J.S. Guadalupe Godinez-Borja
Author(s):  
Amita Goyal Chin

In a distributed database system, an increase in workload typically necessitates the installation of additional database servers followed by the implementation of expensive data reorganization strategies. We present the Partial REALLOCATE and Full REALLOCATE heuristics for efficient data reallocation. Complexity is controlled and cost minimized by allowing only incremental introduction of servers into the distributed database system. Using first simple examples and then, a simulator, our framework for incremental growth and data reallocation in distributed database systems is shown to produce near optimal solutions when compared with exhaustive methods.


2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
Arjan Singh ◽  
Karanjeet Singh Kahlon ◽  
Rajinder Singh Virk

Allocation of data is one of the key design issues of distributed database. A major cost of query execution in a distributed database system is the data transfer cost from one site to another site. The allocation of fragments among the different sites over the network plays an important role in performance of the distributed database system. The main objective of a data allocation in distributed database is to place the data fragments at different sites in such a way, so that the total data transfer cost can be minimized while executing a set of queries. In this paper, a new biogeography-based optimization (BBO) algorithm has been used to allocate the fragments during the design of distributed database system. The goal of this paper is to design a fragments allocation algorithm, so that the total data transmission cost can be minimized. To show the performance of proposed algorithm, results of biogeography-based optimization algorithm for data allocation are compared with genetic algorithm.


Author(s):  
Amita Goyal Chin

In a distributed database system, an increase in workload typically necessitates the installation of additional database servers followed by the implementation of expensive data reorganization strategies. We present the Partial REALLOCATE and Full REALLOCATE heuristics for efficient data reallocation. Complexity is controlled and cost minimized by allowing only incremental introduction of servers into the distributed database system. Using first simple examples and then, a simulator, our framework for incremental growth and data reallocation in distributed database systems is shown to produce near optimal solutions when compared with exhaustive methods.


2011 ◽  
Vol 268-270 ◽  
pp. 898-903
Author(s):  
Xiao Feng Li ◽  
Yuan Xin Tang ◽  
Cui Cui Gong

The distributed database system is the product that the database system combines with the computer network system. The data distribution problem has great influence on distributed database application system improvement, data availability, the efficiency and reliability of the distributed database. The allocation strategies in this paper have used some excellent properties in genetic algorithms, including higher parallelism and robustness, the realization of standard way, and to maintain good balance between the depth prior search and breadth prior search, etc, so the allocation strategies in this article's have high execution efficiency, with stronger ability in seeking the best global solution and easy to realize.


2002 ◽  
Vol 143 (1-4) ◽  
pp. 13-45 ◽  
Author(s):  
Mehmet Emin Dönderler ◽  
Özgür Ulusoy ◽  
Uğur Güdükbay

Author(s):  
Abhinav Jadon ◽  
Zachary T. Williams ◽  
Connor Kafka ◽  
Hannah Rotta ◽  
Sumit Roy ◽  
...  

1989 ◽  
Vol 48 (2) ◽  
pp. 135-155 ◽  
Author(s):  
Shun'ichi Torii ◽  
Keiji Kojima ◽  
Seiichi Yoshizumi ◽  
Akiharu Sakata ◽  
Yoshifumi Takamoto ◽  
...  

2011 ◽  
Vol 63-64 ◽  
pp. 299-304
Author(s):  
Xin Ai Song ◽  
Tian Shi Liu ◽  
Liu Mei Zhang

In intelligence materials system, sensor nodes may typically scattered around the targeted surveillance area. Therefore, all nodes within such network are responsible for collect and route data from sensors to receivers. Along with the development of intelligent materials databases, communication speed and efficiency may strongly affect the performance of distributed multi-database system. This paper firstly introduces a p2p distributed multi-database system architecture and its characteristics, moreover explains the node communication mechanism. Secondly, it proposes a protocol with its 4-layer structure and respectively explains the layer design ideas and functionalities. Finally, by analyzing the transmission efficiency and speed, the paper proposes the practicability and validity of protocol.


2019 ◽  
Vol 7 (7) ◽  
pp. 351-359
Author(s):  
Yashraj Sharma ◽  
Yashasvi Sharma

On the basis of reliability, rational models are useful but not in terms of systems which involve huge amount of data; in such cases, non-relational models are much more useful. To store large chunks of data, NoSQL databases are used. NoSQL databases are scalable and wide ranged because they are non-relationally distributed. In relational databases, it was not possible to manage data which involved very large number of Big Data applications hence the concept of NoSQL database was introduced. There are a lot of advantages of NoSQL which not only involve its own features but also some features of relational database management system. The severe benefit of NoSQL database is that it is an open source system which helps to adapt many numbers of features for newly generated applications. This paper is focused on understanding the concepts of non-relational database system architecture with relational database system architecture and figure out the advantages and disadvantages of both simultaneously.


Sign in / Sign up

Export Citation Format

Share Document