检索结果-内蒙古大学图书馆

A Common Information Model Oriented graph database Framework for Power Systems

IEEE TRANSACTIONS ON POWER SYSTEMS 2017年第4期32卷 2560-2569页

作者： Ravikumar, Gelli Khaparde, Shrikrishna A. Indian Inst Technol Dept Elect Engn Bombay 400076 Maharashtra India

Common Information Model (CIM) is widely adopted by many utilities since it offers interoperability through standard information models. Storing, processing, retrieving, and providing concurrent access of the large power network models to the various power system applications in CIM framework are the current challenges faced by utility operators. As the power network models resemble largely connected-data sets, the design of CIM oriented database has to support high-speed data retrieval of the connected-data and efficient storage for processing. The graph database is gaining wide acceptance for storing and processing of largely connected-data for various applications. This paper presents a design of CIM oriented graph database (CIMGDB) for storing and processing the largely connected-data of power system applications. Three significant advantages of the CIMGDB are efficient data retrieval and storage, agility to adapt dynamic changes in CIM profile, and greater flexibility of modeling CIM unified modeling language (UML) in GDB. The CIMGDB does not need a predefined database schema. Therefore, the CIM semantics needs to be added to the artifacts of GDB for every instance of CIM objects storage. A CIM based object-graph mapping methodology is proposed to automate the process. An integration of CIMGDB and power system applications is discussed by an implementation architecture. The data-intensive network topology processing (NTP) is implemented, and demonstrated for six IEEE test networks and one practical 400 kV Maharashtra network. Results such as computation time of executing network topology processing evaluate the performance of the CIMGDB.

关键词： CIM graph database network topology processing (NTP) and power system network models

来源：评论

学校读者我要写书评

暂无评论

graph database Indexing Layer for Logic-Based Tree Pattern Matching Over Intensional XML Document databases 18th

Graph Database Indexing Layer for Logic-Based Tree Pattern M...

引用

18th International Conference on Computational Science and Its Applications (ICCSA)

作者： Alrefae, Abdullah Cao, Jinli Pardede, Eric La Trobe Univ Dept Comp Sci & Informat Technol Melbourne Vic 3086 Australia

ISBN: (纸本)9783319951713;9783319951706

Most XML query evaluation approaches are based on the technique of tree pattern query matching (TPQ) to find similar occurrences of the query's path and conditions. Mainly, two types of constraints are matched to evaluate a given query, including hierarchical structure constraints and value-based constraints. However, TPQ technique falls short when it comes to matching the logic-based constraints and non-hierarchical relationships between nodes and entities in the XML document and database. In this paper, we overcome this shortage by providing an abstract graph database layer that provides a logic-based graph relational model to inspect and resolve the logics of the query to choose most relevant nodes in the XML document. Only the subtrees of the relevant nodes will be traversed in the document and the other subtrees will be skipped. We propose the application of graph database as an indexing layer that defines conceptual linking between database entities, beside logic-based assertions and constraints to evaluate XML queries over this layer to find most related entities and traverse only their related nodes in the XML document. In addition, we propose a mapping criteria and algorithm between XQuery and Cypher, which is a query language for Neo4j graph database.

关键词： Intensional XML Tree pattern query (TPQ) graph database Logic-based constraints Neo4j

来源：评论

学校读者我要写书评

暂无评论

graph database: A Case Study for Detecting Fraud in acquisition of Brazilian Government 12

Graph Database: A Case Study for Detecting ...

引用

12th Iberian Conference on Information Systems and Technologies (CISTI)

作者： Van Erven, Gustavo C. G. Carvalho, Rommel Novaes de Holanda, Maristela Terto Ralha, Celia Minist Transparencia Fiscalizacao & Controladoria Diretoria Pesquisas & Informacoes Estrateg Brasilia DF Brazil Univ Brasilia Dept Ciencia Comp Brasilia DF Brazil

ISBN: (纸本)9781509050475

Procurement is one of the main forms of acquisition of the Federal Government and are subject to fraud and corruption. In this context, many institutions such as the Brazilian Office of the Controller General try to identify fraud evidences, e.g., use of queries in databases with information about partnership of companies owned by the same group of people to simulate competition. However, many of these queries are manual or limited by the use of information systems databases. This paper explore the benefits of using graph NoSQL databases to identify the relationships between companies to detect fraud in procurement. A case study was carried out to validate the use of NoSQL databases using companies' partnership information based on queries defined by the CGU's auditors.

关键词： graph database Fraud Detection NoSQL Relational database

来源：评论

学校读者我要写书评

暂无评论

graph database Approach for Data Storing, Presentation and Manipulation 42

Graph Database Approach for Data Storing, Presentation and M...

引用

42nd International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO)

作者： Fosic, I. Solic, K. HEP Telekomunikacije Doo Osijek Croatia JJ Strossmayer Univ Osijek Fac Med Osijek Croatia

ISBN: (纸本)9789532330984

An increasing number of IoT systems and a generation of unstructured data make it difficult to choose and apply a suitable database model. Using a NoSQL database on a test data model shows the advantages of storing, manipulating, and presenting the required data. A test data model was created on a relational database and on a graph database to compare the options of manipulating and presenting the same data. A comparison of these two models was made on a small sample, and the results were displayed on the same query as the default for both types of databases. Simpler query syntax and better visualization of data are some of the benefits presented by this model on the graph database.

关键词： NoSQL graph database IoT Neo4j Cypher query language MySQL

来源：评论

学校读者我要写书评

暂无评论

Service composition based on pre-joined service network in graph database

引用

INTERNATIONAL JOURNAL OF WEB AND GRID SERVICES 2020年第4期16卷 422-440页

作者： Li, Jing Zhu, Ming Yu, Miao Yan, Yuhong Cui, Lizhen Shandong Univ Technol Sch Comp Sci & Technol Zibo 255000 Peoples R China Univ Lincoln Sch Comp Sci Lincoln LN6 7TS England Concordia Univ Dept Comp Sci & Software Engn Montreal PQ H3G 1M8 Canada Shandong Univ Artificial Intelligence Res C FAIR Joint SDU NTU Ctr Sch Software Jinan 250101 Peoples R China

To perform an arbitrary service composition task in a graph database, and to support plug-in semantic matching of services, we present a novel service composition approach in a graph database named pre-joined service network. Firstly, the proposed approach constructs and stores a composition network with all services and compositions in a graph database. Then, it fetches a satisfying solution by converting the user's request into queries in the graph database. To illustrate the process of searching for a solution, a simple but meaningful example is provided. Furthermore, we test the performance of the proposed approach with a challenge dataset. Experiment results show that the proposed approach can always find a valid solution and lead to higher user satisfaction when compared with the pre-joined semantic indexing graph approach.

关键词： graph database service composition QoS

来源：评论

学校读者我要写书评

暂无评论

Extending the Integrity Constraint Support in a graph database

引用

IEEE LATIN AMERICA TRANSACTIONS 2021年第4期19卷 604-611页

作者： Reina, Fabio Huf, Alexis Presser, Daniel Siqueira, Frank Univ Fed Santa Catarina Lab Pesquisa Sistemas Distribuidos LPeSD Florianopolis SC Brazil Univ Fed Santa Catarina Programa Grad Ciencia Comp PPGCC Florianopolis SC Brazil Univ Fed Santa Catarina Florianopolis SC Brazil

The large volume of data that has been produced every day has encouraged the development of new data storage technologies, including graph databases, which have experienced a growing adoption rate in recent years. On the other hand, the graph database management systems that are commercially available nowadays still lack means to ensure the consistency of stored data. In this scenario, this work proposes the extension of a graph database management system in order to add support for four new integrity constraints, allowing the definition of: conditions on node attributes, required edges, type of in/out nodes of an edge and edge cardinality. Support for these constraints was added to a modified version of OrientDB and experimental results show improvements in the performance of applications with integrity constraints.

关键词： IEEE transactions Nanoelectromechanical systems Monitoring Memory Indexes Data integrity Big Data data management graph database integrity constraints data integrity OrientDB

来源：评论

学校读者我要写书评

暂无评论

Fraud detection in the distributed graph database

引用

CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS 2023年第1期26卷 515-537页

作者： Srivastava, Sakshi Singh, Anil Kumar MNNIT Allahabad Prayagraj India

Over the last few decades, graphs have become increasingly important in many applications and domains for managing Big data. Big data analysis in a graph database is described as an analysis of exponentially increasing massive interconnected data concerning time. However, analyzing big connected data in social networks and synthetic identity detection is challenging. In previous approaches, fraud detection has been done on the complete graph data, which is a time-consuming process and will create bottlenecks while query execution. To overcome the issue, this paper proposes a new fraud detection technique to unveil synthetic identities involved in the Panama Paper leak dataset (unprecedented leak of 11.5 m data from the database of the world's fourth-biggest offshore law arm, Mossack Fonseca) using a Node rank-based fraud detection algorithm by integrating distributed data profiling techniques on a minimized graph by minimizing the least influential nodes. The proposed model is verified on the three nodes cluster to improve data scalability, reduce the query execution time by an average of 30-36% and finally reduce the fraud detection time by 18.2%.

关键词： Neo4j graph database Distributed system Community fraud detection Node rank Minimized graph Data profiling NRFD

来源：评论

学校读者我要写书评

暂无评论

Topology Modeling and Analysis of a Power Grid Network Using a graph database

引用

INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMS 2017年第1期10卷 1355-1363页

作者： Kan, Bowen Zhu, Wendong Liu, Guangyi Chen, Xi Shi, Di Yu, Weiqing GEIRI North Amer 250 W Tasman DrSuite 100 San Jose CA 95134 USA

We introduce a new method for storing, modeling, and analyzing power grid data. First, we present an architecture for building the network model for a power grid using the open source graph database Neo4j. Second, we design single- and multi-threading systems for initial energization analysis of the power grid network. We design the shortest path search function and conditional search function based on Neo4j. Finally, we compare the functionality and efficiency of our graph database with a traditional relational database in system initial energization analysis and the shortest path function problems on small to large data sets. The results demonstrate the efficiency and effectiveness of topology modeling and analysis using graph database for a power grid network.

关键词： graph database Conditional Search Shortest Path Neo4j Power Grid Network Topological Analysis

来源：评论

学校读者我要写书评

暂无评论

graph database Watermarking Using Pseudo-Nodes 2

Graph Database Watermarking Using Pseudo-Nodes

引用

2nd ACM Data Economy Workshop (DEC) Part of SIGMOD Conference

作者： Hristov, Tsvetomir Isler, Devris Laoutaris, Nikolaos Erkin, Zekeriya Delft Univ Technol Cyber Secur Grp Delft Netherlands IMDEA Networks Inst Leganes Spain UC3M Leganes Spain

ISBN: (纸本)9798400708466

Watermarking is used as proof of ownership for various data types such as images, videos, software, machine learning models, and databases. Datasets are crucial for data driven decision making using Machine Learning for tasks like prediction, recommendation, classification, and anomaly detection. Hence, it is not surprising that entire databases are being sold in data marketplaces. Protecting ownership rights upon such databases is, therefore, becoming increasingly important. Watermarking for relational databases has been an active field of research since 2002. However, how to watermark non-relational databases involving complex data types has largely remained understudied. In this paper we revise previously proposed techniques for non-relational database watermarking and introduce an improved technique for graph database watermarking inspired by Zhuang et al. [28]. Our technique employs randomization to generate a watermark in an efficient manner that avoids the computational complex genetic algorithm optimization of Zhuang et al. We evaluated our technique in terms of performance, usability, security, and robustness by implementing it as a proof-of-concept. Our results showed that our technique is efficient, secure and robust against guessing and deletion attacks.

关键词： graph database watermarking data ownership data economy

来源：评论

学校读者我要写书评

暂无评论

A large scale power communication network simulation system based on big graph database

引用

Science China(Technological Sciences) 2019年第12期62卷 2088-2092页

作者： CHEN Jian JIANG Ying LU WenDa HAN Meng LI XiaoMing State Grid Zhejiang Electric Power Co Ltd.Hangzhou 310007China School of Computer Science and Engineering Nanjing University of Science&TechnologyNanjing 210094China Beijing Zhongdian Puhua Information Technology Co.LTD Beijing 100192China

The power communication network can be abstracted as a graph based on its topology. In this paper, we propose an approach to conduct simulations of power communication network based on its graph representation. In particular, the nodes and edges in the graph refer to the ports and channels in the grid topology. Different applications on the grid can be transformed into queries over the graph. Hence, in this paper, we build our grid simulation model based on the Neo4 j graph database. We also propose a fault extension algorithm based on predicate calculus. Our experiment evaluations show that the proposed approach can effectively improve the efficiency of the power grid.

关键词： power communication network graph database fault-spreading algorithm predicate calculus

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：