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 Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

In top- k  ranked retrieval the goal is to efficiently compute an ordered list of the highest scoring  k  documents according to some stipulated similarity function such as the well-known BM25 approach. In most implementation techniques a min-heap of size  k  is used to track the top scoring candidates. In this work we consider the question of how best to retrieve the  second  page of search results, given that a first page has already been computed; that is, identification of the documents at ranks    $$k+1$$  k + 1 to 2 k  for some query. Our goal is to understand what information is available as a by-product of the first-page scoring, and how it can be employed to accelerate the second-page computation, assuming that the second-page of results is required for only a fraction of the query load. We propose a range of simple, yet efficient, next-page retrieval techniques which are suitable for accelerating Document-at-a-Time mechanisms, and demonstrate their performance on three large text collections.

Efficient query processing techniques for next-page retrieval