{"id":{"repo_id":"mtu","oai_identifier":"oai:digitalcommons.mtu.edu:etdr-2592"},"canonical_url":"https://search.ndltd.org/etd/mtu/oai:digitalcommons.mtu.edu:etdr-2592","repository":{"repo_id":"mtu","name":"Michigan Technological University","base_url":"https://digitalcommons.mtu.edu/do/oai/"},"display":{"title":"ORTHOGONAL RANGE SKYLINE QUERIES","abstract":"Given a set of points P, we often need to report the ones that lie within a certain query range Q. This is referred to as orthogonal range reporting. We can also go further, reporting only the dominant points within that query. In 2 dimensions, a point p1 = (x1, y1) dominates a point p2 = (x2, y2) iff x1 ≥ x2 and y1 > y2 or x1 > x2 and y1 ≥ y2. The set of all dominant points within a query range is called the skyline of that query. There are several different variants of skyline queries. For example, we can consider each point in P to be colored. Given a query range Q, can we efficiently count the number of points of each color in the skyline? In this thesis, we will present a new O( log n log log n + D log log n) method for doing so. The method is possible thanks to a new reduction from skyline queries to orthogonal range queries. We will also explore novel algorithms for answering skyline query variants in the I/O model of computation, making use of techniques such as Ganguly et al.’s [2] double-chaining method and Alstrup et al.’s [14] grid approach. By applying these existing techniques in new ways, we can not only derive our own efficient algorithms for skyline queries, but also explore potential avenues for future research","abstract_html":"Given a set of points P, we often need to report the ones that lie within a certain query range Q. This is referred to as orthogonal range reporting. We can also go further, reporting only the dominant points within that query. In 2 dimensions, a point p1 = (x1, y1) dominates a point p2 = (x2, y2) iff x1 ≥ x2 and y1 &gt; y2 or x1 &gt; x2 and y1 ≥ y2. The set of all dominant points within a query range is called the skyline of that query. There are several different variants of skyline queries. For example, we can consider each point in P to be colored. Given a query range Q, can we efficiently count the number of points of each color in the skyline? In this thesis, we will present a new O( log n log log n + D log log n) method for doing so. The method is possible thanks to a new reduction from skyline queries to orthogonal range queries. We will also explore novel algorithms for answering skyline query variants in the I/O model of computation, making use of techniques such as Ganguly et al.’s [2] double-chaining method and Alstrup et al.’s [14] grid approach. By applying these existing techniques in new ways, we can not only derive our own efficient algorithms for skyline queries, but also explore potential avenues for future research","abstract_has_math":false,"creators":["Murembya, Saano"],"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:18:46Z","subjects":[],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["https://digitalcommons.mtu.edu/etdr/1536"],"render_values":[{"text":"https://digitalcommons.mtu.edu/etdr/1536","href":"https://digitalcommons.mtu.edu/etdr/1536","code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"https://doi.org/10.37099/mtu.dc.etdr/1536","outbound_label":"DOI","outbound_source":"dc:identifier","record_url":"https://doi.org/10.37099/mtu.dc.etdr/1536","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-2592","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":["Murembya, Saano"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.created","label":"Dc Date Created","values":["2022-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":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["10.37099/mtu.dc.etdr/1536","https://digitalcommons.mtu.edu/etdr/1536"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Given a set of points P, we often need to report the ones that lie within a certain query range Q. This is referred to as orthogonal range reporting. We can also go further, reporting only the dominant points within that query. In 2 dimensions, a point p1 = (x1, y1) dominates a point p2 = (x2, y2) iff x1 ≥ x2 and y1 > y2 or x1 > x2 and y1 ≥ y2. The set of all dominant points within a query range is called the skyline of that query. There are several different variants of skyline queries. For example, we can consider each point in P to be colored. Given a query range Q, can we efficiently count the number of points of each color in the skyline? In this thesis, we will present a new O( log n log log n + D log log n) method for doing so. The method is possible thanks to a new reduction from skyline queries to orthogonal range queries. We will also explore novel algorithms for answering skyline query variants in the I/O model of computation, making use of techniques such as Ganguly et al.’s [2] double-chaining method and Alstrup et al.’s [14] grid approach. By applying these existing techniques in new ways, we can not only derive our own efficient algorithms for skyline queries, but also explore potential avenues for future research"]},{"key":"dc:title","label":"Title","values":["ORTHOGONAL RANGE SKYLINE QUERIES"]}]}],"canonical_facts":{"dc:contributor":["Yakov Nekrich"],"dc:contributor.committeemember":["Zhenlin Wang","Ali Ebnenasir"],"dc:creator":["Murembya, Saano"],"dc:date.created":["2022-01-01T08:00:00Z"],"dc:description.abstract":["Given a set of points P, we often need to report the ones that lie within a certain query range Q. This is referred to as orthogonal range reporting. We can also go further, reporting only the dominant points within that query. In 2 dimensions, a point p1 = (x1, y1) dominates a point p2 = (x2, y2) iff x1 ≥ x2 and y1 > y2 or x1 > x2 and y1 ≥ y2. The set of all dominant points within a query range is called the skyline of that query. There are several different variants of skyline queries. For example, we can consider each point in P to be colored. Given a query range Q, can we efficiently count the number of points of each color in the skyline? In this thesis, we will present a new O( log n log log n + D log log n) method for doing so. The method is possible thanks to a new reduction from skyline queries to orthogonal range queries. We will also explore novel algorithms for answering skyline query variants in the I/O model of computation, making use of techniques such as Ganguly et al.’s [2] double-chaining method and Alstrup et al.’s [14] grid approach. By applying these existing techniques in new ways, we can not only derive our own efficient algorithms for skyline queries, but also explore potential avenues for future research"],"dc:identifier":["10.37099/mtu.dc.etdr/1536","https://digitalcommons.mtu.edu/etdr/1536"],"dc:title":["ORTHOGONAL RANGE SKYLINE 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:18:46Z"}