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.

Na minha lista:
Detalhes bibliográficos
Autor principal: NGO THANH HUNG
Formato: Artigo
Idioma:Russo
Publicado em: Don State Technical University 2008-12-01
coleção:Advanced Engineering Research
Assuntos:
вертикальная кластеризация отношений
vertical partitioning
целевая функция
objective function
оценочный критерий
evaluation criterion
вероятность кэш-попадания
cache hit probability
эвристический алгоритм
heuristic algorithm
Acesso em linha:https://www.vestnik-donstu.ru/jour/article/view/1253
Tags: Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!

Registros relacionados