Space Filling Approach for Distributed Processing of Top-k Dominating Queries

作者：Amagata Daichi^*; Hara Takahiro; Onizuka Makoto

来源：IEEE Transactions on Knowledge and Data Engineering, 2018, 30(6): 1150-1163.

DOI：10.1109/TKDE.2018.2790387

• Top-k dominating queries
• distributed environments

A top-k dominating query returns k data objects that dominate the highest number of data objects in a given dataset. This query provides us with a set of intuitively preferred data, thus can support a wide variety of multi-criteria decision-making applications, e.g., e-commerce and web search. Due to the growth of data centers and cloud computing infrastructures, the above applications are increasingly being operated in distributed environments. These motivate us to address the problem of distributed top-k dominating query processing. We propose an efficient decentralized algorithm that exploits virtual points and returns the exact answer. The virtual points are utilized to focus on the data space to be preferentially searched and also to limit the search space to prune unnecessary computation and data forwarding. We also propose two other algorithms, which return an approximate answer set while further reducing query processing time. Extensive experiments on both real and synthetic data demonstrate the efficiency and scalability of our algorithms.

• 出版日期2018-6-1