3 papers
cs.SI2011
Maximum Gain Round Trips with Cost Constraints
Franz Graf, Hans-Peter Kriegel, Matthias Schubert
Searching for optimal ways in a network is an important task in multiple application areas such as social networks, co-citation graphs or road networks. In the majority of applicat…
cs.DB2011
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…
cs.DB2009
Scalable Probabilistic Similarity Ranking in Uncertain Databases (Technical Report)
Thomas Bernecker, Hans-Peter Kriegel, Nikos Mamoulis +2
This paper introduces a scalable approach for probabilistic top-k similarity ranking on uncertain vector data. Each uncertain object is represented by a set of vector instances tha…