scholarly journals Perbandingan Performa Relational, Document-Oriented dan Graph Database Pada Struktur Data Directed Acyclic Graph

2017 ◽  
Vol 8 (2) ◽  
Author(s):  
Pradana Setialana ◽  
Teguh Bharata Adji ◽  
Igi Ardiyanto

Abstract. Directed Acyclic Graph (DAG) is a directed graph which is not cyclic and is usually employed in social network and data genealogy. Based on the characteristic of DAG data, a suitable database type should be evaluated and then chosen as a platform. A performance comparison among relational database (PostgreSQL), document-oriented database (MongoDB), and graph database (Neo4j) on a DAG dataset are then conducted to get the appropriate database type. The performance test is done on Node.js running on Windows 10 and uses the dataset that has 3910 nodes in single write synchronous (SWS) and single read (SR). The access performance of PostgreSQL is 0.64ms on SWS and 0.32ms on SR, MongoDB is 0.64ms on SWS and 4.59ms on SR, and Neo4j is 9.92ms on SWS and 8.92ms on SR. Hence, relational database (PostgreSQL) has better performance in the operation of SWS and SR than document-oriented database (MongoDB) and graph database (Neo4j).Keywords: database performance, directed acyclic graph, relational database, document-oriented database, graph database Abstrak. Directed Acyclic Graph (DAG) adalah graf berarah tanpa putaran yang dapat ditemui pada data jejaring sosial dan silsilah keluarga. Setiap jenis database memiliki performa yang berbeda sesuai dengan struktur data yang ditangani. Oleh karena itu perlu diketahui database yang tepat khususnya untuk data DAG. Tujuan penelitian ini adalah membandingkan performa dari relational database (PostgreSQL), document-oriented database (MongoDB) dan graph database (Neo4j) pada data DAG. Metode yang dilakukan adalah mengimplentasi dataset yang memiliki 3910 node dalam operasi single write synchronous (SWS) dan single read (SR) pada setiap database menggunakan Node.js dalam Windows 10. Hasil pengujian performa PostgreSQL dalam operasi SWS sebesar 0.64ms dan SR sebesar 0.32ms, performa MongoDB pada SWS sebesar 0.64ms dan SR sebesar 4.59ms sedangkan performa Neo4j pada operasi SWS sebesar 9.92ms dan SR sebesar 8.92ms. Hasil penelitian menunjukan bahwa relational database (PostgreSQL) memiliki performa terbaik dalam operasi SWS dan SR dibandingkan document-oriented database (MongoDB) dan graph database (Neo4j).Kata Kunci: performa database, directed acyclic graph, relational database, document-oriented database, graph database

2020 ◽  
Vol 17 (2) ◽  
pp. 1227-1235 ◽  
Author(s):  
Innocent Uzougbo Onwuegbuzie ◽  
Shukor Abd Razak ◽  
Ismail Fauzi Isnin

Routing Protocol for Low-power and Lossy Network (RPL) with IPv6 support is the de facto standard for routing over Low-power and Lossy Network (LLN) called Wireless Sensor Networks (WSN). Objective Functions namely Minimum Rank with Hysteresis Objective Function (MRHOF) and Objective Function Zero (OF0) together with the Internet Control Messaging Protocol (ICMP) control messages, propel RPL to constructs routing paths called Destination Oriented Directed Acyclic Graph (DODAG), for packet routing within the sensor network. To the best knowledge of the authors, no detailed investigation has been carried out to unravel the dynamics of how these control messages impact on the network with respect to DODAG formation right before convergence is attained, particularly from the perspective of MRHOF and OF0. In this paper, the authors investigated the various types of control messages (DODAG Information Solicitation, DODAG Information Object and Destination Advertisement Object) used to setup the DODAG. RPL Simulations was carried out on one 100 nodes, starting with 10 nodes and incremented by 10 until the 100th node. Each simulation was repeated five times with a confidence level of 95%, which statistically signifies a reliable and acceptable confidence interval, for a duration of thirty minutes. Results obtained showed that the DIS–OF0 generated the least packets with 125 packets, followed by DAO–MRHOF with 1357 packets and the most generated; DIO–MRHOF with 1536 packets. Subsequently, MRHOF had higher Convergence Time of 130.67 seconds as to 87.93 seconds for OF0. This information is valuable for both the academia and industry.


2008 ◽  
Vol 58 (2) ◽  
pp. 133
Author(s):  
Ji Eun Seok ◽  
Seon Jeong Min ◽  
Seong Whi Cho ◽  
Ik Won Kang ◽  
Dae Hyun Hwang ◽  
...  

2010 ◽  
Author(s):  
Søren V. Legarth ◽  
Jesper Ramsgaard ◽  
Guillaume Le Ray ◽  
Nick Zacharov

Sign in / Sign up

Export Citation Format

Share Document