ESTER
Authors:
Open Access
- 23 July 2007
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 671-678
Abstract
We present ESTER, a modular and highly efficient system for combined full-text and ontology search. ESTER builds on a query engine that supports two basic operations: prefix search and join. Both of these can be implemented very efficiently with a compact index, yet in combination provide powerful querying capabilities. We show how ESTER can answer basic SPARQL graph-pattern queries on the ontology by reducing them to a small number of these two basic operations. ESTER further supports a natural blend of such semantic queries with ordinary full-text queries. Moreover, the prefix search operation allows for a fully interactive and proactive user interface, which after every keystroke suggests to the user possible semantic interpretations of his or her query, and speculatively executes the most likely of these interpretations. As a proof of concept, we applied ESTER to the English Wikipedia, which contains about 3 million documents, combined with the recent YAGO ontology, which contains about 2.5 million facts. For a variety of complex queries, ESTER achieves worst-case query processing times of a fraction of a second, on a single machine, with an index size of about 4 GBKeywords
This publication has 13 references indexed in Scilit:
- Yago2007
- An Adaptation of the Vector-Space Model for Ontology-Based Information RetrievalIEEE Transactions on Knowledge and Data Engineering, 2006
- MonetDB/XQuery2006
- Semantic Wikipedia2006
- Output-Sensitive Autocompletion SearchLecture Notes in Computer Science, 2006
- Piggy Bank: Experience the Semantic Web Inside Your Web BrowserLecture Notes in Computer Science, 2005
- A case for automated large-scale semantic annotationJournal of Web Semantics, 2003
- Searching XML documents via XML fragments2003
- SemTag and seeker2003
- Finding the flow in web site searchCommunications of the ACM, 2002