A reference constructicon as a database

The main problem has been managing databases because they are continuously expanding quickly and getting more complicated in terms of volume, variety, and velocity. Currently, Relational Database Management Systems (RDMS), also known as SQL, or traditional search engines are primarily used to manage and utilize data collection. Due to their highly semantic properties and applications, relational databases have emerged as powerful and superior during the previous two decades. The handling of a high volume of data and the variability in data type and structure has become a laborious task since Big Data entered the IT industry. Relational databases are inadequate to handle such big data due to their rigid data limitations, structure, relations, and other factors. As a result, data aggregation is rendered impossible. NoSQL databases offer a practical and understandable foundation for combining massive amounts of data, structures, and interactions. Data modeling and migration are now needed in order to define the issue. There isn't yet a tool for switching from relational to no-SQL databases. For this migration, relational (SQL) database queries must be converted to NoSQL database queries. Since relational databases (RDBMS) have found it difficult to keep up with modernization, NoSQL has emerged as the most practical database. This essay aims to highlight and assess the applications of NoSQL, the notion of NoSQL data modeling, and the NoSQL database migration procedure. NoSQL, NoSQL Roadmap, Data Modeling, ETL Approach for Data Migration, Data Loading, and Data Extraction.

Process mining techniques provide capabilities for discovering the real business process flows from data, and compare expected and actual behaviors. Actual behaviors, in many cases, are obtained from Enterprise Resource Planning (ERP) systems and other enterprise information systems transaction logs. These transaction logs provide valuable insight into the companies' business processes. They traditionally hold a large amount of data in a set of conceptual documents related to each other through one-to-many and many-to-many relations, where information changes occur in transactions. Underlying data model gives rise to complex interactions between multiple data objects without a clear notion of a unique case identifier in an isolated process. However, enterprise process mining techniques can be applied only to event logs containing event data related to one notion of process instances. Within ERP systems, such event logs are not explicitly given and substantial domain knowledge is required to select the right data from multiple tables in relational databases. In order to respond to this need, in this paper we present an abstract syntax of domain specific language (DSL) for facilitating the extraction of an appropriate dataset from ERP systems by domain experts, and its conversion into event log based on XES IEEE standard. It is developed specifically to describe behavior over complex data from ERP systems in terms of multiple interacting artifacts. The goal is to align the data and process perspectives, supporting extraction of complex ambiguous cases, affected by data convergence and data divergence problems. The basic concepts of the language as well as principles are discussed in depth in this paper.

The article focuses on comparing relational and non-relational databases using applications written in C#. The aim of the study is to understand in which cases relational databases are preferred and when it is worth considering the use of non-relational databases. The research examines the speed of data retrieval, updating, and deletion, in the context of five different databases, including relational ones like PostgreSQL, MySql, Oracle, and non-relational ones such as Neo4j and MongoDB. The data consists of 1,578,098 records. In the case of relational databases, a unified database model was applied, while in NoSQL databases, the data model was appropriately adjusted to the specific type of non-relational database. Differences in the execution time of database queries are analyzed based on indexing strategies and query complexity. Special attention is given to query performance efficiency in the context of using C# and libraries that facilitate the connection between the application and databases. The conducted research indicates that the PostgreSQL database achieves the lowest average query response times.

In ubiquitous environments, many applications need to process data with time and space dimensions. Because of this, there is growing attention not only on gathering spatiotemporal data in ubiquitous environments, but also on processing such data in databases. In order to obtain the full benefits from spatiotemporal data, we need a data model that naturally expresses the properties of spatiotemporal data. In this paper, we introduce three spatiotemporal data models extended from temporal data models. The main goal of this paper is to determine which data model is less complex in the spatiotemporal context. To this end, we compare their query languages in the complexity aspect because the complexity of a query language is tightly coupled with its underlying data model. Throughout our investigations, we show that it is important to intertwine space and time dimensions and keep one-to-one correspondence between an object in the real world and a tuple in a database in order to naturally express queries in ubiquitous applications.

Modern large-scale information systems often use multiple database management systems, not all of which are necessarily relational. In recent years, NoSQL databases have gained acceptance in certain domains while relational databases remain de facto standard in many others. Many "legacy" information systems also use relational databases. Unlike relational database systems, NoSQL databases do not have a common data model or query language, making it difficult for users to access data in a uniform manner when using a combination of relational and NoSQL databases or simply several different NoSQL database systems. Therefore, the need for uniform data access from such a variety of data sources becomes one of the central problems for data integration. In this paper we provide an overview of the main problems, methods, and solutions for data integration between relational and NoSQL databases, as well as between different NoSQL databases. We focus mainly on the problems of structural, syntactic, and semantic heterogeneity and on proposed solutions for uniform data access, emphasizing some of the more recent proposals.

In this paper, we develop techniques to produce interoperable queries with object and relational databases. A user poses a local query in a local query language, against a local object or relational schema. We transparently produce appropriate queries with respect to a remote target object or relational schema, corresponding to some remote database which contains data relevant to the user's query. Mapping knowledge to resolve representational heterogeneities in local and remote schemas is expressed in a canonical representation, CRmapping, and is independent of the particular data model. A canonical representation CRquery is also used to resolve heterogeneities of query languages. A set of heterogeneous transformation algorithms define the appropriate transformations from the local queries to the remote queries. The use of canonical representations (CR) allows us to represent queries independent of the particular query language, and to resolve representational conflicts in a uniform manner, independent of models and query languages.

In this paper we present the Elen prototype objective of which is to support maintenance activities for large software systems. We take advantage of hypertext systems in order to manage links between objects (programs and documentation) and to support navigation and interface features. To overcome hypertext insufficiency in supporting structural and dynamic aspects of software engineering documents, we define a new underlying data model. The proposed data model is object-oriented, it provides the hypertext by the abstraction mechanisms necessary to model structural documents and semantics of composition links between them. With this model the “nodes” of the hypertext becomes active, in the sense that, some actions can be executed on nodes of a given type, and side effects of modifications are propagated to other nodes which may react. These later aspects are supported at the data model level using methods which constitute triggers associated to objects. This paper is focused on the presentation of dynamic aspects of the model and on the Elen prototype implementing the model features.

From the beginning it was understood that the success of the Semantic Web hinges on integrating the vast amount of data stored in Relational Databases. This manuscript reflects on the last 10 years of our research results to integrate Relational Databases with the Semantic Web. Since 2007, our research has led us to answer the following question: How and to what extent can Relational Databases be Integrated with the Semantic Web? The answer comes in two parts. We start by presenting how to get from Relational Databases to the Semantic Web via mappings, such as the W3C Direct Mapping and R2RML standards. Subsequently, we present how the Semantic Web can access Relational Databases. We finalize with how Relational Databases and Semantic Web technologies are being used practice for data integration and discuss open challenges.

When an application is built, an underlying data model is chosen to make that application effective. Frequently, other applications need the same data, only modeled differently. The naïve solution of copying the underlying data and modeling is costly in terms of storage and makes data maintenance and evolution impossible. View mechanisms are a technique to model data differently for various applications without affecting the underlying format and structure of the data. The technique enables applications to customize shared data objects without affecting other applications that use the same objects. The growing data-manipulation needs of companies cannot be met by existing legacy systems that contain valuable data. Thus view mechanisms are becoming increasingly important as a way to model and use legacy data in new applications.Materialized views are views that have been computed and stored in databases. Because they reduce the need to recompute the view and/or data being queried, they speed up the querying of large amounts of data. Further, because they provide a systematic way to describe how to recompute the data, maintenance and evolution can be automated. Materialized views are especially useful in data warehousing, query optimization, integrity constraint maintenance, online analytical processing, and applications such as billing, banking, and retailing. This comprehensive volume, with a foreword by Jeff Ullman of Stanford University, will serve as a reference for students and commercial users, and encourage further use and development of materialized views.

This paper presents techniques and tools to transform spreadsheets into relational databases and back. A set of data refinement rules is introduced to map a tabular datatype into a relational database schema. Having expressed the transformation of the two data models as data refinements, we obtain for free the functions that migrate the data. We use well-known relational database techniques to optimize and query the data. Because data refinements define bi-directional transformations we can map such database back to an optimized spreadsheet. We have implemented the data refinement rules and we constructed Haskell-based tools to manipulate, optimize and refactor Excel-like spreadsheets.

Aufgrund fallender Preise zur Speicherung von Daten kann man derzeit eine explosionsartige Zunahme in der Menge der verfügbaren Daten beobachten. Diese Entwicklung gibt Unternehmen und wissenschaftliche Institutionen die Möglichkeit empirische Daten in ungekannter Größenordnung zu analysieren. Für viele Firmen ist die Analyse der gesammelten Daten aus ihrem operationalen Geschäft längst zu einem zentralen strategischen Aspekt geworden. Im Gegensatz zu der seit längerem schon betriebenen Business Intelligence, bestehen diese Analysen nicht mehr nur aus traditionellen relationalen Anfragen. In zunehmendem Anteil kommen komplexe Algorithmen aus den Bereichen Data Mining und Maschinelles Lernen hinzu, um versteckte Muster in den Daten zu erkennen, oder Vorhersagemodelle zu trainieren. Mit zunehmender Datenmenge und Komplexität der Analysen wird jedoch eine neue Generation von Systemen benötigt, die diese Kombination aus Anfragekomplexität und Datenvolumen gewachsen sind. Relationale Datenbanken waren lange Zeit das Zugpferd der Datenanalyse im großen Stil. Grund dafür war zum großen Teil ihre deklarativen Anfragesprache, welche es ermöglichte die logischen und physischen Aspekte der Datenspeicherung und Verarbeitung zu trennen, und Anfragen automatisch zu optimieren. Das starres Datenmodell und ihre beschränkte Menge von möglichen Operationen schränken jedoch die Anwendbarkeit von relationalen Datenbanken für viele der neueren analytischen Probleme stark ein. Diese Erkenntnis hat die Entwicklung einer neuen Generation von Systemen und Architekturen eingeläutet, die sich durch sehr generische Abstraktionen für parallelisierbare analytische Programme auszeichnen; MapReduce kann hier beispielhaft genannt werden, als der zweifelsohne prominenteste Vertreter dieser Systeme. Zwar vereinfachte und erschloss diese neue Generation von Systemen die Datenanalyse in diversen neuen Anwendungsfeldern, sie ist jedoch nicht in der Lage komplexe Anwendungen aus den Bereichen Data Mining und Maschinelles Lernen effizient abzubilden, ohne sich dabei extrem auf spezifische Anwendungen zu spezialisieren. Verglichen mit den relationalen Datenbanken haben MapReduce und vergleichbare Systeme außerdem die deklarative Abstraktion aufgegeben und zwingen den Anwender dazu systemnahe Programme zu schreiben und diese manuell zu optimieren. In dieser Dissertation werden verschiedene Techniken vorgestellt, die es ermöglichen etliche der zentralen Eigenschaften von relationalen Datenbanken im Kontext dieser neuen Generation von daten-parallelen Analysesystemen zu realisieren. Mithilfe dieser Techniken ist es möglich ein Analysesystem zu beschreiben, dessen Programme gleichzeitig sowohl generische und ausdrucksstark, als auch prägnant und deklarativ sind. Im einzelnen stellen wir folgende Techniken vor: Erstens, eine Programmierabstraktion die generisch ist und mit komplexen Datenmodellen umgehen kann, aber gleichzeitig viele der deklarativen Eigenschaften der relationalen Algebra erhält. Programme, die gegen dies Abstraktion entwickelt werden können ähnlich optimiert werden wie relationale Anfragen. Zweitens stellen wir eine Abstraktion für iterative daten-parallele Algorithmen vor. Die Abstraktion unterstützt inkrementelle (delta-basierte) Berechnungen und geht mit zustandsbehafteteten Berechnungen transparent um. Wir beschreiben wie man einen relationalen Anfrageoptimierer erweitern kann so dass dieser iterative Anfragen effektiv optimiert. Wir zeigen dabei dass der Optimierer dadurch in die Lage versetzt wird automatisch Ausführungspläne zu erzeugen, die wohlbekannten, manuell erstellten Programmen entsprechen. Die Abstraktion subsumiert dadurch spezialisierte Systeme (wie Pregel) und bietet vergleichbare Performanz. Drittens stellen wir Methoden vor, um die Programmierabstraktion in eine funktionale Sprachen einzubetten. Diese Integration ermögliche es prägnante Programme zu schreiben und einfach wiederzuverwendenden Komponenten und Bibliotheken, sowie Domänenspezifische Sprachen, zu erstellen. Wir legen dar wie man die Übersetzung und Optimierung des daten-parallelen Programms mit dem Sprachübersetzer der funktionalen Sprache so integriert, dass maximales Optimierungspotenzial besteht.

Background/Objectives: The vast amounts of high-quality data stored in relational databases (RDB) is the primary resources for Linked Open Data (LOD) datasets. This paper proposes a schema-based mapping approach from RDB to RDF, which provides succinct and efficient mapping.Methods/Statistical analysis: The various approaches, languages and tools for mapping RDB to LOD have been proposed in the recent years. This paper surveys and analyzes classic mapping approach and language such as Direct Mapping and R2RML. The mapping approaches can be categorized by means of their data modeling. After analyzing the conventional RDB-RDF mapping methods, this paper proposes a new mapping method and discusses its typical features and applications.Findings: There are two types of mapping approaches for the translation of RDB to RDF: instance-based and schema-based mapping approaches. The instance-based mapping approaches generate large amounts of RDF graphs by means of mapping rules. These approaches causes data redundancy since the same data is stored in two ways of RDB and RDF. It is very easy to bring the data inconsistence problem when data update operations occur. The schema-based mapping approaches can effectively avoid data redundancy since the mapping can be accomplished in the conceptual schema level.The architecture of SPARQL endpoint based on schema mapping approach consists of five phases:Generation of mapping description based on mapping rules.SPARQL query statements for RDF graph patterns.Translation of SPARQL query into SQL query.Execution of SQL query in RDB.Interpretation of SQL query result into JSON-LD format.Experiments show the schema-based mapping approach is a straightforward, succinct and efficient mapping method for RDB2RDF.Improvements/Applications: This paper proposes a schema-based mapping approach called R2RS, which shows better performance than the conventional mapping methods. In addition, R2RS also provides the efficient implementation of SPARQL endpoint in RDB.

As file-based production technology gains industry understanding and commercial products are becoming common-place, many broadcasting and production facilities are commencing re-engineering processes towards file-based production workflows. Sufficient attention, however, should also be spent on the development and incorporation of standardized metadata to reach the full potential of such file-based production environments. In addition to its initial meaning, metadata and underlying data models can represent much more than just some meta-information about audiovisual media assets. In fact, properly modeled metadata can provide the structure that holds various media assets together and guides creative people through production workflows and complex media production tasks. Metadata should hence become a first-class citizen in tomorrow's file-based production facilities The aim of this paper is to show how standardized metadata standards and data models, complemented by custom metadata developments, can be employed practically in a file-based media production environment in order to construct a coherently integrated production platform. The types of metadata are discussed that are exchanged between different parts of the system, which enables the implementation of an entire production workflow and provides seamless integration between different components.

A description is given of the architecture and development of a knowledge-based system called MUVIS (multiuser view integration system) to support the design of distributed object-oriented databases. MUVIS is implemented using an object-oriented development environment. It assists database designers in representing user views and integrating these views into a global conceptual view. The view integration component is decoupled from the view modeling component. The underlying data model, the semantic data model, treats all parts of the design as objects, thereby reducing the complexity of the integration. >

Application domains such as bioinformatics and web technology represent complex objects as graphs where nodes represent basic objects (i.e. atoms, web pages etc.) and edges model relations among them. In biochemical databases proteins are naturally represented as labeled graphs: the nodes are atoms and the edges are chemical links. In computer vision, graphs can be used to represent images at different levels of abstraction. In a low-level representation (Pailloncy, Deruyver, & Jolion, 1999), the nodes of a graph correspond to pixels and the edges to spatial relations between pixels. At higher levels of description (Hong & Huang, 2001), nodes are image regions and edges are spatial relations among them. In a Web graph (Deutsch, Fernandez, Florescu, Levy, & Suciu, 1999) nodes are web pages and edges are links between them. In all these domains, substructure queries that search for all exact or approximate occurrences of a given query graph in the graphs of the database can be useful. Research efforts in graph searching have taken three directions: the first is to study matching algorithms for particular graph structures (planar graphs, bounded valence graphs and association graphs); the second is to use elaborate tricks to reduce the number of generated matching maps (Cordella, Foggia, Sansone, & Vento, 2004); and the third is, since graph searching problem is NP-complete, to provide polynomial approximate algorithms. In the context of querying in a database of graphs many of the existing methods are designed for specific applications. For example, several querying methods for semi-structured databases have been proposed. In addition, commercial products and academic projects (Kelley 2002) for subgraph searching in biochemical databases are available. These two examples have a different underlying data model (a web-page database is a large graph whereas a biochemical database is a collection of graphs). In these two applications regular path expressions and indexing methods are used during query time to respectively locate substructures in the database and to avoid unnecessary traversals of the database. In general graph databases, there are some searching methods where the data graph and the query graph must have the same size. Other methods allow the query to be considerably smaller than the database graphs. A common idea in the above algorithms is to index the subgraph matches in the database and organize them in suitable data structures.