在本論文中,我們提出了一個處理constrained skyline query的演算法。這個演算法名為GCSQP。GCSQP和過去方法不同之處在於它可以將一群constrained skyline queries群組起來,合併處理。 這樣的好處是合併處理後,GCSQP可以省下許多執行dominance test操作的時間,從而加速查詢處理的效率。在本論文中,我們提出了GCSQP的設計理念,說明了演算法的細節,並且以多個實驗證明GCSQP的確可以有效率的加速constrained skyline query的查詢處理。
In this paper, we propose a constrained skyline query processing algorithms. This algorithm is named GCSQP. Compare with preview methods, GCSQP will merge and process them afterward . The advantage is that after the merger operation, GCSQP can save a lot of time to perform dominance test operation, thereby accelerating query processing efficiently. In this paper, we propose a GCSQP design concept, explain the details of the algorithm, and perform multiple experiments to prove that GCSQP can indeed accelerate query processing efficiently on constrained skyline query.