| タイトル |
-
多変数線形再帰型演繹データベースに対する逆数え上げ評価法
|
| その他のタイトル |
-
タヘンスウ センケイ サイキガタ エンエキ データベース ニ タイスル ギャクカゾエアゲ ヒョウカホウ
-
Reverses Counting Method for Linear Recursive Query with Many Cyclic Extensional Predicates
|
| 作成者 |
|
| 内容注記 |
-
Other
We consider to answer a datalog program that is a generalization of the well known same generation problem in the sense that it is defined over Cartesian product of m extensional predicates r_i. Each r_i is in general assumed to be cyclic. We present a method, which is the reverse counting method with a modification of termination test to deal correctly with cyclic predicates r_i, and analyze its three costs of complexity : space-requirement, database-access-time and test-time. When compared with the magic set method, which is also applicable to the same problem, this reverse counting method is inferior in the sense of worst-case bound of test-time but competitive in worst-case costs of other two. Some simulations are also conducted to examine these costs on randomly generated r_i. According to the simulation results, however, the reverse counting method is superior to the magic set method by orders of magnitude in the costs of space-requirement and database-access-time, and is in the same order in the cost of test-time.
-
Other
identifier:http://repository.aitech.ac.jp/dspace/handle/11133/867
|
| 出版者 |
愛知工業大学
|
| 日付 |
|
| 言語 |
|
| 資源タイプ |
research report |
| 出版タイプ |
NA |
| 資源識別子 |
URI
http://hdl.handle.net/11133/867
|
| 収録誌情報 |
-
-
NCID
AN00007801
-
ISSN
0387-0812
-
愛知工業大学研究報告. B, 専門関係論文集 = Bulletin of Aichi Institute of Technology. Part B
-
巻26
開始ページ167
終了ページ171
|
| ファイル |
|
| コンテンツ更新日時 |
2021-04-15 |
