Abstract
An index structure adequate for broadcasting environments must consider the order of data delivery, index size, and selective tuning. This paper introduces a light-weight bit sequence grid-based spatial index, referred to as a binary quadtree, which allows for the sequential search and selective tuning of data. Then, the paper suggests a search algorithm that can efficiently search spatial objects. The results from theoretical analysis and experiments show that the proposed algorithm with the binary quadtree is fast and energy efficient in both range queries and k-nearest neighbor queries.
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.
