Effectively Indexing the Multi-Dimensional Uncertain Objects for Range Searching

Publisher:
ACM
Publication Type:
Conference Proceeding
Citation:
Proceedings of the 15th International Conference on Extending Database Technology, 2012, pp. 504 - 515
Issue Date:
2012-01
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2013005456OK.pdf413.75 kB
Adobe PDF
The range searching problem is fundamental in a wide spectrum of applications such as radio frequency identification (RFID) networks, location based services (LBS), and global position system (GPS). As the uncertainty is inherent in those applications, it is highly demanded to address the uncertainty in the range search since the traditional techniques cannot be applied due to the inherence difference between the uncertain data and traditional data. In the paper, we propose a novel indexing structure, named U-Quadtree, to organize the uncertain objects in a multi-dimensional space such that the range searching can be answered efficiently by applying filtering techniques. Particularly, based on some insights of the range search on uncertain data, we propose a cost model which carefully considers various factors that may impact the performance of the range searching. Then an effective and efficient index construction algorithm is proposed to build the optimal U-Quadtree regarding the cost model. Comprehensive experiments demonstrate that our technique outperforms the existing works for range searching on multi-dimensional uncertain objects.
Please use this identifier to cite or link to this item: