14 citations · 42 across the 11 of their papers we have counts for
7 papers · 1 filter
Complete and Sufficient Spatial Domination of Multidimensional Rectangles
Tobias Emrich, Hans-Peter Kriegel, Andreas Züfle +2
Rectangles are used to approximate objects, or sets of objects, in a plethora of applications, systems and index structures. Many tasks, such as nearest neighbor search and similar…
Towards Knowledge-Enriched Path Computation
Georgios Skoumas, Klaus Arthur Schmid, Gregor Jossé +4
Directions and paths, as commonly provided by navigation systems, are usually derived considering absolute metrics, e.g., finding the shortest path within an underlying road networ…
Probabilistic Nearest Neighbor Queries on Uncertain Moving Object Trajectories
Johannes Niedermayer, Andreas Züfle, Tobias Emrich +4
Nearest neighbor (NN) queries in trajectory databases have received significant attention in the past, due to their application in spatio-temporal data analysis. Recent work has co…
Inverse Queries For Multidimensional Spaces
Thomas Bernecker, Tobias Emrich, Hans-Peter Kriegel +4
Traditional spatial queries return, for a given query object , all database objects that satisfy a given predicate, such as epsilon range and -nearest neighbors. This paper d…
A Novel Probabilistic Pruning Approach to Speed Up Similarity Queries in Uncertain Databases
Thomas Bernecker, Tobias Emrich, Hans-Peter Kriegel +3
In this paper, we propose a novel, effective and efficient probabilistic pruning criterion for probabilistic similarity queries on uncertain data. Our approach supports a general u…
Probabilistic Frequent Pattern Growth for Itemset Mining in Uncertain Databases (Technical Report)
Thomas Bernecker, Hans-Peter Kriegel, Matthias Renz +2
Frequent itemset mining in uncertain transaction databases semantically and computationally differs from traditional techniques applied on standard (certain) transaction databases.…