Chargement en cours...
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.
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Artigo |
| Langue: | Russo |
| Publié: |
Don State Technical University
2008-12-01
|
| Collection: | Advanced Engineering Research |
| Sujets: | |
| Accès en ligne: | https://www.vestnik-donstu.ru/jour/article/view/1253 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|