Live briefing
Everything about Skip graph
Kind of distributed data structure
Skip graphs are a kind of distributed data structure based on skip lists. They were invented in 2003 by James Aspnes and Gauri Shah. A nearly identical data structure called SkipNet was independently invented by Nicholas Harvey, Michael Jones, Stefan Saroiu, Marvin Theimer and Alec Wolman, also in 2003. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Skip graphA 5-minute orientation
- Skim a recent paper: Contrastive Graph Convolution Network With Skip Connections for Few-Shot Hyperspectral Image ClassificationInfluential work since 2022
- Pick up a classic book: Data structures and algorithms in JavaThe most-reprinted book on the subject
- Read the landmark paper: Skip graphsCited 270 times
- Go sideways: Skip listA closely related topic
- Go sideways: X-fast trieA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Skip graphs
SkipGNN: predicting molecular interactions with skip-graph networks
Tiara: A self-stabilizing deterministic skip list and skip graph
Graph Neural Network-Based Speech Emotion Recognition: A Fusion of Skip Graph Convolutional Networks and Graph Attention Networks
Interlaced: Fully decentralized churn stabilization for Skip Graph-based DHTs
Improved Skip-Gram Based on Graph Structure Information
Semantic Fusion Enhanced Event Detection via Multi-Graph Attention Network with Skip Connection
Double-Branch Multilevel Skip Sparse Graph Attention Network for Hyperspectral Image Classification
🆕 Influential since 2022
Contrastive Graph Convolution Network With Skip Connections for Few-Shot Hyperspectral Image Classification
Time-varying graph representation learning via higher-order skip-gram with negative sampling
Model-Based Gait Recognition Using Multi-Level Graph Neural Networks With Stochastic Process and Skip Connections
Spectrum-Constrained and Skip-Enhanced Graph Fraud Detection: Addressing Heterophily in Fraud Detection with Spectral and Spatial Modeling
Skip Polysomnography Before Adenotonsillectomy for Snoring?
📚 Books worth reading
Data structures and algorithms in JavaMichael T. Goodrich, Roberto Tamassia · 2001
Data structures and algorithm analysis in CMark Allen Weiss · 1993
How to conduct surveysArlene Fink · 1985
Data structures & algorithm analysis in JavaMark Allen Weiss · 1999
Introduction to information retrievalChristopher D. Manning, Prabhakar Raghavan · 2008
Data structures and algorithms in JavaAdam Drozdek · 2001
Fundamentals of data structures in CEllis Horowitz · 1993
Algorithm designMichael T. Goodrich, Roberto Tamassia · 2001
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Skip list In computer science, a skip list (or skiplist) is a probabilistic data structure that allows 𝒪(logn) average complexity for search as well as 𝒪(logn)…
- X-fast trie In computer science, an x-fast trie is a data structure for storing integers from a bounded domain. It supports exact and predecessor or successor queries…
- Priority queue In computer science, a priority queue is an abstract data type similar to a regular queue where each element has an associated priority determining its…
- Koorde In peer-to-peer networks, Koorde is a distributed hash table (DHT) system based on the Chord DHT and the De Bruijn graph (De Bruijn sequence). Inheriting…
- Distributed hash table A distributed hash table (DHT) is a distributed system that provides a lookup service similar to a hash table. Key–value pairs are stored in a DHT, and…
- Self-balancing binary search tree In computer science, a self-balancing binary search tree (BST) is any node-based binary search tree that automatically keeps its height (maximal number…
- External memory graph traversal External memory graph traversal is a type of graph traversal optimized for accessing externally stored memory. Graph traversal is a subroutine in most…
- Persistent data structure In computing, a persistent data structure or not ephemeral data structure is a data structure that always preserves the previous version of itself when…