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

In recent years studying the content of the World Wide Web became a veryimportant yet rather difficult task. There is a need for a compressiontechnique that would allow a web graph representation to be put into the memorywhile maintaining random access time competitive to the time needed to accessuncompressed web graph on a hard drive.  There are already available techniques that accomplish this task, but thereis still room for improvements and this thesis attempts to prove it. Itincludes a comparison of two methods contained in state of art of this field(BV and k2partitioned) to two already implemented algorithms (rewritten,however, in C++ programming language to maximize speed and resource managementefficiency), which are LM and 2D, and introduces the new variant of the latterone, called 2D stripes.  This thesis serves as well as a proof of concept. The final considerationsshow positive and negative aspects of all presented methods, expose thefeasibility of the new variant as well as indicate future direction fordevelopment.

Web graph compression with fast access