Add to ORKGIn this paper we introduce a new objective function for vertical partitioning relations in relational databases. It has been built with the new evaluative criterion: cache hit probability. Also present heuristic algorithm for finding the optimal partitioning schema
Abstract. In the context of multidimensional databases implemented on relational DBMSs through star ...
Vertical partitioning is the process of subdividing the attributes of a relation into groups, creati...
In this thesis, a mathematical model that describes a “Unique Constraint Domain” is defined. Followi...
An overriding objective in database physical design is to minimize the number of accesses made in th...
In this paper, a new graphical approach to vertical partitioning of a relation is presented. The pro...
The results testing technique of the structural optimization of the relational databases founded on ...
A Vertical Partitioning is the process of dividing the attributes of a relation. Further, a good Ver...
Vertical partitioning, in which attributes of a relation are assigned to partitions, is aimed at imp...
Abstract. Vertical partitioning is a well known technique to improve query response time in relation...
Abstract. We propose a new method for horizontal partitioning of re-lations based on predicate abstr...
In this paper, two-phase horizontal partitioning of distributed databases is addressed. First, prima...
Database partitioning is a useful technique for performance improvement in parallel and dis-tributed...
Vertical partitioning is a crucial step in physical database design in row-oriented databases. A num...
. In this paper we present two improvements to the partitioning process: 1) A new dynamic buffer man...
. Within the framework of the data warehouse design<E-345> methodology we are developing, in t...
Abstract. In the context of multidimensional databases implemented on relational DBMSs through star ...
Vertical partitioning is the process of subdividing the attributes of a relation into groups, creati...
In this thesis, a mathematical model that describes a “Unique Constraint Domain” is defined. Followi...
An overriding objective in database physical design is to minimize the number of accesses made in th...
In this paper, a new graphical approach to vertical partitioning of a relation is presented. The pro...
The results testing technique of the structural optimization of the relational databases founded on ...
A Vertical Partitioning is the process of dividing the attributes of a relation. Further, a good Ver...
Vertical partitioning, in which attributes of a relation are assigned to partitions, is aimed at imp...
Abstract. Vertical partitioning is a well known technique to improve query response time in relation...
Abstract. We propose a new method for horizontal partitioning of re-lations based on predicate abstr...
In this paper, two-phase horizontal partitioning of distributed databases is addressed. First, prima...
Database partitioning is a useful technique for performance improvement in parallel and dis-tributed...
Vertical partitioning is a crucial step in physical database design in row-oriented databases. A num...
. In this paper we present two improvements to the partitioning process: 1) A new dynamic buffer man...
. Within the framework of the data warehouse design<E-345> methodology we are developing, in t...
Abstract. In the context of multidimensional databases implemented on relational DBMSs through star ...
Vertical partitioning is the process of subdividing the attributes of a relation into groups, creati...
In this thesis, a mathematical model that describes a “Unique Constraint Domain” is defined. Followi...