1. Ir-tree query processing in spatial database
Authors : Prabhakar Konda, Devender Are
Pages : 60-66
DOI : http://dx.doi.org/10.21172/1.72.510
Keywords : Spatial Indexing, Neighbour Search Abstract :Standard spatial inquiries, such because range search and local neighbour access, involve simply conditions in objects’ geometric properties. Today, many modern-day applications necessitate novel varieties of queries that seek to find things satisfying both equally a spatial predicate, as well as a predicate on the associated scrolls. For example, instead connected with considering all of the restaurants, a local neighbour question would instead ask for the restaurant this is the closest those types of whose selections contain “steak, spaghetti, brandy†all at the same time. Currently, the best solution to such queries will depend on the IR2-tree, which, as shown on this paper, incorporates a few deficiencies that severely impact it's efficiency. Determined by this kind of, this paper produce a new accessibility method termed the spatial inverted index in which extends the standard inverted index to cope with multidimensional information, and is sold with algorithms that could answer local neighbour inquiries with keywords in real time.
Citing this Journal Article :Prabhakar Konda, Devender Are, "Ir-tree query processing in spatial database", Volume 7 Issue 2 - July 2016, 60-66
Click here to Submit Copyright Takedown Notice for this article.