| Project/Area Number |
05558039
|
|---|
| Research Category |
Grant-in-Aid for Developmental Scientific Research (B)
|
| Allocation Type | Single-year Grants |
|---|
| Research Field |
情報システム学(含情報図書館学)
|
|---|
| Research Institution | National Center for Science Information Systems |
|---|
Principal Investigator |
ADACHI Jun National Center for Science Information Systems, Professor, 研究開発部, 教授 (80143551)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
OYAMA Keizo National Center for Science Information Systems, Associate Professor, 研究開発部, 助教授 (90177022)
HASHIZUME Hiromichi National Center for Science Information Systems, Associate Professor, 研究開発部, 助教授 (40172853)
|
|---|
| Project Period (FY) |
1993 – 1995
|
| Project Status |
Completed (Fiscal Year 1995)
|
| Budget Amount *help |
¥8,900,000 (Direct Cost: ¥8,900,000)
Fiscal Year 1995: ¥1,500,000 (Direct Cost: ¥1,500,000)
Fiscal Year 1994: ¥3,400,000 (Direct Cost: ¥3,400,000)
Fiscal Year 1993: ¥4,000,000 (Direct Cost: ¥4,000,000)
|
|---|
| Keywords | Database / Distributed Processing / Heterogeneous Database / Protocol / Multi-database / Query Processing / RPC / Client-Server / Z39,50 / Z39.50 |
|---|
| Research Abstract |
The aim of this research was to investigate the feasibility of heterogeneous federated distributed databases, especially focusing on its application for the document delivary on high-speed wide area networks, such as digital libraries on the Internet.
The first step we have done is a theoretical analysis of the distributed database query processing. In a distributed database with similarities in their schemata, it is required to introduce a query decomposition method for sending sub-queries to each database servers whose database are relevant to the issued query. We studied the decomposition method of queries, introducing the concept of 'virtual database' and 'component database'. The presented method of schema integration allows us to issue a database query without considering logical distribution of component databases, using an algorithm for automatically decomposing the query and transmitting sub-queries to several relevant servers.
Along with the decomposition algorithm and query processing method, a theory for the correctness and soundness of the proposed methods is also developed based on the relational theory.
The presented method can generally provide us a large set of query results than the set given by the conventional methods which issue queries separately to each server. The investigators also showed that the degree of increase of the result set by simulation.
The presented algorithm was implemented on a prototype database system which holds sample bibliographic information. The system, which is operational on a local area network, demonstrated the effectiveness of the presented method by giving larger number of resultant records for example queries.
This investigation could reveal fundamental methods and implementation strategy by theoretical analysis of queries over heterogeneous distributed database environment, and it will be effective on wide-area networks such as the Internet.
|
