article

Faster output-sensitive skyline computation algorithm

Authors:

Jinfei Liu,

Li Xiong,

Xiaofeng XuAuthors Info & Claims

Information Processing Letters, Volume 114, Issue 12

Pages 710 - 713

https://doi.org/10.1016/j.ipl.2014.06.014

Published: 01 December 2014 Publication History

Abstract

We present the second output-sensitive skyline computation algorithm which is faster than the only existing output-sensitive skyline computation algorithm [1] in worst case because our algorithm does not rely on the existence of a linear time procedure for finding medians.

References

[1]

Kirkpatrick, D.G. and Seidel, R., Output-size sensitive algorithms for finding maximal vectors. In: Symposium on Computational Geometry, pp. 89-96.

Crossref

Google Scholar

[2]

Bentley, J.L., Multidimensional divide-and-conquer. Commun. ACM. v23 i4. 214-229.

Crossref

Google Scholar

[3]

Bentley, J.L., Clarkson, K.L. and Levine, D.B., Fast linear expected-time algorithms for computing maxima and convex hulls. In: SODA, pp. 179-187.

Crossref

Google Scholar

[4]

Bentley, J.L., Kung, H.T., Schkolnick, M. and Thompson, C.D., On the average number of maxima in a set of vectors and applications. J. ACM. v25 i4. 536-543.

Crossref

Google Scholar

[5]

Kung, H.T., Luccio, F. and Preparata, F.P., On finding the maxima of a set of vectors. J. ACM. v22 i4. 469-476.

Crossref

Google Scholar

[6]

Hu, X., Sheng, C., Tao, Y., Yang, Y. and Zhou, S., Output-sensitive skyline algorithms in external memory. In: SODA, pp. 887-900.

Crossref

Google Scholar

[7]

Blum, M., Floyd, R.W., Pratt, V.R., Rivest, R.L. and Tarjan, R.E., Time bounds for selection. J. Comput. Syst. Sci. v7 i4. 448-461.

Crossref

Google Scholar

[8]

Chan, T.M. and Lee, P., On constant factors in comparison-based geometric algorithms and data structures. In: Symposium on Computational Geometry, pp. 40

Crossref

Google Scholar

[9]

Luccio, F. and Preparata, F., On finding the maxima of a set of vectors. 1973.

Google Scholar

[10]

Chan, T.M., Optimal output-sensitive convex hull algorithms in two and three dimensions. Discrete Comput. Geom. v16 i4. 361-368.

Google Scholar

Cited By

View all

Liu JYang JXiong LPei JLuo JGuo YMa SFan C(2021)Skyline Diagram: Efficient Space Partitioning for Skyline QueriesIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2019.292391433:1(271-286)Online publication date: 1-Jan-2021
https://dl.acm.org/doi/10.1109/TKDE.2019.2923914
Yu WQin ZLiu JXiong LChen XZhang HLim EWinslett MSanderson MFu ASun JCulpepper SLo EHo JDonato DAgrawal RZheng YCastillo CSun ATseng VLi C(2017)Fast Algorithms for Pareto Optimal Group-based SkylineProceedings of the 2017 ACM on Conference on Information and Knowledge Management10.1145/3132847.3132950(417-426)Online publication date: 6-Nov-2017
https://dl.acm.org/doi/10.1145/3132847.3132950
Zhang HZhang QLim EWinslett MSanderson MFu ASun JCulpepper SLo EHo JDonato DAgrawal RZheng YCastillo CSun ATseng VLi C(2017)Communication-Efficient Distributed Skyline ComputationProceedings of the 2017 ACM on Conference on Information and Knowledge Management10.1145/3132847.3132927(437-446)Online publication date: 6-Nov-2017
https://dl.acm.org/doi/10.1145/3132847.3132927
Show More Cited By

Faster output-sensitive skyline computation algorithm
1. Theory of computation

Recommendations

More output-sensitive geometric algorithms
SFCS '94: Proceedings of the 35th Annual Symposium on Foundations of Computer Science

A simple idea for speeding up the computation of extrema of a partially ordered set turns out to have a number of interesting applications in geometric algorithms; the resulting algorithms generally replace an appearance of the input size n in the ...
Super-linear time-space tradeoff lower bounds for randomized computation
FOCS '00: Proceedings of the 41st Annual Symposium on Foundations of Computer Science

We prove the first time-space lower bound tradeoffs for randomized computation of decision problems. The bounds hold even in the case that the computation is allowed to have arbitrary probability of error on a small fraction of inputs. Our techniques ...
Output-sensitive skyline algorithms in external memory
SODA '13: Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms

This paper presents new results in external memory for finding the skyline (a.k.a. maxima) of N points in d-dimensional space. The state of the art uses O((N/B) log^d−2_M/B(N/B)) I/Os for fixed d ≥ 3, and O((N/B) log_M/B(N/B)) I/Os for d = 2, where M and B ...

Comments

Information & Contributors

Information

Published In

Information Processing Letters Volume 114, Issue 12

December, 2014

86 pages

ISSN:0020-0190

Issue’s Table of Contents

Publisher

Elsevier North-Holland, Inc.

United States

Publication History

Published: 01 December 2014

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 09 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Liu JYang JXiong LPei JLuo JGuo YMa SFan C(2021)Skyline Diagram: Efficient Space Partitioning for Skyline QueriesIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2019.292391433:1(271-286)Online publication date: 1-Jan-2021
https://dl.acm.org/doi/10.1109/TKDE.2019.2923914
Yu WQin ZLiu JXiong LChen XZhang HLim EWinslett MSanderson MFu ASun JCulpepper SLo EHo JDonato DAgrawal RZheng YCastillo CSun ATseng VLi C(2017)Fast Algorithms for Pareto Optimal Group-based SkylineProceedings of the 2017 ACM on Conference on Information and Knowledge Management10.1145/3132847.3132950(417-426)Online publication date: 6-Nov-2017
https://dl.acm.org/doi/10.1145/3132847.3132950
Zhang HZhang QLim EWinslett MSanderson MFu ASun JCulpepper SLo EHo JDonato DAgrawal RZheng YCastillo CSun ATseng VLi C(2017)Communication-Efficient Distributed Skyline ComputationProceedings of the 2017 ACM on Conference on Information and Knowledge Management10.1145/3132847.3132927(437-446)Online publication date: 6-Nov-2017
https://dl.acm.org/doi/10.1145/3132847.3132927
Liu JXiong LPei JLuo JZhang H(2015)Finding Pareto optimal groupsProceedings of the VLDB Endowment10.14778/2831360.28313638:13(2086-2097)Online publication date: 1-Sep-2015
https://dl.acm.org/doi/10.14778/2831360.2831363
Liu JZhang HXiong LLi HLuo JBailey JMoffat AAggarwal Cde Rijke MKumar RMurdock VSellis TYu J(2015)Finding Probabilistic k-Skyline Sets on Uncertain DataProceedings of the 24th ACM International on Conference on Information and Knowledge Management10.1145/2806416.2806452(1511-1520)Online publication date: 17-Oct-2015
https://dl.acm.org/doi/10.1145/2806416.2806452

Abstract

References

Cited By

Recommendations

More output-sensitive geometric algorithms

Super-linear time-space tradeoff lower bounds for randomized computation

Output-sensitive skyline algorithms in external memory

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations