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:
書目詳細資料
主要作者: NGO THANH HUNG
格式: Artigo
語言:Russo
出版: Don State Technical University 2008-12-01
叢編:Advanced Engineering Research
主題:
вертикальная кластеризация отношений
vertical partitioning
целевая функция
objective function
оценочный критерий
evaluation criterion
вероятность кэш-попадания
cache hit probability
эвристический алгоритм
heuristic algorithm
在線閱讀:https://www.vestnik-donstu.ru/jour/article/view/1253
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!

相似書籍