An Assertion Retrieval Algebra for Object Queries over Knowledge Bases
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.
Cite
Text
Pound et al. "An Assertion Retrieval Algebra for Object Queries over Knowledge Bases." International Joint Conference on Artificial Intelligence, 2011. doi:10.5591/978-1-57735-516-8/IJCAI11-180Markdown
[Pound et al. "An Assertion Retrieval Algebra for Object Queries over Knowledge Bases." International Joint Conference on Artificial Intelligence, 2011.](https://mlanthology.org/ijcai/2011/pound2011ijcai-assertion/) doi:10.5591/978-1-57735-516-8/IJCAI11-180BibTeX
@inproceedings{pound2011ijcai-assertion,
title = {{An Assertion Retrieval Algebra for Object Queries over Knowledge Bases}},
author = {Pound, Jeffrey and Toman, David and Weddell, Grant E. and Wu, Jiewen},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2011},
pages = {1051-1056},
doi = {10.5591/978-1-57735-516-8/IJCAI11-180},
url = {https://mlanthology.org/ijcai/2011/pound2011ijcai-assertion/}
}