1080 search results - page 15 / 216 » Distributed Hash Tables |
131
Voted
IEEEARES
2006
IEEE
15 years 8 months ago
2006
IEEE
Distributed hash tables (DHTs) can be used as the basis of a resilient lookup service in unstable environments: local routing tables are updated to reflected changes in the netwo...
142
Voted
ICDE
2012
IEEE
13 years 4 months ago
2012
IEEE
—The standard way to scale a distributed OLTP DBMS is to horizontally partition data across several nodes. Ideally, this results in each query/transaction being executed at just ...
107
click to vote
IPPS
2006
IEEE
15 years 8 months ago
2006
IEEE
In a network consisting of several thousands computers, the occurrence of faults is unavoidable. Being able to test the behaviour of a distributed program in an environment where ...
126
click to vote
DEBS
2010
ACM
14 years 9 months ago
2010
ACM
Many XML filtering systems have emerged in recent years identifying XML data that structurally match XPath queries in an efficient way. However, apart from structural matching, it...
122
click to vote
SODA
2008
ACM
15 years 3 months ago
2008
ACM
Ranged hash functions generalize hash tables to the setting where hash buckets may come and go over time, a typical case in distributed settings where hash buckets may correspond ...