Abstract
In this paper, we introduce a novel type of spatial query called the Reverse View Field Nearest Neighbor (RVFNN) query. To process the query, we propose two query processing methods on an R*-tree: (1) RVFNN query processing on a sector-based R*-tree and (2) RVFNN query processing on an origin-based R*-tree. In addition, we propose a new type of spatial data index structure called the View Field R-tree (VFR-tree) and a search method for RVFNN queries on the VFR-tree. The VFR-tree overcomes the limitations of the R*-tree by considering both origins and sectors. We carry out various experiments to evaluate the performance and verify the efficiency of the proposed methods.
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.
