Language-model-based ranking in entity-relation graphs

We propose a language-model-based ranking approach for SPARQLlike queries on entity-relationship graphs. Our ranking model supports exact matching, approximate structure matching, and approximate matching with text predicates. We show the effectiveness of our model through examples. Categories and Subject Descriptors H.3.3 [Information Storage and Retrieval]: Information Search and Retrieval--Query formulation, Retrieval models General Terms Algorithms, Design, Languages

• Type: Conference
• Year: 2009
• Where: SIGMOD
• Authors: Shady Elbassuoni, Maya Ramanath, Gerhard Weikum
• Keywords: Approximate Matching, Approximate Structure Matching, Database, Exact Matching, SIGMOD 2009