Abstract: Consider multiple users searching for an apartment, based on size, cost, distance from the airport, etc. Users may have different choices on the attributes of the searched objects. Even though every option queries can be evaluated by selecting the object in the database with highest score, in the case of multiple requests at the same time, multiple objects can be assigned to multiple users. We have to identify a suitable one to one matching between the queries and a subset of the objects. The proposed algorithm finds the query-object pair satisfying maximum options and removes it from the problem by performing several iterations. It can be achieved by maintaining and matching the skyline of the remaining objects with the remaining queries at each iteration. The effectiveness of the proposed solution is verified through extensive experiments.
K. Padmapriya and S. Sridhar, 2014. Evaluation of Multiple Choice Queries on the Basis of Stable-Marriage Problem. Asian Journal of Information Technology, 13: 106-111.