Sciweavers

220 search results - page 5 / 44
» The Forgiving Tree: A Self-Healing Distributed Data Structur...
Sort
View
SODA
2004
ACM
124views Algorithms» more  SODA 2004»
13 years 9 months ago
Family trees: an ordered dictionary with optimal congestion, locality, degree, and search time
We consider the problem of storing an ordered dictionary data structure over a distributed set of nodes. In contrast to traditional sequential data structures, distributed data st...
Kevin C. Zatloukal, Nicholas J. A. Harvey
ICDE
2007
IEEE
128views Database» more  ICDE 2007»
14 years 9 months ago
SD-Rtree: A Scalable Distributed Rtree
We propose a scalable distributed data structure (SDDS) called SD-Rtree. We intend our structure for point and window queries over possibly large spatial datasets distributed on c...
Cédric du Mouza, Philippe Rigaux, Witold Li...
TOIS
2002
97views more  TOIS 2002»
13 years 7 months ago
Burst tries: a fast, efficient data structure for string keys
Many applications depend on efficient management of large sets of distinct strings in memory. For example, during index construction for text databases a record is held for each d...
Steffen Heinz, Justin Zobel, Hugh E. Williams
GSN
2009
Springer
155views Sensor Networks» more  GSN 2009»
13 years 11 months ago
Distributed Network Configuration for Wavelet-Based Compression in Sensor Networks
En-route data compression is fundamental to reduce the power consumed for data gathering in sensor networks. Typical in-network compression schemes involve the distributed computat...
Paula Tarrío, Giuseppe Valenzise, Godwin Sh...
ICDCS
2002
IEEE
14 years 17 days ago
Key Trees and the Security of Interval Multicast
A key tree is a distributed data structure of security keys that can be used by a group of users. In this paper, we describe how any user in the group can use the different keys i...
Mohamed G. Gouda, Chin-Tser Huang, E. N. Elnozahy