Call For Paper Volume:4 Issue:10 Oct'2017 |

INDEXING ON UNCERTAN DATA USING U-QUADTREE

Publication Date : 31/03/2015



Author(s) :

Mr. Sangram Tukaram Patil , Mrs. R. J. Deshmukh.


Volume/Issue :
Volume 2
,
Issue 3
(03 - 2015)



Abstract :

In recent year, in many applications like radio frequency identification (RFID) networks and location-based services (LBS), it is highly demanded to address the uncertainty of the objects. For effective indexing of such uncertain one dimensional objects MV-Tree, US+ Tree [2] structure can be used which helps in effectively searching of them. These structures are used for Range Query, Nearest Neighbor Query. But these structures are not used if uncertain objects are in multidimensional structure. More focus is on indexing multidimensional uncertain objects for effective and efficient searching. So for this using a novel indexing structure, named U-Quadtree [1], for efficient processing of uncertain object in multidimensional space novel indexing through U-Quadtree is prepared. In this a cost model which carefully considers various factors that may impact the performance. An effective and efficient index construction algorithm is proposed to build the optimal U-Quadtree regarding the cost model. U-Quadtree can also efficiently support other types of queries such as uncertain range query and nearest neighbor query.


No. of Downloads :

14


Indexing

Web Design MymensinghPremium WordPress ThemesWeb Development

INDEXING ON UNCERTAN DATA USING U-QUADTREE

March 31, 2015