Issue No.09 - Sept. (2012 vol.24)
Fabrizio Angiulli , University of Calabria, Rende
Fabio Fassetti , University of Calabria, Rende
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TKDE.2011.93
In this study, we deal with the problem of efficiently answering range queries over uncertain objects in a general metric space. In this study, an uncertain object is an object that always exists but its actual value is uncertain and modeled by a multivariate probability density function. As a major contribution, this is the first work providing an effective technique for indexing uncertain objects coming from general metric spaces. We generalize the reverse triangle inequality to the probabilistic setting in order to exploit it as a discard condition. Then, we introduce a novel pivot-based indexing technique, called UP-index, and show how it can be employed to speed up range query computation. Importantly, the candidate selection phase of our technique is able to noticeably reduce the set of candidates with little time requirements. Finally, we provide a criterion to measure the quality of a set of pivots and study the problem of selecting a good set of pivots according to the introduced criterion. We report some intractability results and then design an approximate algorithm with statistical guarantees for selecting pivots. Experimental results validate the effectiveness of the proposed approach and reveal that the introduced technique may be even preferable to indexing techniques specifically designed for the euclidean space.
uncertain data, Indexing, metric spaces
Fabrizio Angiulli, Fabio Fassetti, "Indexing Uncertain Data in General Metric Spaces", IEEE Transactions on Knowledge & Data Engineering, vol.24, no. 9, pp. 1640-1657, Sept. 2012, doi:10.1109/TKDE.2011.93