535 search results - page 87 / 107 » Insertion and Expansion Operations for |
TKDE
2010
13 years 5 months ago
2010
— The data management community has recently begun to consider declarative network routing and distributed acquisition: e.g., sensor networks that execute queries about contiguou...
SPAA
2004
ACM
14 years 5 days ago
2004
ACM
We present the Buffer Heap (BH), a cache-oblivious priority queue that supports Delete-Min, Delete, and Decrease-Key operations in O( 1 B log2 N B ) amortized block transfers fro...
OSDI
2004
ACM
14 years 7 months ago
2004
ACM
We present a new technique, failure-oblivious computing, that enables servers to execute through memory errors without memory corruption. Our safe compiler for C inserts checks th...
SIGMOD
2009
ACM
14 years 1 months ago
2009
ACM
On script-generated web sites, many documents share common HTML tree structure, allowing wrappers to effectively extract information of interest. Of course, the scripts and thus ...
INFOCOM
2008
IEEE
14 years 1 months ago
2008
IEEE
—Hash tables are extensively used in networking to implement data-structures that associate a set of keys to a set of values, as they provide O(1), query, insert and delete opera...