{"title":"An Automated Graph Construction Approach from Relational Databases to Neo4j","authors":"I. M. Putrama, P. Martinek","doi":"10.1109/CINTI-MACRo57952.2022.10029438","DOIUrl":null,"url":null,"abstract":"There are still few research methods proposed to convert relational databases to graph databases. Although a graph database has been equipped with a scripting language to use for querying and converting the data, it still requires time-consuming efforts by the domain expert to analyze the various constraints present in the source database. This paper proposes a novel technique to help automate the conversion by extracting relational database metadata and then sorting the entity relationships before converting them into graphs. To validate the conversion results, the total number of records in the source database with the number of nodes and edges created in the graph database are compared, and the node properties are validated for consistency using a probabilistic data structure. Based on our test results, their completeness can be checked accurately and efficiently with test parameters that can be adjusted according to the size of the source database.","PeriodicalId":18535,"journal":{"name":"Micro","volume":"64 6","pages":"000131-000136"},"PeriodicalIF":0.0000,"publicationDate":"2022-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Micro","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CINTI-MACRo57952.2022.10029438","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
There are still few research methods proposed to convert relational databases to graph databases. Although a graph database has been equipped with a scripting language to use for querying and converting the data, it still requires time-consuming efforts by the domain expert to analyze the various constraints present in the source database. This paper proposes a novel technique to help automate the conversion by extracting relational database metadata and then sorting the entity relationships before converting them into graphs. To validate the conversion results, the total number of records in the source database with the number of nodes and edges created in the graph database are compared, and the node properties are validated for consistency using a probabilistic data structure. Based on our test results, their completeness can be checked accurately and efficiently with test parameters that can be adjusted according to the size of the source database.