220 search results - page 7 / 44 » The Forgiving Tree: A Self-Healing Distributed Data Structur... |
ICDE
2006
IEEE
14 years 1 months ago
2006
IEEE
Structured P2P systems based on distributed hash tables are a popular choice for building large-scaled data management systems. Generally, they only support exact match queries, b...
CLUSTER
2005
IEEE
14 years 1 months ago
2005
IEEE
Data intensive applications on clusters often require requests quickly be sent to the node managing the desired data. In many applications, one must look through a sorted tree str...
NBIS
2007
Springer
14 years 1 months ago
2007
Springer
Range queries, retrieving all keys within a given range, is an important add-on for Distributed Hash Tables (DHTs), as they rely only on exact key matching lookup. In this paper we...
EDBT
2006
ACM
14 years 7 months ago
2006
ACM
Abstract. Partial-match queries return data items that contain a subset of the query keywords and order the results based on the statistical properties of the matched keywords. The...
EDUTAINMENT
2008
Springer
13 years 9 months ago
2008
Springer
Reconstruction of a real tree from scattered scanned points is a new challenge in virtual reality. Although many progresses are made on main branch structures and overall shape of ...