Document Type
Conference Proceeding
Publication Date
6-8-2026
Department
Department of Computer Science
Abstract
In the orthogonal skyline range counting (resp. reporting) problem we store the set of points P in a data structure so that for any query range Q the number of points (resp. the list of all points) on the skyline of Q∩P can be found efficiently. In this paper we study two-dimensional range counting and reporting problems in the case when the query range is bounded on three sides. We describe a linear-space data structure that answers top-open three-sided skyline counting queries in O(log log N) time, where N is the number of points stored in the data structure. We also show that bottom-open three-sided skyline counting queries are as difficult as general four-sided queries and any data structure that uses O(N logc N) space for a constant c requires Ω(log N/log log N) time to answer such queries. Next, we turn to skyline color range queries. In this variant of the problem each point in P is assigned a color and we must count (resp. report) the distinct colors of point on the skyline of Q∩P. We describe an O(N)-space data structure that answers top-open three-sided color counting queries in O(log N/log log N) time. Finally, we study top-open three-sided skyline color reporting in the EM model and describe a data structure that uses linear space and answers queries in O(Bk + 1) I/Os where k is the number of colors on the skyline. This is the first external-memory data structure with optimal query cost and space usage for this problem.
Publication Title
Leibniz International Proceedings in Informatics Lipics
ISBN
[9783959774215]
Recommended Citation
Kushwaha, S.,
&
Nekrich, Y.
(2026).
New Results on Three-Sided Skyline Range Counting and Reporting.
Leibniz International Proceedings in Informatics Lipics,
370.
http://doi.org/10.4230/LIPIcs.SWAT.2026.27
Retrieved from: https://digitalcommons.mtu.edu/michigantech-p2/2743
Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.
Version
Publisher's PDF
Publisher's Statement
© Suruchi Kushwaha and Yakov Nekrich. Publisher’s version of record: 10.4230/LIPIcs.SWAT.2026.27