考慮支配關係之空間上的top-k查詢

給定一組在每個領域都有參數的物件，如果在每個維度裡面物件a沒有比物件b更壞，那我們說一個物件b被另一個物件a支配，，並在至少在一個維度有比他更好。天際線查詢回傳那些沒有被其他物件支配的物件。在一個城市裡面給定一些現有餐廳和候選預定地來開設新餐廳，那裡每家餐館和候選地方都有它在不同領域的表現分數，例如，便利的停車位。人民居住在城市裡有個可接受的距離r來選擇一家餐館用餐。此外，假設人們會去選擇這些表現較好的天際線餐廳。在這篇論文中，我們要找到擁有最多潛在的客戶的top-k候選地。我們提出了三種不同的索引結構，四個性質，並且提出兩種方法能夠有效地解決這個問題。實驗結果表明，我們的方法可以生產出高品質的成果。

關鍵字

支配；查詢

並列摘要

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.

並列關鍵字

無資料

參考文獻

[Gargantini82] Gargantini, I.:An effective way to represent quadtrees, In: Proceedings of Communications of the ACM, vol. 25, no. 12, pp. 905, (1982)

International Conference on Data Engineering, ICDE 2001, Heidelberg, Germany, pp. 421, (2001)

[TEO01]Tan, K.L., Eng, P.K., Ooi, B.C.: Efficient progressive skyline computation. In: Proceedings

the 19th International Conference on Data Engineering, ICDE 2003, Bangalore, India, pp.717, (2003)

[GSG05] Godfrey, P., Shipley, R., Gryz, J.: Maximal vector computation in large data sets. In:

國際替代計量

考慮支配關係之空間上的top-k查詢

全文下載

主題瀏覽