Abstract. Distributed moving object database servers are a feasible solution to the scalability problem of centralized database systems. In this paper we propose a distributed inde...
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...
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
Many DBMS products in the market provide built in encryption support to deal with the security concerns of the organizations. This solution is quite effective in preventing data ...
Mustafa Canim, Murat Kantarcioglu, Bijit Hore, Sha...
This paper introduces U-relations, a succinct and purely relational representation system for uncertain databases. U-relations support attribute-level uncertainty using vertical pa...
Lyublena Antova, Thomas Jansen, Christoph Koch, Da...