Efficient indexing for semantic search

作者：

Highlights：

• Keyword, entity and type information can be integrated to perform semantic search.

• Treaps are the most efficient for ranked union and intersection queries.

• HashMap is the most efficient in answering Boolean intersection queries.

摘要

•Keyword, entity and type information can be integrated to perform semantic search.•Treaps are the most efficient for ranked union and intersection queries.•HashMap is the most efficient in answering Boolean intersection queries.

论文关键词：Semantic web,Entity linking,Semantic search,Inverted indices

论文评审过程：Received 31 August 2016, Revised 7 December 2016, Accepted 23 December 2016, Available online 24 December 2016, Version of Record 28 December 2016.

论文官网地址：https://doi.org/10.1016/j.eswa.2016.12.033