DMCA
Efficient and Effective Similarity Search over Probabilistic Data based on Earth Mover’s Distance (2010)
Cached
Download Links
| Citations: | 12 - 3 self |
BibTeX
@MISC{Xu10efficientand,
author = {Jia Xu and Zhenjie Zhang and Anthony K. H. Tung and Ge Yu and Jia Xu and Zhenjie Zhang and Anthony K. H. Tung and Ge Yu},
title = {Efficient and Effective Similarity Search over Probabilistic Data based on Earth Mover’s Distance},
year = {2010}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Probabilistic data is coming as a new deluge along with the technical advances on geographical tracking, multimedia processing, sensor network and RFID. While similarity search is an important functionality supporting the manipulation of probabilistic data, it raises new challenges to traditional relational database. The problem stems from the limited effectiveness of the distance metric supported by the existing database system. On the other hand, some complicated distance operators have proven their values for better distinguishing ability in the probabilistic domain. In this paper, we discuss the similarity search problem with the Earth Mover’s Distance, which is the most successful distance metric on probabilistic histograms and an expensive operator with cubic complexity. We present a new database approach to answer range queries and k-nearest neighbor queries on probabilistic data, on the basis of Earth Mover’s Distance. Our solution utilizes the primal-dual theory in linear programming and deploys B + tree index structures for effective candidate pruning. Extensive experiments show that our proposal dramatically improves the scalability of probabilistic databases. 1
Keyphrases
probabilistic data earth mover effective similarity search k-nearest neighbor query traditional relational database extensive experiment successful distance distance operator limited effectiveness effective candidate pruning multimedia processing primal-dual theory new database approach distinguishing ability new deluge important functionality new challenge geographical tracking probabilistic histogram similarity search problem technical advance linear programming range query similarity search probabilistic domain sensor network expensive operator cubic complexity probabilistic database database system tree index structure
