The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Traditional nearest neighbor queries and its variants, such as Group Nearest Neighbor Query (GNN), have been widely studied by many researchers. Recently obstacles are involved in spatial queries. The existence of obstacles may affect the query results due to the visibility of query point. In this paper, we propose a new type of query, Group Visible Nearest Neighbor Query (GVNN), which considers both...
Given a data point set D, a query point set Q, and an integer k, the Group Nearest Group (GNG) query finds a subset \omega (\vert \omega \vert \le k) of points from D such that the total distance from all points in Q to the nearest point in \omega is not greater than any other subset \omega^{\prime } (\vert \omega^{\prime }\vert \le k) of points in D. GNG query is a partition-based clustering problem...
Given a set of spatial points containing keywords information, a set of query objects Q and m query keywords, a top-k aggregate nearest keyword (ANK) query retrieves k objects from Q with the minimum sum of distances to its nearest points in D such that each nearest point matches at least one of query keywords. For example, consider there is a spatial database D which manages facilities (e.g., school,...
Given a data set P and a query set Q, a group nearest group (GNG) query returns a k-subset M of P such that M minimizes the total distance cost from each query point in Q to its closest point in M. In this paper we extend the GNG query to its dynamic version, which is called continuous group nearest group (CGNG) query. A hill climbing schemed algorithm, ADM, is proposed to efficiently solve CGNG problem...
This paper proposes an agent-based data access mechanism of mobile device. In the mechanism, mobile device use agents to manage local database and connect to remote agent. Remote agent receives data and query remote database. The local database is designed using partial detailed concept. The partial detailed database can store different details of content for query to avoid unnecessary connection...
Given a data point set D, a query point set Q and an integer k, the group nearest group (GNG) query finds a subset of points from D, omega (|omega| les k), such that the total distance from all points in Q to the nearest point in omega is no greater than any other subset of points in D, omega(|omega| les k). GNG query can be found in many real applications. In this paper, exhaustive hierarchical combination...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.