Efficient indexing for semantic search

详细信息    查看全文

• 作者：Fatemeh Lashkari^a ; ^{fatemeh.lashkari@unb.ca} ; Faezeh Ensan^b ; ^{ensan@um.ac.ir} ; Ebrahim Bagheri ; ^c ; ^{bagheri@ryerson.ca} ; ^{ebrahim.bagheri@gmail.com} ; Ali A. Ghorbani^d ; ^{ghorbani@unb.ca}
• 关键词：Semantic web ; Entity linking ; Semantic search ; Inverted indices
• 刊名：Expert Systems with Applications
• 出版年：2017
• 出版时间：1 May 2017
• 年：2017
• 卷：73
• 期：Complete
• 页码：92-114
• 全文大小：3015 K
• 卷排序：73

文摘

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.