VERTICAL PARTITIONING RELATIONS METHOD IN RELATIONAL DATABASE

Abstract

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.

Keywords

• вертикальная кластеризация отношений
• vertical partitioning
• целевая функция
• objective function
• оценочный критерий
• evaluation criterion
• вероятность кэш-попадания
• cache hit probability
• эвристический алгоритм
• heuristic algorithm