36 search results - page 1 / 8 » Efficient bulk insertion into a distributed ordered table |
SIGMOD
2008
ACM
14 years 5 months ago
2008
ACM
CN
2010
13 years 5 months ago
2010
Distributed hash tables (DHTs) are very efficient for querying based on key lookups. However, building huge term indexes, as required for IR-style keyword search, poses a scalabil...
ANCS
2005
ACM
13 years 11 months ago
2005
ACM
Hash tables provide efficient table implementations, achieving O(1), query, insert and delete operations at low loads. However, at moderate or high loads collisions are quite freq...
SPAA
2009
ACM
14 years 6 months ago
2009
ACM
Denial of service (DoS) attacks are arguably one of the most cumbersome problems in the Internet. This paper presents a distributed information system (over a set of completely co...
AINA
2009
IEEE
14 years 9 days ago
2009
IEEE
—This paper deals with the traditional IP address lookup problem with fast updates. We propose a B-tree data structure, called MMSPT (Multiway Most Specific Prefix Tree), which i...