English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We present the first fully dynamic worst case I/O-efficient data structuresthat support planar orthogonal \textit{3-sided range skyline reporting queries}in $\bigO (\log_{2B^\epsilon} n + \frac{t}{B^{1-\epsilon}})$ I/Os and updatesin $\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 resultby extending Sundar's priority queues with attrition to support the operations\textsc{DeleteMin} and \textsc{CatenateAndAttrite} in $\bigO (1)$ worst caseI/Os, and in $\bigO(1/B)$ amortized I/Os given that a constant number of blocksis already loaded in main memory. Finally, we show that any pointer-basedstatic data structure that supports \textit{dominated maxima reportingqueries}, namely the difficult special case of 4-sided skyline queries, in$\bigO(\log^{\bigO(1)}n +t)$ worst case time must occupy $\Omega(n \frac{\logn}{\log \log n})$ space, by adapting a similar lower bounding argument forplanar 4-sided range reporting queries.

I/O-Efficient Dynamic Planar Range Skyline Queries