English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 Local TagsRelease HistoryDetailsSummary
  ESTER: efficient search on Text, Entities, and Relations

Bast, H., Chitea, A., Suchanek, F. M., & Weber, I. (2007). ESTER: efficient search on Text, Entities, and Relations. In C. Clarke, N. Fuhr, N. Kando, W. Kraaij, & A. P. de Vries (Eds.), SIGIR'07: 30th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (pp. 671-678). New York, NY, USA: ACM.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-1F17-3 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-6988-F
Genre: Conference Paper

Files

show Files
hide Files
:
sigir2007.pdf (Any fulltext), 5KB
 
File Permalink:
-
Name:
sigir2007.pdf
Description:
-
OA-Status:
Visibility:
Private
MIME-Type / Checksum:
application/pdf
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Bast, Holger1, Author           
Chitea, Alexandru2, Author           
Suchanek, Fabian M.3, Author           
Weber, Ingmar1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              
2International Max Planck Research School, MPI for Informatics, Max Planck Society, ou_1116551              
3Databases and Information Systems, MPI for Informatics, Max Planck Society, ou_24018              

Content

show
hide
Free keywords: -
 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 GB.

Details

show
hide
Language(s): eng - English
 Dates: 2007
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 356475
DOI: 10.1145/1277741.1277856
Other: Local-ID: C12573CC004A8E26-159464233A30C0C3C12573B0004F57A5-bast@sigir2007
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Amsterdam, The Netherlands
Start-/End Date: 2007-07-23 - 2007-07-27

Legal Case

show

Project information

show

Source 1

show
hide
Title: SIGIR'07 : 30th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval
Source Genre: Proceedings
 Creator(s):
Clarke, Charlie, Editor
Fuhr, Norbert, Editor
Kando, Noriko, Editor
Kraaij, Wessel, Editor
de Vries, Arjen P., Editor
Affiliations:
-
Publ. Info: New York, NY, USA : ACM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 671 - 678 Identifier: ISBN: 978-1-59593-597-7