Capacity constrained assignment in spatial databases
Hou U L.1; Yiu M.L.2; Mouratidis K.3; Mamoulis N.1
Conference Namethe 2008 ACM SIGMOD international conference on Management of data
Source PublicationProceedings of the 2008 ACM SIGMOD international conference on Management of data
Conference DateJune 09 - 12, 2008
Conference PlaceVancouver, Canada

Given a point set P of customers (e.g., WiFi receivers) and a point set Q of service providers (e.g., wireless access points), where each q ∈ Q has a capacity q.k, the capacity constrained assignment (CCA) is a matching M ⊆ Q × P such that (i) each point q ∈ Q (p ∈ P) appears at most k times (at most once) in M, (ii) the size of M is maximized (i.e., it comprises min{|P|, Σq.k} pairs), and (iii) the total assignment cost (i.e., the sum of Euclidean distances within all pairs) is minimized. Thus, the CCA problem is to identify the assignment with the optimal overall quality; intuitively, the quality of q's service to p in a given (q, p) pair is anti-proportional to their distance. Although max-flow algorithms are applicable to this problem, they require the complete distance-based bipartite graph between Q and P. For large spatial datasets, this graph is expensive to compute and it may be too large to fit in main memory. Motivated by this fact, we propose efficient algorithms for optimal assignment that employ novel edge-pruning strategies, based on the spatial properties of the problem. Additionally, we develop approximate (i.e., suboptimal) CCA solutions that provide a trade-off between result accuracy and computation cost, abiding by theoretical quality guarantees. A thorough experimental evaluation demonstrates the efficiency and practicality of the proposed techniques. Copyright 2008 ACM.

KeywordOptimal Assignment Spatial Databases
URLView the original
Fulltext Access
Citation statistics
Document TypeConference paper
Affiliation1.The University of Hong Kong
2.Aalborg Universitet
3.Singapore Management University
Recommended Citation
GB/T 7714
Hou U L.,Yiu M.L.,Mouratidis K.,et al. Capacity constrained assignment in spatial databases[C],2008:15-27.
APA Hou U L.,Yiu M.L.,Mouratidis K.,&Mamoulis N..(2008).Capacity constrained assignment in spatial databases.Proceedings of the 2008 ACM SIGMOD international conference on Management of data,15-27.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Hou U L.]'s Articles
[Yiu M.L.]'s Articles
[Mouratidis K.]'s Articles
Baidu academic
Similar articles in Baidu academic
[Hou U L.]'s Articles
[Yiu M.L.]'s Articles
[Mouratidis K.]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Hou U L.]'s Articles
[Yiu M.L.]'s Articles
[Mouratidis K.]'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.