An Implementation Scheme of Relational Tables Based on History Offset Method and Its Evaluation
| Project/Area Number |
17500065
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
Media informatics/Database
|
|---|
| Research Institution | University of Fukui |
|---|
Principal Investigator |
TSUJI Tatsuo University of Fukui, Graduate School of Engineering, Professor, 工学研究科, 教授 (80115302)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
HIGUCHI Ken University of Fukui, Graduate School of Engineering, Associate Professor, 工学研究科, 助教授 (50293410)
|
|---|
| Project Period (FY) |
2005 – 2006
|
| Project Status |
Completed (Fiscal Year 2006)
|
| Budget Amount *help |
¥3,000,000 (Direct Cost: ¥3,000,000)
Fiscal Year 2006: ¥1,500,000 (Direct Cost: ¥1,500,000)
Fiscal Year 2005: ¥1,500,000 (Direct Cost: ¥1,500,000)
|
|---|
| Keywords | Multidimensional Array / Extendible Array / Relational Table / Record Encoding / MOLAP |
|---|
| Research Abstract |
In this year, based on the relational database kernel implemented by history offset method called HORT developed in the last year, schemes of higher level subsystems of relational database system have been designed, implemented and evaluated. These schemes include: 1. Processing scheme of range key queries, 2. Parallel processing scheme, 3. design and implementation of SQL processors, 4. Design of complex objects.
1. In our proposed scheme, since a record can be mapped to an element of a multidimensional extendible array and the element position is mapped to linear address space, dimension dependency problem would be caused in a range key retrieval. This problem has been alleviated by designing a scheme considering the characteristics of HORT data structure. Using the implemented prototype system, the performance of range key queries has been measured and evaluated.
2. An extendible array, which is the underlying data structure in HORT, is suited to parallel processing. Focusing on this good property of HORT, we have designed and implemented a load balancing scheme and synchronizing scheme of collecting retrieval results. Using the implemented prototype system, the performance of parallel retrieval scheme has been measured.
3. We are now under construction of SQL processor incorporating the range key query processing scheme in 1. Especially an efficient scheme of processing table join operation is being designed and implemented.
4. A complex object has an object ID of another object as its reference attribute. We have proposed an efficient handling scheme of complex objects set by introducing the notion of record ID into the original HORT data structure.
|
Report
(3 results)
Research Products
(24 results)
