Nearest Surrounder Queries
نویسندگان
چکیده
منابع مشابه
Efficient Processing of Nearest Surrounder Query for 3D Geospatial Data
The Nearest Surrounder (NS) query is to find a set of all the visible objects that are not obstructed by other objects around the query location. Formally, for a given query Q and dataset D, NS(Q) returns a set of tuples, i i i i O n , , : if and only if (i) Oi Î R and Oi is visible to Q, and (ii) "Oj Î ROi { } , dist Q,Oi ( ) £ dist Q,Oj ( ) at angular range i i , , where i...
متن کاملConstrained Nearest Neighbor Queries
In this paper we introduce the notion of constrained nearest neighbor queries (CNN) and propose a series of methods to answer them. This class of queries can be thought of as nearest neighbor queries with range constraints. Although both nearest neighbor and range queries have been analyzed extensively in previous literature, the implications of constrained nearest neighbor queries have not bee...
متن کاملNearest Window Cluster Queries
In this paper, we study a novel type of spatial queries, namely Nearest Window Cluster (NWC) queries. For a given query location q, NWC (q, l,w,n) retrieves n objects within a window of length l and width w, where the distance between the query location q to these n objects is the shortest. To facilitate efficient NWC query processing, we identify several properties and accordingly develop an N...
متن کاملVisible Nearest Neighbor Queries
We introduce the visible k nearest neighbor (VkNN) query, which finds the k nearest objects that are visible to a query point. We also propose an algorithm to efficiently process the VkNN query. We compute the visible neighbors incrementally as we enlarge the search space. Our algorithm dramatically reduces the search cost compared to existing methods that require the computation of the visibil...
متن کاملIn-Route Nearest Neighbor Queries
Nearest neighbor query is one of the most important operations in spatial databases and their application domains, such as location-based services and advanced traveler information systems . This paper addresses the problem of finding the in-route nearest neighbor (IRNN) for a query object tuple which consists of a given route with a destination and a current location on it. The IRNN is a facil...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Knowledge and Data Engineering
سال: 2010
ISSN: 1041-4347
DOI: 10.1109/tkde.2009.172