Abstract
Conservative spatial queries, such as range search and nearest neighbor reclamation, involve only cond itions on objects’ numerical properties. Today, many modern applications call fo r novel forms of queries that aim to find objects s atisfying both a spatial predicate, and a predicate on their associated text s. For example, instead of considering all the rest aurants, a nearest neighbor query would instead ask for the restaurant that is the cl osest among those whose menus contain “steak, spagh etti, brandy” all at the same time. Currently the best solution to such queries ibased on the InformationRetrieval2-tree, which, h as a few deficiencies that seriously impact its efficiency. Motivated by this, there is a development of a new access method call ed the spatial inverted index that extends the conventional inverted index to cope wit h multidimensional data, and comes with algorithms that can answer nearest neighbor queries with keywords in real time. As ver ified by experiments, the proposed techniques outpe rform the InformationRetrieval2-tree in query response time soften by a factor of orders of magnit ude
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
