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.

Wedi'i Gadw mewn:
Manylion Llyfryddiaeth
Prif Awdur: NGO THANH HUNG
Fformat: Artigo
Iaith:Russo
Cyhoeddwyd: Don State Technical University 2008-12-01
Cyfres:Advanced Engineering Research
Pynciau:
вертикальная кластеризация отношений
vertical partitioning
целевая функция
objective function
оценочный критерий
evaluation criterion
вероятность кэш-попадания
cache hit probability
эвристический алгоритм
heuristic algorithm
Mynediad Ar-lein:https://www.vestnik-donstu.ru/jour/article/view/1253
Tagiau: Ychwanegu Tag
Dim Tagiau, Byddwch y cyntaf i dagio'r cofnod hwn!

Eitemau Tebyg