We present the first static and dynamic external memory data structures for variants of 2-d orthogonal range skyline reporting with worst-case logarithmic query and update I/O-complexity. The results are obtained by using persistent data structures and by extending the attrition priorities queues of Sundar (1989) [26] to also support real-time concatenation, a result of independent interest. We show that the problem is as hard as standard 2-d orthogonal range reporting in the indexability model by a lower bound on the I/O-complexity of 2-d orthogonal anti-dominance skyline reporting queries.

中文翻译：

---

I / O有效的二维正交范围天际线和损耗优先级队列

我们介绍了最差情况对数查询和更新I / O复杂度的二维正交范围天际线报告的变体的第一个静态和动态外部存储器数据结构。通过使用持久性数据结构并扩展Sundar（1989）[26]的损耗优先级队列来支持独立的结果，即实时级联，可以获得结果。我们通过2-d正交反优势天际线报告查询的I / O复杂度的下限，显示了与可索引性模型中的标准2-d正交范围报告一样困难的问题。