首页 | 本学科首页   官方微博 | 高级检索  
     


Incomplete information in a deductive database
Affiliation:1. Department of Computing, Imperial College London, UK;2. Université Paris-Saclay, Univ Evry, IBISC, 91020, Evry-Courcouronnes, France;3. Université Paris-Saclay, ENS Paris-Saclay, CNRS, LMF, 91190, Gif-sur-Yvette, France;1. School of Computing Queen''s University, Kingston, Canada;2. University of Edinburgh, UK;3. Alan Turing Institute, UK;4. Faculty of Computer Science University of Bozen-Bolzano, Bolzano, Italy;5. Department of Computer Science University of Toronto, Toronto, Canada;6. School of Computing and Information Systems University of Melbourne, Melbourne, Australia
Abstract:The problem of handling incomplete information efficiently has been studied in the context of relational databases by various workers. However, dealing with incomplete information in a deductive database is a more difficult problem. This paper discusses the problem of interpretation of incomplete information in a deductive database and puts forward a model to assist in understanding the different interpretations and their effect on the evaluation of queries.
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号