-
K-vertex: a novel model for the cardinality constraints enforcement in graph databases : doctoral dissertation = K-vozlišče: nov model za uveljavljanje omejitev kardinalnosti v podatkovnih bazah grafovŠestak, MartinaThe increasing number of network-shaped domains calls for the use of graph database technology, where there are continuous efforts to develop mechanisms to address domain challenges. Relationships as ... 'first-class citizens' in graph databases can play an important role in studying the structural and behavioural characteristics of the domain. In this dissertation, we focus on studying the cardinality constraints mechanism, which also exploits the edges of the underlying property graph. The results of our literature review indicate an obvious research gap when it comes to concepts and approaches for specifying and representing complex cardinality constraints for graph databases validated in practice. To address this gap, we present a novel and comprehensive approach called the k-vertex cardinality constraints model for enforcing higher-order cardinality constraints rules on edges, which capture domain-related business rules of varying complexity. In our formal k-vertex cardinality constraint concept definition, we go beyond simple patterns formed between two nodes and employ more complex structures such as hypernodes, which consist of nodes connected by edges. We formally introduce the concept of k-vertex cardinality constraints and their properties as well as the property graph-based model used for their representation. Our k-vertex model includes the k-vertex cardinality constraint specification by following a pre-defined syntax followed by a visual representation through a property graph-based data model and a set of algorithms for the implementation of basic operations relevant for working with k-vertex cardinality constraints. In the practical part of the dissertation, we evaluate the applicability of the k-vertex model on use cases by carrying two separate case studies where we present how the model can be implemented on fraud detection and data classification use cases. We build a set of relevant k-vertex cardinality constraints based on real data and explain how each step of our approach is to be done. The results obtained from the case studies prove that the k-vertex model is entirely suitable to represent complex business rules as cardinality constraints and can be used to enforce these cardinality constraints in real-world business scenarios. Next, we analyze the performance efficiency of our model on inserting new edges into graph databases with varying number of edges and outgoing node degree and compare it against the case when there is no cardinality constraints checking. The results of the statistical analysis confirm a stable performance of the k-vertex model on varying datasets when compared against a case with no cardinality constraints checking. The k-vertex model shows no significant performance effect on property graphs with varying complexity and it is able to serve as a cardinality constraints enforcement mechanism without large effects on the database performance.Type of material - dissertation ; adult, seriousPublication and manufacture - Maribor : [M. Šestak], 2022Language - englishCOBISS.SI-ID - 117895939
Link(s):
Digital Library of the University of Maribor – DLUM
Digitalna knjižnica Slovenije - dLib.siDostop z namenskih računalnikov v prostorih NUK
Author
Šestak, Martina
Other authors
Turkanović, Muhamed |
Rabuzin, Kornelije
Topics
podatkovne baz grafov |
omejitev kardinalnosti k-vozlišče |
kardinalnost |
podatkovni model grafa z lastnostmi |
shema grafa z lastnostmi |
hipervozlišče |
analiza učinkovitosti |
poslovno pravilo |
odkrivanje goljufij |
klasifikacija podatkov |
doktorske disertacije |
graph database |
K-vertex cardinality constraint |
cardinality |
business rule |
property graph data model |
property graph schema |
hypernode |
performance analysis |
fraud detection |
data classification
![loading ... loading ...](themes/default/img/ajax-loading.gif)
Call number – location, accession no. ... |
Copy status | Reservation |
---|---|---|
pisarna A-003 (FERI) DD B ŠESTAK M. K-vertex pisarna A-003 (FERI) DD B ŠESTAK M. K-vertex |
available - reading room
|
![loading ... loading ...](themes/default/img/ajax-loading.gif)
![loading ... loading ...](themes/default/img/ajax-loading.gif)
![loading ... loading ...](themes/default/img/ajax-loading.gif)
Shelf entry
Permalink
- URL:
Impact factor
Access to the JCR database is permitted only to users from Slovenia. Your current IP address is not on the list of IP addresses with access permission, and authentication with the relevant AAI accout is required.
Year | Impact factor | Edition | Category | Classification | ||||
---|---|---|---|---|---|---|---|---|
JCR | SNIP | JCR | SNIP | JCR | SNIP | JCR | SNIP |
Select the library membership card:
DRS, in which the journal is indexed
Database name | Field | Year |
---|
Links to authors' personal bibliographies | Links to information on researchers in the SICRIS system |
---|---|
Šestak, Martina | 53718 |
Turkanović, Muhamed | 39791 |
Rabuzin, Kornelije | ![]() |
Select pickup location:
Material pickup by post
Notification
Subject headings in COBISS General List of Subject Headings
Select pickup location
Pickup location | Material status | Reservation |
---|
Please wait a moment.