Sciweavers

Share
ICC
2007
IEEE

Skip Tree Graph: a Distributed and Balanced Search Tree for Peer-to-Peer Networks

12 years 2 months ago
Skip Tree Graph: a Distributed and Balanced Search Tree for Peer-to-Peer Networks
Abstract—Skip Tree Graph is a novel, distributed, data structure for peer-to-peer systems that supports exact-match and order-based queries such as range queries efficiently. It is based on skip trees, which are randomised balanced search trees equivalent to skip lists and designed to provide improved concurrency. Skip tree graphs constitute an extension of skip graphs enhancing their performance in both, exact-match and range queries. Moreover, skip tree graph maintains the underlying balanced tree structures using randomisation and local operations, which provides a greater degree of concurrency and scalability.
Alejandra González Beltrán, Paul Sag
Added 02 Jun 2010
Updated 02 Jun 2010
Type Conference
Year 2007
Where ICC
Authors Alejandra González Beltrán, Paul Sage, Peter Milligan
Comments (0)
books