Internet version
of the research journal
 English

2009:

1 2 3 4

2008:

1 2 3 4

2007:

1 2 3 4

2006:

1 2 3 4

2005:

1 2 3 4
5
 

Vertical partitioning relations method in relational database

In 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. Index terms: vertical partitioning, objective function, evaluation criterion, cache hit probability, heuristic algorithm.

 
© Don state technical university