An assertion retrieval algebra for object queries over knowledge bases

Authors:
Jeffrey Pound;David Toman;Grant Weddell;Jiewen Wu
Affiliations:
Cheriton School of Computer Science, University of Waterloo, Canada;Cheriton School of Computer Science, University of Waterloo, Canada;Cheriton School of Computer Science, University of Waterloo, Canada;Cheriton School of Computer Science, University of Waterloo, Canada
Venue:
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Year:
2011

Citing 5
Cited 0

Principles of dataspace systems

Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Making database systems usable

Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Towards a theory of search queries

Proceedings of the 12th International Conference on Database Theory
Semantic Modularity and Module Extraction in Description Logics

Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Querying faceted databases

SWDB'04 Proceedings of the Second international conference on Semantic Web and Databases

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a generalization of instance retrieval over knowledge bases that provides users with assertions in which descriptions of qualifying objects are given in addition to their identifiers. Notably, this involves a transfer of basic database paradigms involving caching and query rewriting in the context of an assertion retrieval algebra. We present an optimization framework for this algebra, with a focus on finding plans that avoid any need for general knowledge base reasoning at query execution time when sufficient cached results of earlier requests exist.