DocumentCode :
3154202
Title :
Efficient range query processing on uncertain data
Author :
Knight, Andrew ; Yu, Qi ; Rege, Manjeet
Author_Institution :
Dept. of Comput. Sci., Rochester Inst. of Technol., New York, NY, USA
fYear :
2011
fDate :
3-5 Aug. 2011
Firstpage :
263
Lastpage :
268
Abstract :
Uncertain data has emerged as a key data type in many applications. New and efficient query processing techniques need to be developed due to the inherent complexity of this new type of data. In this paper, we investigate a special type of query, range queries, on uncertain data. We propose a threshold interval indexing structure that aims to balance different time consuming factors to achieve an optimal overall query performance. Experimental results are presented to justify the efficiency of the proposed query processing technique.
Keywords :
computational complexity; indexing; query processing; data type; inherent complexity; optimal overall query performance; query processing techniques; range query processing; threshold interval indexing structure; uncertain data; Indexing; Probability density function; Query processing; Slabs; Uncertainty;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Reuse and Integration (IRI), 2011 IEEE International Conference on
Conference_Location :
Las Vegas, NV
Print_ISBN :
978-1-4577-0964-7
Electronic_ISBN :
978-1-4577-0965-4
Type :
conf
DOI :
10.1109/IRI.2011.6009557
Filename :
6009557
Link To Document :
بازگشت