Publication Type

Conference Proceeding Article

Version

Postprint

Publication Date

8-2009

Abstract

Consider an internship assignment system, where at the end of each academic year, interested university students search and apply for available positions, based on their preferences (e.g., nature of the job, salary, office location, etc). In a variety of facility, task or position assignment contexts, users have personal preferences expressed by different weights on the attributes of the searched objects. Although individual preference queries can be evaluated by selecting the object in the database with the highest aggregate score, in the case of multiple simultaneous requests, a single object cannot be assigned to more than one users. The challenge is to compute a fair 1-1 matching between the queries and the objects. We model this as a stable-marriage problem and propose an efficient method for its processing. Our algorithm iteratively finds stable query-object pairs and removes them from the problem. At its core lies a novel skyline maintenance technique, which we prove to be I/O optimal. We conduct an extensive experimental evaluation using real and synthetic data, which demonstrates that our approach outperforms adaptations of previous methods by several orders of magnitude.

Keywords

Internship assignment, multiple simultaneous requests, database management, algorithms

Discipline

Databases and Information Systems

Research Areas

Data Management and Analytics

Publication

Proceedings of the VLDB Endowment

Volume

2

Issue

1

First Page

1054

Last Page

1065

ISSN

2150-8097

Identifier

10.14778/1687627.1687746

Publisher

ACM

Creative Commons License

Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.

Additional URL

http://dx.doi.org/10.14778/1687627.1687746

Share

COinS