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

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 monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

Reverse k-nearest neighbor (RkNN) queries on road network distances require long processing times because most conventional algorithms require a k-nearest neighbor (kNN) search on every visited node. This causes a large number of node expansions; therefore, the processing time is drastically increased when data points are sparsely distributed. In this paper, we propose a fast RkNN search algorithm that runs using a simple materialized path view (SMPV). In addition, we adopt an incremental Euclidean restriction strategy for fast kNN queries, the main function in RkNN queries. The SMPV used in our proposed algorithm only constructs an individual partitioned subgraph; therefore, the amount of data is drastically reduced compared to conventional materialized path views (MPVs). According to our experimental results using real road network data, our proposed method achieved a processing time that was 100 times faster than conventional approaches when data points are sparsely distributed on a road network.

R<i>k</i>NN Query on Road Network Distances