{"id":{"repo_id":"mtu","oai_identifier":"oai:digitalcommons.mtu.edu:etdr-3095"},"canonical_url":"https://search.ndltd.org/etd/mtu/oai:digitalcommons.mtu.edu:etdr-3095","repository":{"repo_id":"mtu","name":"Michigan Technological University","base_url":"https://digitalcommons.mtu.edu/do/oai/"},"display":{"title":"Three-Sided Skyline Counting Queries","abstract":"A two-dimensional point p=(p.x,p.y) dominates another point p'=(p'.x,p'.y) if p.x ≥ p'.x and p.y>p'.y or p.x>p'.x and p.y ≥ p'.y. The skyline of a point set P is a subset P' ⊆ P such that every point in P' is not dominated by any other point in P. An orthogonal skyline counting query Q on a set of points P asks for the number of points on the skyline of P ⋂ Q. In this work we study data structures that support orthogonal skyline counting queries in the special case when the query range is bounded on three sides. First, we describe a linear space data structure that counts the points on the skyline of a top-open three-sided query range in O(log log n) time. We also consider a variation of the skyline problem where each of the points have some category, which we call color. An orthogonal color skyline query Q on a set of points P returns the distinct color of points on the skyline of P ⋂ Q. We achieve a solution for top-open three-sided color skyline counting query that requires O(log n/ log log n) time and linear space. Additionally, we show the reduction of four-sided skyline query to a bottom-open three-sided skyline query establishing that solving the skyline problems in a bottom-open three-sided query range is as hard as solving it for a four-sided query range. In contrast, we show that top-open three-sided skyline counting queries can be solved in just O(log log n) time. This demonstrates that for orthogonal skyline queries, although the top-open and bottom-open three-sided query ranges may seem similar, their computational complexities differ significantly.","abstract_html":"A two-dimensional point p=(p.x,p.y) dominates another point p&#x27;=(p&#x27;.x,p&#x27;.y) if p.x ≥ p&#x27;.x and p.y&gt;p&#x27;.y or p.x&gt;p&#x27;.x and p.y ≥ p&#x27;.y. The skyline of a point set P is a subset P&#x27; ⊆ P such that every point in P&#x27; is not dominated by any other point in P. An orthogonal skyline counting query Q on a set of points P asks for the number of points on the skyline of P ⋂ Q. In this work we study data structures that support orthogonal skyline counting queries in the special case when the query range is bounded on three sides. First, we describe a linear space data structure that counts the points on the skyline of a top-open three-sided query range in O(log log n) time. We also consider a variation of the skyline problem where each of the points have some category, which we call color. An orthogonal color skyline query Q on a set of points P returns the distinct color of points on the skyline of P ⋂ Q. We achieve a solution for top-open three-sided color skyline counting query that requires O(log n/ log log n) time and linear space. Additionally, we show the reduction of four-sided skyline query to a bottom-open three-sided skyline query establishing that solving the skyline problems in a bottom-open three-sided query range is as hard as solving it for a four-sided query range. In contrast, we show that top-open three-sided skyline counting queries can be solved in just O(log log n) time. This demonstrates that for orthogonal skyline queries, although the top-open and bottom-open three-sided query ranges may seem similar, their computational complexities differ significantly.","abstract_has_math":false,"creators":["Kushwaha, Suruchi"],"institution":null,"degree_name":"Master of Science in Computer Science (MS)","degree_level":"Open Access Master's Thesis","degree_discipline":"Department of Computer Science","degree_department":null,"school":null,"contributors":["Yakov Nekrich"],"advisors":[],"committee_chairs":[],"committee_members":["Zhenlin Wang","Ali Ebnenasir"],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T08:19:20Z","subjects":["skyline queries","skyline counting","skyline color counting","three-sided skyline queries","range successor","three-sided skyline counting","Theory and Algorithms"],"languages":[],"rights":[],"rights_urls":["http://creativecommons.org/licenses/by/4.0/"],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["https://digitalcommons.mtu.edu/etdr/1979"],"render_values":[{"text":"https://digitalcommons.mtu.edu/etdr/1979","href":"https://digitalcommons.mtu.edu/etdr/1979","code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"https://doi.org/10.37099/mtu.dc.etdr/1979","outbound_label":"DOI","outbound_source":"dc:identifier","record_url":"https://doi.org/10.37099/mtu.dc.etdr/1979","record_label":"Repository record","record_kind":"doi","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://digitalcommons.mtu.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Adigitalcommons.mtu.edu%3Aetdr-3095","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Yakov Nekrich"]},{"key":"dc:contributor.committeemember","label":"Committee Member","values":["Zhenlin Wang","Ali Ebnenasir"]},{"key":"dc:creator","label":"Author","values":["Kushwaha, Suruchi"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.created","label":"Dc Date Created","values":["2025-01-01T08:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Department of Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Open Access Master's Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science in Computer Science (MS)"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["skyline queries","skyline counting","skyline color counting","three-sided skyline queries","range successor","three-sided skyline counting","Theory and Algorithms"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:rights.license","label":"Dc Rights License","values":["http://creativecommons.org/licenses/by/4.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["10.37099/mtu.dc.etdr/1979","https://digitalcommons.mtu.edu/etdr/1979"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["A two-dimensional point p=(p.x,p.y) dominates another point p'=(p'.x,p'.y) if p.x ≥ p'.x and p.y>p'.y or p.x>p'.x and p.y ≥ p'.y. The skyline of a point set P is a subset P' ⊆ P such that every point in P' is not dominated by any other point in P. An orthogonal skyline counting query Q on a set of points P asks for the number of points on the skyline of P ⋂ Q. In this work we study data structures that support orthogonal skyline counting queries in the special case when the query range is bounded on three sides. First, we describe a linear space data structure that counts the points on the skyline of a top-open three-sided query range in O(log log n) time. We also consider a variation of the skyline problem where each of the points have some category, which we call color. An orthogonal color skyline query Q on a set of points P returns the distinct color of points on the skyline of P ⋂ Q. We achieve a solution for top-open three-sided color skyline counting query that requires O(log n/ log log n) time and linear space. Additionally, we show the reduction of four-sided skyline query to a bottom-open three-sided skyline query establishing that solving the skyline problems in a bottom-open three-sided query range is as hard as solving it for a four-sided query range. In contrast, we show that top-open three-sided skyline counting queries can be solved in just O(log log n) time. This demonstrates that for orthogonal skyline queries, although the top-open and bottom-open three-sided query ranges may seem similar, their computational complexities differ significantly."]},{"key":"dc:title","label":"Title","values":["Three-Sided Skyline Counting Queries"]}]}],"canonical_facts":{"dc:contributor":["Yakov Nekrich"],"dc:contributor.committeemember":["Zhenlin Wang","Ali Ebnenasir"],"dc:creator":["Kushwaha, Suruchi"],"dc:date.created":["2025-01-01T08:00:00Z"],"dc:description.abstract":["A two-dimensional point p=(p.x,p.y) dominates another point p'=(p'.x,p'.y) if p.x ≥ p'.x and p.y>p'.y or p.x>p'.x and p.y ≥ p'.y. The skyline of a point set P is a subset P' ⊆ P such that every point in P' is not dominated by any other point in P. An orthogonal skyline counting query Q on a set of points P asks for the number of points on the skyline of P ⋂ Q. In this work we study data structures that support orthogonal skyline counting queries in the special case when the query range is bounded on three sides. First, we describe a linear space data structure that counts the points on the skyline of a top-open three-sided query range in O(log log n) time. We also consider a variation of the skyline problem where each of the points have some category, which we call color. An orthogonal color skyline query Q on a set of points P returns the distinct color of points on the skyline of P ⋂ Q. We achieve a solution for top-open three-sided color skyline counting query that requires O(log n/ log log n) time and linear space. Additionally, we show the reduction of four-sided skyline query to a bottom-open three-sided skyline query establishing that solving the skyline problems in a bottom-open three-sided query range is as hard as solving it for a four-sided query range. In contrast, we show that top-open three-sided skyline counting queries can be solved in just O(log log n) time. This demonstrates that for orthogonal skyline queries, although the top-open and bottom-open three-sided query ranges may seem similar, their computational complexities differ significantly."],"dc:identifier":["10.37099/mtu.dc.etdr/1979","https://digitalcommons.mtu.edu/etdr/1979"],"dc:rights.license":["http://creativecommons.org/licenses/by/4.0/"],"dc:subject":["skyline queries","skyline counting","skyline color counting","three-sided skyline queries","range successor","three-sided skyline counting","Theory and Algorithms"],"dc:title":["Three-Sided Skyline Counting Queries"],"thesis:degree_discipline":["Department of Computer Science"],"thesis:degree_level":["Open Access Master's Thesis"],"thesis:degree_name":["Master of Science in Computer Science (MS)"]},"updated_at":"2026-11-19T08:19:20Z"}