Abstract
Given a set of criteria, an object o is defined to dominate another object o' if o is no worse than o' in each criterion and has better outcomes in at least a specific criterion. A skyline query returns each object that is not dominated by any other objects. Given the existing restaurants and the candidate places for opening a new restaurant in a city, where each restaurant and candidate place has its rank on a set of criteria, e.g., convenience of parking, and people who reside in the city and a distance r acceptable for people to choose a restaurant to have their meals. Moreover, assume people will choose the skyline restaurants. In this thesis, we want to find the top-k candidate places that have the most potential customers. We propose three different indexing structures, four properties, and two methods to efficiently solve this problem. Experiment results demonstrate that our approach can produce high quality outcomes.