从关系数据库到Neo4j的自动图构建方法

I. M. Putrama, P. Martinek
{"title":"从关系数据库到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":"{\"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}","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

摘要

将关系数据库转换为图数据库的研究方法还很少。尽管图形数据库已经配备了用于查询和转换数据的脚本语言,但它仍然需要领域专家花费大量时间来分析源数据库中存在的各种约束。本文提出了一种新的技术,通过提取关系数据库元数据,然后在将实体关系转换为图形之前对它们进行排序,从而帮助实现转换的自动化。为了验证转换结果,将源数据库中的记录总数与图数据库中创建的节点和边的数量进行比较,并使用概率数据结构验证节点属性的一致性。根据我们的测试结果,可以根据源数据库的大小调整测试参数,准确有效地检查它们的完整性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Automated Graph Construction Approach from Relational Databases to Neo4j
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信