Capacity constrained assignment in spatial databases

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2008, Pages 15-27

  Hou U, Leong ^a   Yiu, Man Lung ^b   Mouratidis, Kyriakos ^c   Mamoulis, Nikos ^a  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

^b AALBORG UNIVERSITY   (Denmark)

^c SINGAPORE MANAGEMENT UNIVERSITY   (Singapore)

Author keywords

Optimal assignment; Spatial databases

Indexed keywords

DATABASE SYSTEMS; GRAPH THEORY;

BIPARTITE GRAPHS; COMPUTATION COSTS; EFFICIENT ALGORITHMS; EUCLIDEAN DISTANCES; EXPERIMENTAL EVALUATIONS; FLOW ALGORITHMS; MAIN MEMORIES; OPTIMAL ASSIGNMENT; OPTIMAL ASSIGNMENTS; OVERALL QUALITIES; POINT SETS; PRUNING STRATEGIES; QUALITY GUARANTEES; RESULT ACCURACIES; SERVICE PROVIDERS; SPATIAL DATA SETS; SPATIAL DATABASES; SPATIAL PROPERTIES; WIFI RECEIVERS; WIRELESS ACCESS POINTS;

QUALITY OF SERVICE;

EID: 57149136904     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1376616.1376621     Document Type: Conference Paper

References (15)

1. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, first edition, 1993.
2. N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger. The R*-tree: An Efficient and Robust Access Method for Points and Rectangles. In SIGMOD, 1990.
3. T. Brinkhoff. A Framework for Generating Network-Based Moving Objects. GeoInformatica, 6(2):153-180, 2002.
4. A. Corral. Y. Manolopoulos, Y. Theodoridis, and M. Vassilakopoulos. Closest Pair Queries in Spatial Databases. In SIGMOD, 2000.
5. A. V. Goldberg and R. Kennedy. An Efficient Cost Scaling Algorithm for the Assignment Problem. Mathematical Programming, 71:153-177, 1995.
6. A. Guttman. R-Trees: A Dynamic Index Structure for Spatial Searching. In SIGMOD, 1984.
7. G. R. Hjaltason and H. Samet. Distance Browsing in Spatial Databases. ACM Trans. Database Syst., 24(2):265-318, 1999.
8. J. Munkres. Algorithms for the Assignment and Transportation Problems. Journal of the Society of Industrial and Applied Mathematics, 5(1):32-38, 1957.
9. T. K. Sellis, N. Roussopoulos, and C. Faloutsos. The R+-Tree: A Dynamic Index for Multi-Dimensional Objects. In VLDB, 1987.
10. A. Silberschatz, H. F. Korth, and S. Sudarshan. Database System Concepts. McGraw-Hill, fifth edition, 2005.
11. I. H. Toroslu and G. Üçoluk. Incremental Assignment Problem. Information Sciences, 177:1523-1529, 2007.
12. L. H. U. N. Mamoulis, and M. L. Yiu. Continuous Monitoring of Exclusive Closest Pairs. In SSTD, 2007.
13. J. Vygen. Approximation Algorithms for Facility Location Problems (Lecture Notes). University of Bonn, 2004.
14. R. C.-W. Wong, Y. Tao, A. Fu, and X. Xiao. On Efficient Spatial Matching. In VLDB, 2007.
15. M. L. Yiu and N. Mamoulis. Clustering objects on a spatial network. In SIGMOD, 2004.