Abstract
Sensor management plays an important role in the field of Internet of Things. Therefore, the requests of spatial approximate query increase dramatically. Indexing is no doubt a feasible way for efficient spatial approximate search. However, there is a lack of an effective index structure for spatial approximate query. In this paper, we propose a new type of index structure called SR-tree for providing more intelligent retrieval, which is based on R-tree and inverted table. Our index can support for spatial approximate search and work freely either in memory or external memory. The experimental results show that the structure proposed can provide high scalability and fast response time.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
