DSpace DSpace 日本語
 

AIT Associated Repository of Academic Resources >
A.研究報告 >
A1 愛知工業大学研究報告 >
3.愛知工業大学研究報告 .B(1976-2007) >
27号 >

Please use this identifier to cite or link to this item: http://hdl.handle.net/11133/881

Title: 緩和法による演繹データベースの問い合わせ評価
Other Titles: カンワホウ ニヨル エンエキ データベース ノ トイアワセ ヒョウカ
Using Relaxation Techniques to Evaluate Queries in Deductive Databases
Authors: 鈴木, 晋
茨木, 俊秀
岸, 政七
SUZUKI, Susumu
IBARAKI, Toshihide
KISHI, Masahichi
Issue Date: 31-Mar-1992
Publisher: 愛知工業大学
Abstract: Relaxation method is a general framework used to improve the efficiency of answering a query q(a, x) given to a deductive database P. It first solves problem (q'(a', x'), P^<RLX>), where P^<RLX> is a relaxation of the original database P and q'(a', x') is the modified query to P^<RLX>, to derive a set PREL of predicate occurrences that is known to contain the answer set ANS in P, and construct database P^<MDF> by augmenting P with the restriction that solution space is constrained to PREL, and finally solves problem (q(a, x), P^<MDF>) to get the desired answer set ANS. If the relaxation P^<RLX> is properly defined, (q'(a', x'), P^<RLX>) can be efficiently solved since P^<RLX> is simpler than P, and (q(a, x), P^<MDF>) can also be efficiently solved as the solution space is restricted. Several methods are proposed to construct such relaxations. It is also argued that the original form of magic set method [2] can be described in the context of the relaxation method.
URI: http://hdl.handle.net/11133/881
Appears in Collections:27号

Files in This Item:

File Description SizeFormat
紀要27号B(P207-215).pdf1.21 MBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

 

Valid XHTML 1.0! DSpace Software Copyright © 2002-2010  Duraspace - Feedback