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

Graphs are becoming one of the most popular data modeling paradigms sincethey are able to model complex relationships that cannot be easily capturedusing traditional data models. One of the major tasks of graph management isgraph matching, which aims to find all of the subgraphs in a data graph thatmatch a query graph. In the literature, proposals in this context areclassified into two different categories: graph-at-a-time, which process thewhole query graph at the same time, and vertex-at-a-time, which process asingle vertex of the query graph at the same time. In this paper, we propose anew vertex-at-a-time proposal that is based on graphlets, each of whichcomprises a vertex of a graph, all of the immediate neighbors of that vertex,and all of the edges that relate those neighbors. Furthermore, we also use theconcept of minimum hub covers, each of which comprises a subset of vertices inthe query graph that account for all of the edges in that graph. We present thealgorithms of our proposal and describe an implementation based on XQuery andRDF. Our evaluation results show that our proposal is appealing to performgraph matching.

Anatomy of Graph Matching based on an XQuery and RDF Implementation