The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Kami mencadangkan kaedah pemprosesan pertanyaan untuk pangkalan pengetahuan gabungan. Kaedah pemprosesan pertanyaan kami ialah lanjutan daripada teknik set ajaib untuk pemprosesan pertanyaan dalam pangkalan pengetahuan gabungan, ditambah dengan keupayaan mengendalikan atom tergabung. Melalui peraturan penulisan semula dalam pangkalan pengetahuan gabungan yang diberikan, kaedah kami menawarkan kelebihan yang berkaitan dengan penilaian atas ke bawah serta bawah ke atas. Kami membincangkan cara mengendalikan atom bercantum, pertimbangkan cara menyemak sama ada atom bercantum memuaskan dalam set fakta dan cara melanjutkan set fakta dengan memasukkan atom bercantum. Kami juga memberikan prosedur transformasi untuk pangkalan data pengetahuan gabungan dan menunjukkan ketepatan kaedah kami.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Salinan
Lifeng HE, Yuyan CHAO, Tsuyoshi NAKAMURA, Hirohisa SEKI, Hidenori ITOH, "A Query Processing Method for Amalgamated Knowledge Bases" in IEICE TRANSACTIONS on Information,
vol. E82-D, no. 8, pp. 1180-1189, August 1999, doi: .
Abstract: We propose a query processing method for amalgamated knowledge bases. Our query processing method is an extension of the magic sets technique for query processing in amalgamated knowledge bases, augmented with the capabilities of handling amalgamated atoms. Through rewriting rules in a given amalgamated knowledge base, our method offers the advantages associated with top-down as well as bottom-up evaluation. We discuss how to handle amalgamated atoms, consider how to check whether an amalgamated atom is satisfiable in a fact set and how to extend a fact set by inserting an amalgamated atom. We also give the transformation procedures for amalgamated knowledge databases and show the correctness of our method.
URL: https://global.ieice.org/en_transactions/information/10.1587/e82-d_8_1180/_p
Salinan
@ARTICLE{e82-d_8_1180,
author={Lifeng HE, Yuyan CHAO, Tsuyoshi NAKAMURA, Hirohisa SEKI, Hidenori ITOH, },
journal={IEICE TRANSACTIONS on Information},
title={A Query Processing Method for Amalgamated Knowledge Bases},
year={1999},
volume={E82-D},
number={8},
pages={1180-1189},
abstract={We propose a query processing method for amalgamated knowledge bases. Our query processing method is an extension of the magic sets technique for query processing in amalgamated knowledge bases, augmented with the capabilities of handling amalgamated atoms. Through rewriting rules in a given amalgamated knowledge base, our method offers the advantages associated with top-down as well as bottom-up evaluation. We discuss how to handle amalgamated atoms, consider how to check whether an amalgamated atom is satisfiable in a fact set and how to extend a fact set by inserting an amalgamated atom. We also give the transformation procedures for amalgamated knowledge databases and show the correctness of our method.},
keywords={},
doi={},
ISSN={},
month={August},}
Salinan
TY - JOUR
TI - A Query Processing Method for Amalgamated Knowledge Bases
T2 - IEICE TRANSACTIONS on Information
SP - 1180
EP - 1189
AU - Lifeng HE
AU - Yuyan CHAO
AU - Tsuyoshi NAKAMURA
AU - Hirohisa SEKI
AU - Hidenori ITOH
PY - 1999
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E82-D
IS - 8
JA - IEICE TRANSACTIONS on Information
Y1 - August 1999
AB - We propose a query processing method for amalgamated knowledge bases. Our query processing method is an extension of the magic sets technique for query processing in amalgamated knowledge bases, augmented with the capabilities of handling amalgamated atoms. Through rewriting rules in a given amalgamated knowledge base, our method offers the advantages associated with top-down as well as bottom-up evaluation. We discuss how to handle amalgamated atoms, consider how to check whether an amalgamated atom is satisfiable in a fact set and how to extend a fact set by inserting an amalgamated atom. We also give the transformation procedures for amalgamated knowledge databases and show the correctness of our method.
ER -