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.

Guardat en:
Dades bibliogràfiques
Autor principal: NGO THANH HUNG
Format: Artigo
Idioma:Russo
Publicat: Don State Technical University 2008-12-01
Col·lecció:Advanced Engineering Research
Matèries:
вертикальная кластеризация отношений
vertical partitioning
целевая функция
objective function
оценочный критерий
evaluation criterion
вероятность кэш-попадания
cache hit probability
эвристический алгоритм
heuristic algorithm
Accés en línia:https://www.vestnik-donstu.ru/jour/article/view/1253
Etiquetes: Afegir etiqueta
Sense etiquetes, Sigues el primer a etiquetar aquest registre!

Ítems similars