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.