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.

Guardado en:
Detalles Bibliográficos
Autor principal: NGO THANH HUNG
Formato: Artigo
Lenguaje:Russo
Publicado: Don State Technical University 2008-12-01
Colección:Advanced Engineering Research
Materias:
вертикальная кластеризация отношений
vertical partitioning
целевая функция
objective function
оценочный критерий
evaluation criterion
вероятность кэш-попадания
cache hit probability
эвристический алгоритм
heuristic algorithm
Acceso en línea:https://www.vestnik-donstu.ru/jour/article/view/1253
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares