{"paper":{"title":"I/O-Efficient Dynamic Planar Range Skyline Queries","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Casper Kejlberg-Rasmussen, Konstantinos Tsakalidis, Kostas Tsichlas","submitted_at":"2012-07-10T13:32:12Z","abstract_excerpt":"We present the first fully dynamic worst case I/O-efficient data structures that support planar orthogonal \\textit{3-sided range skyline reporting queries} in $\\bigO (\\log_{2B^\\epsilon} n + \\frac{t}{B^{1-\\epsilon}})$ I/Os and updates in $\\bigO (\\log_{2B^\\epsilon} n)$ I/Os, using $\\bigO (\\frac{n}{B^{1-\\epsilon}})$ blocks of space, for $n$ input planar points, $t$ reported points, and parameter $0 \\leq \\epsilon \\leq 1$. We obtain the result by extending Sundar's priority queues with attrition to support the operations \\textsc{DeleteMin} and \\textsc{CatenateAndAttrite} in $\\bigO (1)$ worst case I"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.2341","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}