UM  > 科技學院
Optimal Matching Between Spatial Datasets
Leong Hou U
Source PublicationEncyclopedia of GIS
PublisherSpringer, Boston, MA
Other Abstract

In spatial databases, optimal matching refers to an assignment A between two set of spatial datasets (e.g., customers P and service providers Q) such that the assignment A ⊆ Q × P optimizes the quality of services (i.e., the quality of an assignment pair (qp) can be measured by their Euclidean distance) subject to their capacity constraints (i.e., a service can serve up to k customers concurrently). Typically this problem can be solved by combinatorial optimization solvers or network flow based solutions, where these solutions require a distance-based affiliation matrix between the service providers and clients. For large spatial datasets, the affiliation matrix is expensive to compute and it may be too large to fit in main memory. Motivated by this challenge, some efficient algorithms are proposed for optimal matching that employ novel pruning strategies, based on the spatial properties of the problem.

KeywordGraph Incremental Algorithm Spatial Matching Linear Optimization
Fulltext Access
Citation statistics
Document TypeBook chapter
CollectionFaculty of Science and Technology
AffiliationDepartment of Computer and Information ScienceUniversity of MacauMacau SARChina
First Author AffilicationUniversity of Macau
Recommended Citation
GB/T 7714
Leong Hou U. Optimal Matching Between Spatial Datasets:Springer, Boston, MA,2017:1505-1511.
Related Services
Recommend this item
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Leong Hou U]'s Articles
Baidu academic
Similar articles in Baidu academic
[Leong Hou U]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Leong Hou U]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.