TY  - JOUR
T1  - Evaluation of Multiple Choice Queries on the Basis of Stable-Marriage Problem
AU - Sridhar, S. AU - Padmapriya, K. 
JO  - Asian Journal of Information Technology
VL  - 13
IS  - 3
SP  - 106
EP  - 111
PY  - 2014
DA  - 2001/08/19
SN  - 1682-3915
DO  - ajit.2014.106.111
UR  - https://makhillpublications.co/view-article.php?doi=ajit.2014.106.111
KW  - query-object pair
KW  -searched objects
KW  -cost
KW  -Size
KW  -skyline
AB  - 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.
ER  -