|
HKUST Institutional Repository >
Computer Science and Engineering >
CSE Master Theses >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/1783.1/5786
|
| Title: | Group nearest neighbor queries |
| Authors: | Shen, Qiong Mao |
| Issue Date: | 2003 |
| Abstract: | Given two sets of points P and Q, a group nearest neighbor (GNN) query retrieves the point(s) of P with the smallest sum of distances to all points in Q. Consider, for instance, three users at locations q1, q2 and q3 that want to find a meeting point (e.g., a restaurant); the corresponding query returns the data point p that minimizes the sum of Euclidean distances |pqi| for 1≤i≤3. Assuming that Q fits in memory and P is indexed by an R-tree, we propose several algorithms for finding the group nearest neighbors efficiently. As a second step, we extend our techniques for situations where Q cannot fit in memory, covering both indexed and non-indexed query points. An experimental evaluation identifies the best alternative based on the data and query properties. |
| Description: | Thesis (M.Phil.)--Hong Kong University of Science and Technology, 2003
x, 43 leaves : ill. ; 30 cm
HKUST Call Number: Thesis COMP 2003 Shen |
| URI: | http://hdl.handle.net/1783.1/5786 |
| Appears in Collections: | CSE Master Theses
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| th_redirect.html | | 0Kb | HTML | View/Open |
|
All items in this Repository are protected by copyright, with all rights reserved.
|
