Abstract— In this paper, we propose a novel, effective and efficient probabilistic pruning criterion for probabilistic similarity queries on uncertain data. Our approach support...
Thomas Bernecker, Tobias Emrich, Hans-Peter Kriege...
— Uncertain data is quite common nowadays in a variety of modern database applications. At the same time, the join operation is one of the most important but expensive operations...
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the traditional model where the...
Nicolas Broutin, Ralph Neininger, Henning Sulzbach
Integrated access to multiple distributed and autonomous RDF data sources is a key challenge for many semantic web applications. As a reaction to this challenge, SPARQL, the W3C Re...
Query auto completion is known to provide poor predictions of the user’s query when her input prefix is very short (e.g., one or two characters). In this paper we show that con...