|
|
naistar (NAIST Academic Repository) >
学術リポジトリ naistar / NAIST Academic Repository naistar >
テクニカルレポート / Technical Report >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/10061/3129
|
| Title: | The Type-Consistency Problem for Queries in Object-Oriented Databases |
| Authors: | Ishihara, Yasunori
Shimizu, Shougo
Seki, Hiroyuki
Ito, Minoru
イシハラ, ヤスノリ
シミズ, ショウゴ
セキ, ヒロユキ
イトウ, ミノル
石原, 靖哲
清水, 將吾
関, 浩之
伊藤, 実 |
| Issue Date: | Apr-1998 |
| Publisher: | Nara Institute of Science and Technology |
| Series/Report no.: | Information Science Technical Report ~ TR98004 |
| Abstract: | Method invocation mechanism is one of the essential features in object-oriented programming languages. This mechanism contributes to data encapsulation and code reuse, but there is a risk of a run-time type error. In the case of object-oriented databases (OODBs), a run-time error causes rollback. Therefore, it is desirable to ensure that a given OODB schema is consistent, i.e., norun-time type error occurs during the execution of queries under any database instance
of the OODB schema. This paper discusses the computational complexity of the type-consistency problem. As a model of OODB schemas, we adopt update schemas introduced by Hull et al., which have all of the basic features of OODBs such as class hierarchy, inheritance, complex objects, and so on. For several subclasses of update schemas,the complexity of the type-consistency problem is presented. Importantly, it turns out that non-flatness of the class hierarchy, recursionin the queries, and update operations in the queries each make the problem difficult. |
| URI: | http://hdl.handle.net/10061/3129 |
| URI: | http://library.naist.jp/mylimedio/dllimedio/show.cgi?bookid=19777 |
| Fulltext: | http://library.naist.jp/mylimedio/dllimedio/show.cgi?bookid=19777 |
| ISSN: | 0919-9527 |
| Text Version: | author |
| Appears in Collections: | テクニカルレポート / Technical Report
|
Files in This Item:
There are no files associated with this item.
|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
|
