scholarly journals Creating Collections with Embedded Documents for Document Databases Taking into Account the Queries

Computation ◽  
2020 ◽  
Vol 8 (2) ◽  
pp. 45
Author(s):  
Yulia Shichkina ◽  
Muon Ha
Keyword(s):  
Initial Data ◽  
Set Theory ◽  
Relational Database ◽  
Document Database ◽  
Execution Speed ◽  
Document Databases

In this article, we describe a new formalized method for constructing the NoSQL document database of MongoDB, taking into account the structure of queries planned for execution to the database. The method is based on set theory. The initial data are the properties of objects, information about which is stored in the database, and the set of queries that are most often executed or whose execution speed should be maximum. In order to determine the need to create embedded documents, our method uses the type of relationship between tables in a relational database. Our studies have shown that this method is in addition to the method of creating collections without embedded documents. In the article, we also describe a methodology for determining in which cases which methods should be used to make working with databases more efficient. It should be noted that this approach can be used for translating data from MySQL to MongoDB and for the consolidation of these databases.

scholarly journals Determining the Composition of Collections for Key-Document Databases Based on a Given Set of Object Properties and Database Querie

2019 ◽  
pp. 15-28
Author(s):  
Van Muon Ha ◽  
◽  
Yulia A. Shichkina ◽  
Sergey V. Kostichev ◽  
◽  
...  
Keyword(s):  
Initial Data ◽  
Set Theory ◽  
Relational Databases ◽  
Data Organization ◽  
Object Properties ◽  
Document Databases

The work of transforming a database from one format periodically appears in different organizations for various reasons. Today, the mechanism for changing the format of relational databases is well developed. However, with the advent of new types of databases, such as NoSQL, this problem is prevalent due to the radically different ways of data organization at the various databases. This article discusses a formalized method based on set theory, at the choice of the number and composition of collections for a key-value type database. The initial data are the properties of objects, about which information is stored in the database, and the set of queries that are most frequently executed. The considered method can be applied not only when creating a new keyvalue database, but also when transforming an existing one, when moving from relational databases to NoSQL, when consolidating databases.

An Authorization Mechanism for a Document Database

1994 ◽  
Author(s):  
Hannu Peltonen ◽  
Kari Alho ◽  
Tomi Männistö ◽  
Reijo Sulonen
Keyword(s):  
Relational Database ◽  
Database Administrator ◽  
Specific Protocol ◽  
Document Database ◽  
State Graphs ◽  
Database Operations ◽  
Special Language

Abstract A programmable authorization mechanism for an engineering document database is described. The database stores documents and their versions in a commercial relational database. Documents and other objects contain user-defined attributes. Release and approval procedures of the documents are described by means of state graphs that specify the possible states of a document and the transitions between them. The system consists of centralized server and client programs, which communicate with the server using a specific protocol. The database administrator must be able to formulate rules that tell who is allowed to do particular database operations; rules that tell which operations are allowed in particular document states; and rules that describe consistency invariants between attributes. These rules are expressed by means of authorization procedures written in a special language. Whenever the server receives an operation request, it executes the corresponding authorization procedure. The system can thus be easily adapted to an organization without actually modifying the client or server programs.

scholarly journals About Symbolic Integration in the Course of Mathematical Analysis

2019 ◽  
pp. 94-106
Author(s):  
Mikhail D. Malykh ◽  
◽  
Anton L. Sevastianov ◽  
Leonid A. Sevastianov ◽  
◽  
...  
Keyword(s):  
Initial Data ◽  
Set Theory ◽  
Mathematical Analysis ◽  
Relational Databases ◽  
Symbolic Integration ◽  
The Way

The work of transforming a database from one format periodically appears in different organizations for various reasons. Today, the mechanism for changing the format of relational databases is well developed. But with the advent of new types of database such as NoSQL, this problem was exacerbated due to the radical difference in the way data was organized. This article discusses a formalized method based on set theory, at the choice of the number and composition of collections for a key-value type database. The initial data are the properties of the objects, information about which is stored in the database, and the set of queries that are most frequently executed or the speed of which should be maximized. The considered method can be applied not only when creating a new key-value database, but also when transforming an existing one, when moving from relational databases to NoSQL, when consolidating databases.

scholarly journals Functional Dependencies Analyse in Fuzzy Relational Database Models

2011 ◽  
Vol 2 (2) ◽  
Author(s):  
Miljan Vučetić
Keyword(s):  
Fuzzy Logic ◽  
Set Theory ◽  
Fuzzy Set ◽  
Relational Database ◽  
Fuzzy Set Theory ◽  
Uncertain Information ◽  
Functional Dependencies ◽  
Literature Overview ◽  
Database Models

This paper presents a literature overview of Fuzzy Relational Database Models with emphasis on the role of functional dependencies in logical designing and modeling. The aim is the analysis of recent results in this field. Fuzzy set theory is widely applied for the classical relational database extensions resulting in numerous contributions. This is because fuzzy sets and fuzzy logic are powerful tool for manilupating imprecise and uncertain information. A significant body of research in efficient designing FRDM has been developed over the last decades. Knowing the set of functional dependencies, database managers have a chance to normalize the same eliminating redundancy and data anomalies. In this paper we have considered the most important results in this field.

Graph Encoding and Recursion Computation

2005 ◽  
pp. 1309-1316
Author(s):  
Yangjun Chen
Keyword(s):  
Relational Database ◽  
Relational Databases ◽  
Database Systems ◽  
Cad Cam ◽  
Relational Systems ◽  
Relational Database Systems ◽  
Novel Applications ◽  
General Opinion ◽  
Office Systems ◽  
Document Databases

It is a general opinion that relational database systems are inadequate for manipulating composite objects that arise in novel applications such as Web and document databases (Abiteboul, Cluet, Christophides, Milo, Moerkotte & Simon, 1997; Chen & Aberer, 1998, 1999; Mendelzon, Mihaila & Milo, 1997; Zhang, Naughton, Dewitt, Luo & Lohman, 2001), CAD/ CAM, CASE, office systems and software management. Especially, when recursive relationships are involved, it is cumbersome to handle them in relational databases, which sets current relational systems far behind the navigational ones (Kuno & Rundensteiner, 1998; Lee & Lee, 1998). To overcome this problem, a lot of interesting graph encoding methods have been developed to mitigate the difficulty to some extent. In this article, we give a brief description of some important methods, including analysis and comparison of their space and time complexities.

scholarly journals Method for Creating Collections with Embedded Documents for Document-oriented Databases Taking into Account Executable Queries

2020 ◽  
Vol 19 (4) ◽  
pp. 829-854
Author(s):  
Yulia Shichkina ◽  
Van Muon Ha
Keyword(s):  
Initial Data ◽  
Set Theory ◽  
Execution Time ◽  
Formal Method ◽  
Relational Model ◽  
Nosql Databases ◽  
Search Queries ◽  
Object Properties ◽  
Migration Data ◽  
Day By Day

In the recent decades, NoSQL databases have become more popular day by day. And increasingly, developers and database administrators, for whatever reason, have to solve the problems of database migration from a relational model in the model NoSQL databases like the document-oriented database MongoDB database. This article discusses the approach to this migration data based on set theory. A new formal method of determining the optimal runtime searches aggregate collections with the attached documents NoSQL databases such as the key document. The attributes of the database objects are included in optimizing the number of collections and their structures in search queries. The initial data are object properties (attributes, relationships between attributes) on which information is stored in the database, and query the properties that are most often performed, or the speed of which should be maximal. This article discusses the basic types of connections (1-1, 1-M, M-M), typical of the relational model. The proposed method is the following step of the method of creating a collection without embedded documents. The article also provides a method for determining what methods should be used in the reasonable cases to make work with databases more effectively. At the end, this article shows the results of testing of the proposed method on databases with different initial schemes. Experimental results show that the proposed method helps reduce the execution time of queries can also significantly as well as reduce the amount of memory required to store the data in a new database.

scholarly journals Graphical Notation for Document Database Modeling

2021 ◽  
Vol 25 (5) ◽  
pp. 50-60
Author(s):  
M. V. Smirnov ◽  
R. S. Tolmasov
Keyword(s):  
Graphical Models ◽  
Data Model ◽  
The Other ◽  
Relational Data ◽  
Graphical Notation ◽  
Relational Data Model ◽  
Document Database ◽  
Graphical Notations ◽  
The One ◽  
Document Databases

Goals and objectives. Graphical models have proven to be a reliable, clear and convenient tool for creating sketch models of databases. Most of the existing notations are designed for the relational data model, the dominant data model for the last thirty years. However, the development of information technologies has led to an increase in the popularity of non-relational data models, primarily the document model. One of the problems of its application in practice is the lack of suitable tools that allow performing graphical modeling of the database, taking into account the features of the document model, at the stage of logical design. The development of appropriate tools is an important and actual task, since their application in practical research makes it possible to identify, classify and analyze typical modeling errors that allow the designer to reduce the risk of their occurrence in the future. The purpose of this article is to develop a graphical notation that, on the one hand, providing convenience for the designer, and on the other hand, taking into account the peculiarities of creating and functioning of the noSQL document storage model.Materials and methods. The materials for the study were numerous publications devoted to the development of graphical notations in problems and their application to database design for various information systems. The selected materials were analyzed and the main graphical notations used to describe the relational data model were identified. Three notations were selected from them, a set of graphic stereotypes, which were most different from each other, the analysis of which allowed us to identify the main image patterns of the components of the relational model.The resulting patterns were applied to the main elements of the document database, which were obtained by analyzing the documentation of the popular MongoDB DBMS.Results. The result of the research was the creation of a new tool for modeling document databases at the logical level, which consists of a set of graphic stereotypes and rules for their application. On the one hand, the development is well known to practitioners who have previously worked with relational data models, since its development took into account many years of experience in using graphical models in the field of relational database design, and on the other hand, it reflects the features of the structure of the document model.Conclusion. The practical application of the developed model has shown the convenience of its use both in the process of designing document databases and in the process of teaching students within this subject area. The use of graphical models constructed in the proposed graphical notation will allow researchers to create and illustrate typical patterns of document databases, which will undoubtedly have a positive impact on the dynamics of the development of promising data storage technologies.

Sign in / Sign up

Export Citation Format

Share Document