Add to ORKGThe results testing technique of the structural optimization of the relational databases founded on the effect leveling of the cache-system is considered. Its feasibility through the paths with object flat sharing is proved
A horizontal fragment of a database class in an object-oriented database system contains subsets of ...
AbstractAutomatic techniques for generating a test fatabase for a given query are studied. The metho...
This thesis deals with the issue of automated processing of large volumes of data in a relational da...
The results testing technique of the structural optimization of the relational databases founded on ...
In this paper we introduce a new objective function for vertical partitioning relations in relationa...
An overriding objective in database physical design is to minimize the number of accesses made in th...
Storing and using hierarchical data structures in relational databases was not the main purpose of t...
Abstract. Vertical partitioning is a well known technique to improve query response time in relation...
Today’s business Environment has an increasing need for consistent, scalable, reliable and accessibl...
The second part of the paper devoted to optimization of distributed databases. This part presents te...
The second part of the paper devoted to optimization of distributed databases. This part presents te...
A Vertical Partitioning is the process of dividing the attributes of a relation. Further, a good Ver...
One of the most important metrics in measuring the performance of a database system is query respons...
AbstractK-means is one of the most popular clustering algorithms. This article introduces an efcient...
. Within the framework of the data warehouse design<E-345> methodology we are developing, in t...
A horizontal fragment of a database class in an object-oriented database system contains subsets of ...
AbstractAutomatic techniques for generating a test fatabase for a given query are studied. The metho...
This thesis deals with the issue of automated processing of large volumes of data in a relational da...
The results testing technique of the structural optimization of the relational databases founded on ...
In this paper we introduce a new objective function for vertical partitioning relations in relationa...
An overriding objective in database physical design is to minimize the number of accesses made in th...
Storing and using hierarchical data structures in relational databases was not the main purpose of t...
Abstract. Vertical partitioning is a well known technique to improve query response time in relation...
Today’s business Environment has an increasing need for consistent, scalable, reliable and accessibl...
The second part of the paper devoted to optimization of distributed databases. This part presents te...
The second part of the paper devoted to optimization of distributed databases. This part presents te...
A Vertical Partitioning is the process of dividing the attributes of a relation. Further, a good Ver...
One of the most important metrics in measuring the performance of a database system is query respons...
AbstractK-means is one of the most popular clustering algorithms. This article introduces an efcient...
. Within the framework of the data warehouse design<E-345> methodology we are developing, in t...
A horizontal fragment of a database class in an object-oriented database system contains subsets of ...
AbstractAutomatic techniques for generating a test fatabase for a given query are studied. The metho...
This thesis deals with the issue of automated processing of large volumes of data in a relational da...