ABSTRACT

Traditional spatial questions, for example, go converted and closest neighbor retrieval; include just specification on items geometric properties. Today, numerous cutting edge applications call for novel types of inquiries that intend to discover the articles or element area fulfilling both a spatial predicate, and a predicate on their related content keys. For instance, rather than considering every one of the eateries, healing centers, parks,… and so forth a closest neighbor question would rather request the eatery that is the nearest among those whose menus contain "whisky, lager, meat, rum, cognac" all menu Items are accessible in the meantime, At single area accessible. Right now the best answers for such questions manage on the IR2-trees computation to utilize it .To find out the right outcomes. It has couples of unsatisfied that truly affect its productiveness. Persuaded by this, we build up another entrance strategy called the special rearranged list technique. That can be reaches out to the customary altered record to adapt to multidimensional proposition information, and accompanies computation that can answer closest neighbor inquiries with catchphrases continuously. As constant by tests, the project scheme beat the IR2-tree computation. in inquiry reaction time fundamentally, regularly by a factor of requests of greatness.