scholarly journals DESIGN AND EVALUATION OF A BIM-GIS INTEGRATED INFORMATION MODEL USING RDF GRAPH DATABASE

2021 ◽  
Vol VIII-4/W2-2021 ◽  
pp. 175-182
Author(s):  
A.-H. Hor ◽  
G. Sohn
Keyword(s):  
Performance Metrics ◽  
Graph Model ◽  
Information Model ◽  
Query Languages ◽  
Semantic Integration ◽  
Graph Database ◽  
Graph Databases ◽  
Rdf Graph ◽  
Functional Components ◽  
Integrated Information

Abstract. The semantic integration modeling of BIM industry foundations classes and GIS City-geographic markup language are a milestone for many applications that involve both domains of knowledge. In this paper, we propose a system design architecture, and implementation of Extraction, Transformation and Loading (ETL) workflows of BIM and GIS model into RDF graph database model, these workflows were created from functional components and ontological frameworks supporting RDF SPARQL and graph databases Cypher query languages. This paper is about full understanding of whether RDF graph database is suitable for a BIM-GIS integrated information model, and it looks deeper into the assessment of translation workflows and evaluating performance metrics of a BIM-GIS integrated data model managed in an RDF graph database, the process requires designing and developing various pipelines of workflows with semantic tools in order to get the data and its structure into an appropriate format and demonstrate the potential of using RDF graph databases to integrate, manage and analyze information and relationships from both GIS and BIM models, the study also has introduced the concepts of Graph-Model occupancy indexes of nodes, attributes and relationships to measure queries outputs and giving insights on data richness and performance of the resulting BIM-GIS semantically integrated model.

Query Languages for Graph Databases

2019 ◽  
pp. 645-659
Author(s):  
Kornelije Rabuzin
Keyword(s):  
Relational Databases ◽  
Query Language ◽  
Main Idea ◽  
Query Languages ◽  
End Users ◽  
The Other ◽  
Graph Database ◽  
Graph Databases ◽  
Nosql Databases ◽  
The Past

In the past few years, many NoSQL databases have emerged, including graph databases. NoSQL databases have certain advantages and they can be used in certain domains as an alternative to relational databases. In order to use graph databases, one needs to be familiar with specific languages like Cypher Query Language (CQL) or Gremlin. However, some statements in CQL can be considered too complex for end users as it is shown later on. Because of that, the main idea of this chapter is to explore two other languages for graph databases. One of them is new and it is used to pose queries visually. Since CQL does not support recursion, views, etc., the other language is used to show how to use recursion and views on a graph database.

Query Languages for Graph Databases

2018 ◽  
pp. 2031-2042
Author(s):  
Kornelije Rabuzin
Keyword(s):  
Relational Databases ◽  
Query Language ◽  
Main Idea ◽  
Query Languages ◽  
End Users ◽  
The Other ◽  
Graph Database ◽  
Graph Databases ◽  
Nosql Databases ◽  
The Past

In the past few years many NoSQL databases have emerged, including graph databases. NoSQL databases have certain advantages and they can be used in certain domains as an alternative to relational databases. In order to use graph databases, one needs to be familiar with specific languages like Cypher Query Language (CQL) or Gremlin. However, some statements in CQL can be considered too complex for end users as it is shown later on. Because of that the main idea of this paper is to explore two other languages for graph databases. One of them is new and it is used to pose queries visually. Since CQL does not support recursion, views, etc., the other language is used to show how to use recursion and views on a graph database.

Technical Survey Graph Databases and Applications

2015 ◽  
Vol 09 (04) ◽  
pp. 523-545 ◽  
Author(s):  
Shao-Ting Wang ◽  
Jennifer Jin ◽  
Pete Rivett ◽  
Atsushi Kitazawa
Keyword(s):  
Social Networks ◽  
Relational Databases ◽  
Query Languages ◽  
The Internet ◽  
Complex Data ◽  
Graph Database ◽  
Graph Databases ◽  
Amount Of Information ◽  
Related Application ◽  
Fast Access

Graph databases can be defined as databases that use graph structures with nodes, edges and properties to store data. Semantic queries and graph-oriented operations are used to access them. With a rapidly growing amount of information on the Internet in recent years, relational databases suffer performance degradation as a large number of nodes are added due to the number of entries in join tables. Therefore, based on the network nature of Internet activities, graph databases are designed for fast access to complex data found in social networks, recommendation engines and networked system. The main objective of this survey is to present the work that has been done in the area of graph database, including query languages, processing, and related application.

scholarly journals A SEMANTIC GRAPH DATABASE FOR BIM-GIS INTEGRATED INFORMATION MODEL FOR AN INTELLIGENT URBAN MOBILITY WEB APPLICATION

2018 ◽  
Vol IV-4 ◽  
pp. 89-96 ◽  
Author(s):  
A.-H. Hor ◽  
G. Sohn ◽  
P. Claudio ◽  
M. Jadidi ◽  
A. Afnan
Keyword(s):  
Web Application ◽  
Architectural Design ◽  
Data Extraction ◽  
Semantic Integration ◽  
Graph Database ◽  
Graph Databases ◽  
Urban Mobility ◽  
Real World Data ◽  
Semantic Web Technologies ◽  
Rdf Data

<p><strong>Abstract.</strong> Over the recent years, the usage of semantic web technologies and Resources Description Framework (RDF) data models have been notably increased in many fields. Multiple systems are using RDF data to describe information resources and semantic associations. RDF data plays a very important role in advanced information retrieval, and graphs are efficient ways to visualize and represent real world data by providing solutions to many real-time scenarios that can be simulated and implemented using graph databases, and efficiently query graphs with multiple attributes representing different domains of knowledge. Given that graph databases are schema less with efficient storage for semi-structured data, they can provide fast and deep traversals instead of slow RDBMS SQL based joins allowing Atomicity, Consistency, Isolation and durability (ACID) transactions with rollback support, and by utilizing mathematics of graph they can enormous potential for fast data extraction and storage of information in the form of nodes and relationships. In this paper, we are presenting an architectural design with complete implementation of BIM-GIS integrated RDF graph database. The proposed integration approach is composed of four main phases: ontological BIM and GIS model’s construction, mapping and semantic integration using interoperable data formats, then an import into a graph database with querying and filtering capabilities. The workflows and transformations of IFC and CityGML schemas into object graph databases model are developed and applied to an intelligent urban mobility web application on a game engine platform validate the integration methodology.</p>

scholarly journals Advantages of using graph databases to explore chromatin conformation capture experiments

2021 ◽  
Vol 22 (S2) ◽  
Author(s):  
Daniele D’Agostino ◽  
Pietro Liò ◽  
Marco Aldinucci ◽  
Ivan Merelli
Keyword(s):  
Web Application ◽  
High Throughput Sequencing ◽  
Cell Types ◽  
Graph Database ◽  
Graph Databases ◽  
Sources Of Information ◽  
Chromosome Conformation ◽  
Wide Scale ◽  
User Friendly ◽  
Different Cell Types

Abstract Background High-throughput sequencing Chromosome Conformation Capture (Hi-C) allows the study of DNA interactions and 3D chromosome folding at the genome-wide scale. Usually, these data are represented as matrices describing the binary contacts among the different chromosome regions. On the other hand, a graph-based representation can be advantageous to describe the complex topology achieved by the DNA in the nucleus of eukaryotic cells. Methods Here we discuss the use of a graph database for storing and analysing data achieved by performing Hi-C experiments. The main issue is the size of the produced data and, working with a graph-based representation, the consequent necessity of adequately managing a large number of edges (contacts) connecting nodes (genes), which represents the sources of information. For this, currently available graph visualisation tools and libraries fall short with Hi-C data. The use of graph databases, instead, supports both the analysis and the visualisation of the spatial pattern present in Hi-C data, in particular for comparing different experiments or for re-mapping omics data in a space-aware context efficiently. In particular, the possibility of describing graphs through statistical indicators and, even more, the capability of correlating them through statistical distributions allows highlighting similarities and differences among different Hi-C experiments, in different cell conditions or different cell types. Results These concepts have been implemented in NeoHiC, an open-source and user-friendly web application for the progressive visualisation and analysis of Hi-C networks based on the use of the Neo4j graph database (version 3.5). Conclusion With the accumulation of more experiments, the tool will provide invaluable support to compare neighbours of genes across experiments and conditions, helping in highlighting changes in functional domains and identifying new co-organised genomic compartments.

scholarly journals Applying graph database technology for analyzing perturbed co-expression networks in cancer

Database ◽  
2020 ◽  
Vol 2020 ◽  
Author(s):  
Claire M Simpson ◽  
Florian Gnad
Keyword(s):  
Relational Databases ◽  
Molecular Mechanisms ◽  
Biological Data ◽  
Database Management System ◽  
Graph Database ◽  
Graph Databases ◽  
Graph Representations ◽  
Rnaseq Data ◽  
Database Technology ◽  
Speed Accuracy

Abstract Graph representations provide an elegant solution to capture and analyze complex molecular mechanisms in the cell. Co-expression networks are undirected graph representations of transcriptional co-behavior indicating (co-)regulations, functional modules or even physical interactions between the corresponding gene products. The growing avalanche of available RNA sequencing (RNAseq) data fuels the construction of such networks, which are usually stored in relational databases like most other biological data. Inferring linkage by recursive multiple-join statements, however, is computationally expensive and complex to design in relational databases. In contrast, graph databases store and represent complex interconnected data as nodes, edges and properties, making it fast and intuitive to query and analyze relationships. While graph-based database technologies are on their way from a fringe domain to going mainstream, there are only a few studies reporting their application to biological data. We used the graph database management system Neo4j to store and analyze co-expression networks derived from RNAseq data from The Cancer Genome Atlas. Comparing co-expression in tumors versus healthy tissues in six cancer types revealed significant perturbation tracing back to erroneous or rewired gene regulation. Applying centrality, community detection and pathfinding graph algorithms uncovered the destruction or creation of central nodes, modules and relationships in co-expression networks of tumors. Given the speed, accuracy and straightforwardness of managing these densely connected networks, we conclude that graph databases are ready for entering the arena of biological data.

A Graph Model for Taxi Ride Sharing Supported by Graph Databases

2019 ◽  
pp. 108-116
Author(s):  
Dietrich Steinmetz ◽  
Felix Merz ◽  
Hui Ma ◽  
Sven Hartmann
Keyword(s):  
Graph Model ◽  
Graph Databases ◽  
Ride Sharing

scholarly journals A Rule-based Conversion of an EER Schema to Neo4j Schema Constraints

2021 ◽  
Author(s):  
Telmo Henrique Valverde da Silva ◽  
Ronaldo dos Santos Mello
Keyword(s):  
Data Model ◽  
Design Methodology ◽  
A Priori ◽  
Database Management System ◽  
Conversion Process ◽  
Graph Database ◽  
Graph Databases ◽  
Rule Based ◽  
Promising Solution ◽  
Entity Relationship

Several application domains hold highly connected data, like supply chain and social network. In this context, NoSQL graph databases raise as a promising solution since relationships are first class citizens in their data model. Nevertheless, a traditional database design methodology initially defines a conceptual schema of the domain data, and the Enhanced Entity-Relationship (EER) model is a common tool. This paper presents a rule-based conversion process from an EER schema to Neo4j schema constraints, as Neo4j is the most representative NoSQL graph database management system with an expressive data model. Different from related work, our conversion process deals with all EER model concepts and generates rules for ensuring schema constraints through a set of Cypher instructions ready to run into a Neo4j database instance, as Neo4J is a schemaless system, and it is not possible to create a schema a priori. We also present an experimental evaluation that demonstrates the viability of our process in terms of performance.

scholarly journals Exploiting NoSQL Graph Databases and in Memory Architectures for Extracting Graph Structural Data Summaries

2017 ◽  
Vol 25 (01) ◽  
pp. 81-109 ◽  
Author(s):  
Arnaud Castelltort ◽  
Anne Laurent
Keyword(s):  
Relational Databases ◽  
Structural Data ◽  
Scientific Data ◽  
Graph Database ◽  
Graph Databases ◽  
Fuzzy Operators ◽  
Data Volume ◽  
Novel Method ◽  
Memory Architectures ◽  
Data Summaries

NoSQL graph databases have been introduced in recent years for dealing with large collections of graph-based data. Scientific data and social networks are among the best examples of the dramatic increase of the use of such structures. NoSQL repositories allow the management of large amounts of data in order to store and query them. Such data are not structured with a predefined schema as relational databases could be. They are rather composed by nodes and relationships of a certain type. For instance, a node can represent a Person and a relationship Friendship. Retrieving the structure of the graph database is thus of great help to users, for example when they must know how to query the data or to identify relevant data sources for recommender systems. For this reason, this paper introduces methods to retrieve structural summaries. Such structural summaries are extracted at different levels of information from the NoSQL graph database. The expression of the mining queries is facilitated by the use of two frame-works: Fuzzy4S allowing to define fuzzy operators and operations with Scala; Cypherf allowing the use of fuzzy operators and operations in the declarative queries over NoSQL graph databases. We show that extracting such summaries can be impossible with the NoSQL query engines because of the data volume and the complexity of the task of automatic knowledge extraction. A novel method based on in memory architectures is thus introduced. This paper provides the definitions of the summaries with the methods to automatically extract them from NoSQL graph databases only and with the help of in-memory architectures. The benefit of our proposition is demonstrated by experimental results.

Design and implementation of an integrated information model for optimizing workflow in radiology practice

1995 ◽  
Author(s):  
Hwa T. Kho ◽  
Lu J. Huang ◽  
Daniel J. Valentino ◽  
Gregory H. Tashima ◽  
Ricky K. Taira ◽  
...  
Keyword(s):  
Information Model ◽  
Radiology Practice ◽  
Design And Implementation ◽  
Integrated Information
Sign in / Sign up

Export Citation Format

Share Document