Book Chapter10.1007/978-3-540-30577-4_30
RAQ: a range-queriable distributed data structure
Hamid Nazerzadeh,Mohammad Ghodsi +1 more
- 22 Jan 2005
- pp 269-277
TL;DR: It is shown that the look-up query for a specified key can be done via O(log n) message passing, and RAQ handles range-queries in at most O( log n) communication steps.
read more
Abstract: Different structures are used in peer-to-peer networks to represent their inherently distributed, self-organized, and decentralized memory structure. In this paper, a simple range-queriable distributed data structure, called RAQ, is proposed to efficiently support exact match and range queries over multi-dimensional data. In RAQ, the key space is partitioned among the network with n nodes, in which each element has links to O(log n) other elements. We will show that the look-up query for a specified key can be done via O(log n) message passing. Also, RAQ handles range-queries in at most O(log n) communication steps.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Authenticated and persistent skip graph: a data structure for cloud based data-centric applications
T.P. Shabeera,Priya Chandran,S. D. Madhu Kumar +2 more
- 03 Aug 2012
TL;DR: An authenticated and persistent skip graph is presented, an enhanced variant of the existing skip graph, based on an event based model, to correspond to the distributed data centric application requirements.
19
Skiptree: A new scalable distributed data structure on multidimensional data supporting range-queries
TL;DR: Modifications to the structures are proposed, so that the memory usage for maintaining the link structure at each node is reduced from the worst case of O(n) to O(lognloglogn) on the average and O(log^2n) in the best case.
12
Semantic partitioning of peer-to-peer search space
TL;DR: This paper partitions network search space using a consistent static shared upper ontology using a semantic partition tree (SPT) and introduces a lookup service for the network which is very scalable and independent of the network size and just depends on depth of the ontology tree.
8
SkipTree: a scalable range-queryable distributed data structure for multidimensional data
Saeed Alaei,Mohammad Toossi,Mohammad Ghodsi +2 more
- 19 Dec 2005
TL;DR: The SkipTree is a new balanced, distributed data structure for storing data with multidimensional keys in a peer-to-peer network and is fully decentralized with each node being connected to O(log n) other nodes.
RAQNet: A Topology-Aware Overlay Network
Seyed Iman Mirrezaei,Javad Shahparian,Mohammad Ghodsi +2 more
- 21 Jun 2007
TL;DR: A multi-dimensional overlay network called RAQNet which is based on RAQ, which has improved its original routing algorithms and extended it to have topology awareness property and presents the experimental results through a prototype implementation of two emulated networks.
References
Chord: A scalable peer-to-peer lookup service for internet applications
Ion Stoica,Robert Morris,David R. Karger,M. Frans Kaashoek,Hari Balakrishnan +4 more
- 27 Aug 2001
TL;DR: Results from theoretical analysis, simulations, and experiments show that Chord is scalable, with communication cost and the state maintained by each node scaling logarithmically with the number of Chord nodes.
11.2K
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Antony Rowstron,Peter Druschel +1 more
TL;DR: Pastry as mentioned in this paper is a scalable, distributed object location and routing substrate for wide-area peer-to-peer ap- plications, which performs application-level routing and object location in a po- tentially very large overlay network of nodes connected via the Internet.
A scalable content-addressable network
Sylvia Ratnasamy,Paul Francis,Mark Handley,Richard M. Karp,Scott Shenker +4 more
- 27 Aug 2001
TL;DR: The concept of a Content-Addressable Network (CAN) as a distributed infrastructure that provides hash table-like functionality on Internet-like scales is introduced and its scalability, robustness and low-latency properties are demonstrated through simulation.
7.2K
The small-world phenomenon: an algorithmic perspective
Jon Kleinberg
- 01 May 2000
TL;DR: A method of improving certain characteristics of cadmium mercury telluride single crystal material by heat treating thesingle crystal material in the presence of both tellurium and mercury.
Viceroy: a scalable and dynamic emulation of the butterfly
Dahlia Malkhi,Moni Naor,David Ratajczak +2 more
- 21 Jul 2002
TL;DR: The construction derives from recent advances in the study of peer-to-peer lookup networks, where rapid changes require efficient and distributed maintenance, and where the lookup efficiency is impacted both by the lengths of paths to requested data and the presence or elimination of bottlenecks in the network.