LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

A hierarchical binary quadtree index for spatial queries

Photo from wikipedia

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… Click to show full 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.

Keywords: quadtree index; index spatial; hierarchical binary; binary quadtree; index

Journal Title: Wireless Networks
Year Published: 2019

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.