ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login

FAST NEAREST NEIGHBOUR SEARCH WITHIN ARBITRARY SUBSPACES

Journal: International Journal of Engineering Sciences & Research Technology (IJESRT) (Vol.5, No. 5)

Publication Date:

Authors : ; ;

Page : 213-217

Keywords : spatial inverted index (SI - index); geometric properties .;

Source : Downloadexternal Find it from : Google Scholarexternal

Abstract

A spatial database is a database that is optimized to stor e and query data that represents objects defined in a geometric space. Many spatial queries involve only conditions on objects’ geometric properties for search but the case is modern applications are in need of queries that aim to find objects satisfying b oth a spatial predicate, and a predicate on their associated texts. There are some straight forward approach which first deals with spatial predicate and then on the non - spatial predicate as a process of reduction. But these approaches are not good with c omplex queries. So in this project propose an inverted index called as spatial inverted index (SI - index) which converts the multi - dimensional data objects into ids this reduces the required space for processing which is the main disadvantage of the existin g systems. This project perform location querying in more arbitrary subspaces for example searching hospital with more information’s like heart specialist a nd check rooms availability etc .

Last modified: 2016-05-06 23:21:08