VERTICAL PARTITIONING RELATIONS METHOD IN RELATIONAL DATABASE
Abstract
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.
References
1. Sharma Chakravarthy, Jaykumar Muthuraj, Ravi Varadarajan, Shamkant B. Navathe. An Objective Function for Vertically Partitioning Relations in Distributed Databases and its Analysis. In Distributed and Parallel Databases 2(2): 183-207(1994).
2. Sanjay Agrawal, Vivek Narasayya, Beverly Yang. Integrating Vertical and Horizontal Partitioning into Automated Physical Database Design. In SIGMOD 2004, June, 2004.
3. К. Дж. Дейт. Введение в системы баз данных. 7-е издание/К.Дж.Дейт. -М., СПб, Киев: Вильямс, 2001.
4. Вильям Пэйдж, Дэвид Остин, Виллард Берд II, Николас Чейз и др. Специальное издание: Использование Oracle8/8I. Вильямс, 2000.
5. Ковалев М.М. Дискретная оптимизация -Целочисленное программирование/М.М.Ковалев.-М.: УРСС, 2003.
6. Таненбаум Э. Современные операционные системы/Э.Таненбаум. -СПб: Питер, 2004.
7. Natallia Kokash. An introduction to heuristic algorithms. 2005//<http://dit.unitn.it/~kokash/documents/Heuristic_algorithms.pdf>
Review
For citations:
HUNG N. VERTICAL PARTITIONING RELATIONS METHOD IN RELATIONAL DATABASE. Vestnik of Don State Technical University. 2008;8(4):126-136. (In Russ.)
Views:
288
Email this article 