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.
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | Russian |
| Published: |
Don State Technical University
2008-12-01
|
| Series: | Advanced Engineering Research |
| Online Access: | https://www.vestnik-donstu.ru/jour/article/view/1253 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|