Translate 
Abstract
MB-tree, a new index structure for spatial data, its unique data partitioning method is the foundation of MBSQ algorithm proposed in this paper. Partition data space according to the x coordinate and y coordinate alternately until the number of data in each MBR is less than M. Using the dominance relationship between the point and MBR, the MBR and MBR, the middle nodes in the algorithm for skyline query are pruned effectively so that a large number of non-Skyline points can be excluded to improve the efficiency of the algorithm. A small amount of the remaining data points are calculated by using BNL algorithm to obtain the final Skyline set. Finally, the experimental results prove good efficiency and progressiveness of the MBSQ algorithm, and rapid query speed.
Published Version
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