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

Tainan, Taiwan This paper develops a periodic data reorganization algorithm for the B ‘ink-tree data structure in concurrent environments, and identifies conditions under which the data reorganization should be performed in order to minimize the response time per access operation. Index Terms B*-trees, B”“k-tress, performance analysis, database, concurrent maintenance, periodic maintenance. algorithm analysis, deadlocks.

Performance analysis of a periodic data reorganization algorithm for concurrent Blink-trees in database systems

Performance analysis of a periodic data reorganization algorithm for concurrent B^link-trees in database systems