Next-generation search engines will cover the whole spectrum from keyword search on unstructured data over search in fully structured databases to semantic search on ontologies. The goal of this project is the design, analysis, implementation, and application of efficient data structures and algorithms for the underlying fundamental problems, in particular, space-efficient indexing and fast query processing. We will consider very large data sets, up to several terabytes in size, which do not fit into main memory. [more]
Holger Bast (project leader)
Marjan Celikik
Ingmar Weber
Markus Tetzlaff
Try one of various demos of our CompleteSearch engine: CompleteSearch DBLP, CompleteSearch Wikipedia, more demos ...
H. Bast, A. Chitea, F. Suchanek, and I. Weber. ESTER: Efficient Search in Text, Entities, and Relation, SIGIR'07
H. Bast and I. Weber. The CompleteSearch Engine: Interactive, Efficient, and Towards IR&DB integration, CIDR'07
H. Bast and I. Weber. Type Less, Find More: Fast Autocompletion Search with a Succinct Index, SIGIR'06
H. Bast, C. W. Mortensen, and I. Weber. Output-Sensitive Autocompletion Search, SPIRE'06