Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/29315
Title: Optimal matching between spatial datasets under capacity constraints
Authors: U, LH
Mouratidis, K
Yiu, ML 
Mamoulis, N
Keywords: Optimal assignment
Spatial databases
Issue Date: 2010
Publisher: Assoc Computing Machinery
Source: ACM transactions on database systems, 2010, v. 35, no. 2, 9 How to cite?
Journal: ACM Transactions on Database Systems 
Abstract: Consider a set of customers (e.g., WiFi receivers) and a set of service providers (e.g., wireless access points), where each provider has a capacity and the quality of service offered to its customers is anti-proportional to their distance. The Capacity Constrained Assignment (CCA) is a matching between the two sets such that (i) each customer is assigned to at most one provider, (ii) every provider serves no more customers than its capacity, (iii) the maximum possible number of customers are served, and (iv) the sum of Euclidean distances within the assigned provider-customer pairs is minimized. Although max-flow algorithms are applicable to this problem, they require the complete distance-based bipartite graph between the customer and provider sets. 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 incremental techniques that maintain an optimal assignment (in the presence of updates) with a processing cost several times lower than CCA recomputation from scratch. Finally, we present approximate (i.e., suboptimal) CCA solutions that provide a tunable 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.
URI: http://hdl.handle.net/10397/29315
DOI: 10.1145/1735886.1735888
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

11
Last Week
0
Last month
0
Citations as of Oct 12, 2017

WEB OF SCIENCETM
Citations

1
Last Week
0
Last month
0
Citations as of Oct 16, 2017

Page view(s)

41
Last Week
3
Last month
Checked on Oct 16, 2017

Google ScholarTM

Check

Altmetric



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