返回
Nearest Surrounder Queries
DOI:10.1109/TKDE.2009.172.png)
摘要
En 中文
In this paper, we present a new type of spatial queries called Nearest Surrounder (NS) queries. An NS query determines the nearest polygon-shaped spatial objects (referred to as nearest surrounder objects) and their orientations with respect to a query point from an object set. Besides, we derive two NS query variants, namely, multitier NS (m-NS) queries and angle-constrained NS (ANS) queries. An m-NS query searches multiple layers of NS objects for the same range of angles from a query point. An ANS query searches for NS objects within a specified range of angles. To evaluate NS queries and their variants, we explore angle-based and distance-based bound properties of polygons, and devise two efficient algorithms, namely, Sweep and Ripple, based on R-tree. The algorithms access objects in an order according to their orientations and distances with respect to a given query point, respectively. They are efficient as they can finish a search with one index lookup. Besides, they can progressively deliver a query result. Through empirical studies, we evaluate the proposed algorithms and report their performance for both synthetic and real object sets.
Keyword:
Spatial query processing
nearest surrounder queries
R-tree
algorithms
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.4
论文数:
6.8K
被引数:
3.2W
机构
引用论文
Immunoprotection against influenza virus H9N2 by the oral administration of recombinant Lactobacillus plantarum NC8 expressing hemagglutinin in BALB/c mice
Virology
IF0
Embryo incubation by time-lapse systems versus conventional incubators in Chinese women with diminished ovarian reserve undergoing IVF/ICSI: a study protocol for a randomised controlled trial
BMJ Open
IF0

