Performance of Graph and Relational Databases in Complex Queries
In developing NoSQL databases, a major motivation is to achieve better efficient query performance compared with relational databases. The graph database is a NoSQL paradigm where navigation is based on links instead of joining tables.
Petri Kotiranta +2 more
doaj +2 more sources
Extracting Multiple Viewpoint Models from Relational Databases [PDF]
Much time in process mining projects is spent on finding and understanding data sources and extracting the event data needed. As a result, only a fraction of time is spent actually applying techniques to discover, control and predict the business process.
A. Berti, Wil M.P. van der Aalst
semanticscholar +1 more source
Object-oriented querying of existing relational databases [PDF]
In this paper, we present algorithms which allow an object-oriented querying of existing relational databases. Our goal is to provide an improved query interface for relational systems with better query facilities than SQL.
Keim, Daniel A. +2 more
core +3 more sources
Automatic Conversion of Relational Databases into Ontologies: A Comparative Analysis of Protégé Plug-ins Performances [PDF]
Constructing ontologies from relational databases is an active research topic in the Semantic Web domain. While conceptual mapping rules/principles of relational databases and ontology structures are being proposed, several software modules or plug-ins ...
Kgotatso Desmond Mogotlane +1 more
semanticscholar +1 more source
Distributed Model-Based Diagnosis using Object-Relational Constraint Databases [PDF]
This work presents a proposal to diagnose distributed systems utilizing model-based diagnosis using distributed databases. In order to improve aspects as versatility, persistence, easy composition and efficiency in the diagnosis process we use an ...
Gómez López, María Teresa +3 more
core +2 more sources
Computing Multi-Relational Sufficient Statistics for Large Databases [PDF]
Databases contain information about which relationships do and do not hold among entities. To make this information accessible for statistical analysis requires computing sufficient statistics that combine information from different database tables. Such
Qian, Zhensong +2 more
core +1 more source
Database Slicing on Relational Databases
Many software systems today use databases to permanently store their data. Testing, bug finding and migration are complex problems in the case of databases that contain many records. Here, our method can speed up these processes if we can select a smaller piece of the database (called a slice) that contains all of the records belonging to the slicing ...
Dávid Tengeri, Ferenc Havasi
openaire +1 more source
DBRepo: a Semantic Digital Repository for Relational Databases
Data curation is a complex, multi-faceted task. While dedicated data stewards are starting to take care of these activities in close collaboration with researchers for many types of (usually file-based) data in many institutions, this is rarely yet the ...
Martin Weise +6 more
doaj +1 more source
Comparing the performance of object and object relational database systems on objects of varying complexity [PDF]
This is the first published work to compare the performance of object and object relational database systems based on the object's complexity. The findings of this research show that the performance of object and object relational database systems are ...
Bryant, CH, Kalantari, R
core +1 more source
Set-Oriented Mining for Association Rules in Relational Databases [PDF]
Describe set-oriented algorithms for mining association rules. Such algorithms imply performing multiple joins and may appear to be inherently less efficient than special-purpose algorithms. We develop new algorithms that can be expressed as SQL queries,
Houtsma, M.A.W., Swami, A.
core +3 more sources

