Name
Abstract | ||
|---|---|---|
Probabilistic range query is a typical and a fundamental problem in probabilistic DBMS. Although the existing solutions provide a good performance, there are some shortages that are needed to be overcomed. In this paper, we firstly propose a novel structure called MRST to approximately capture the probability density function of uncertain object. Through considering the gradient of the probability density function, MRST could provide uncertain object with strong pruning power and consume fewer space cost. Based on characters of MRST, we also design an efficient algorithm to access MRST. We propose a novel index named R-MRST to efficiently support range query on multidimensional uncertain data. Its has a strong pruning power. At the same time, it has a lower cost both in space and dynamic update. Theoretical analysis and extensive experimental results demonstrate the effectiveness of the proposed algorithms. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1007/978-3-319-08010-9_10 | WEB-AGE INFORMATION MANAGEMENT, WAIM 2014 |
Field | DocType | Volume |
Data mining,Computer science,Tree (data structure),Range query (data structures),Search engine indexing,Uncertain data,Probabilistic logic,Economic shortage,Probability density function | Conference | 8485 |
ISSN | Citations | PageRank |
0302-9743 | 6 | 0.40 |
References | Authors | |
8 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rui Zhu | 1 | 21 | 3.96 |
| Bin Wang | 2 | 42 | 7.78 |
| Guoren Wang | 3 | 1366 | 159.46 |