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.

保存先:
書誌詳細
第一著者: 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
タグ: タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!

類似資料