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.

Uloženo v:
Podrobná bibliografie
Hlavní autor: NGO THANH HUNG
Médium: Artigo
Jazyk:Russo
Vydáno: Don State Technical University 2008-12-01
Edice:Advanced Engineering Research
Témata:
вертикальная кластеризация отношений
vertical partitioning
целевая функция
objective function
оценочный критерий
evaluation criterion
вероятность кэш-попадания
cache hit probability
эвристический алгоритм
heuristic algorithm
On-line přístup:https://www.vestnik-donstu.ru/jour/article/view/1253
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo otaguje tento záznam!
Načítá se...

Podobné jednotky