Loading...

RAQ: A range-queriable distributed data structure

Nazerzadeh, H ; Sharif University of Technology | 2005

144 Viewed
  1. Type of Document: Article
  2. DOI: 10.1007/978-3-540-30577-4_30
  3. Publisher: Springer Verlag , 2005
  4. Abstract:
  5. 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(logn) communication steps. © Springer-Verlag Berlin Heidelberg 2005
  6. Keywords:
  7. Data transfer ; Self organizing storage ; Storage allocation (computer) ; Decentralized memory structures ; Peer-to-peer networks ; Range-querable distributed data structures ; RAQ ; Query languages
  8. Source: 31st Conference on Current Trends in Theory and Practice of Computer Science, Liptovsky Jan, 22 January 2005 through 28 January 2005 ; Volume 3381 , 2005 , Pages 269-277 ; 03029743 (ISSN)
  9. URL: https://link.springer.com/chapter/10.1007/978-3-540-30577-4_30