Fast Algorithms for Pareto Optimal Group-based Skyline-Reference-Cited by-同舟云学术

Fast Algorithms for Pareto Optimal Group-based Skyline

Published:2017-11-06 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 2017 ACM on Conference on Information and Knowledge Management
language:
Short-container-title:

Author:

Yu Wenhui¹,Qin Zheng¹,Liu Jinfei²,Xiong Li³,Chen Xu¹,Zhang Huidi¹

Affiliation:

1. Tsinghua University, Beijing, China

2. Emory University & Georgia Institute of Technology, Atlanta, GA, USA

3. Emory University, Atlanta, GA, USA

Funder

AFOSR DDDAS

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3132847.3132950

Reference29 articles.

1. Multidimensional divide-and-conquer

2. On the Average Number of Maxima in a Set of Vectors and Applications

3. S Borzsony Donald Kossmann and Konrad Stocker. 2001. The Skyline operator. (2001) 421--430. S Borzsony Donald Kossmann and Konrad Stocker. 2001. The Skyline operator. (2001) 421--430.

Cited by 20 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Efficient Location-Based Skyline Queries With Secure R-Tree Over Encrypted Data;IEEE Transactions on Knowledge and Data Engineering;2023-10-01

2. Spatio-Textual Group Skyline Query;Database Systems for Advanced Applications. DASFAA 2023 International Workshops;2023

3. ReSKY: Efficient Subarray Skyline Computation in Array Databases;Distributed and Parallel Databases;2022-07-17

4. Efficient computation of G-Skyline groups on massive data;Information Sciences;2022-03

5. SecSkyline: Fast Privacy-Preserving Skyline Queries Over Encrypted Cloud Databases;IEEE Transactions on Knowledge and Data Engineering;2022