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/

Zendy Plus

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

Zendy Tools

Zendy Open

Applications in various domains rely on processing graph streams, e.g.,communication logs of a cloud-troubleshooting system, road-network trafficupdates, and interactions on a social network. A labeled-graph stream refers toa sequence of streamed edges that form a labeled graph. Label-awareapplications need to filter the graph stream before performing a graphoperation. Due to the large volume and high velocity of these streams, it isoften more practical to incrementally build a lossy-compressed version of thegraph, and use this lossy version to approximately evaluate graph queries.Challenges arise when the queries are unknown in advance but are associatedwith filtering predicates based on edge labels. Surprisingly common, andespecially challenging, are labeled-graph streams that have highly skewed labeldistributions that might also vary over time. This paper introducesSelf-Balanced Graph Sketch (SBG-Sketch, for short), a graphical sketch forsummarizing and querying labeled-graph streams that can cope with all thesechallenges. SBG-Sketch maintains synopsis for both the edge attributes (e.g.,edge weight) as well as the topology of the streamed graph. SBG-Sketch allowsefficient processing of graph-traversal queries, e.g., reachability queries.Experimental results over a variety of real graph streams show SBG-Sketch toreduce the estimation errors of state-of-the-art methods by up to 99%.

SBG-Sketch: A Self-Balanced Sketch for Labeled-Graph Stream Summarization