VERTICAL PARTITIONING RELATIONS METHOD IN RELATIONAL DATABASE

Advanced Engineering Research

NGO THANH HUNG¹ 

[1] Don State Technical University.;

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

DOI  :  

来源: DOAJ

【 摘 要 】

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.

【 授权许可】

Unknown