33 search results - page 6 / 7 » Fast and Compact Hash Tables for Integer Keys |
ALGORITHMICA
1998
13 years 5 months ago
1998
Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
SIGMOD
2009
ACM
14 years 5 months ago
2009
ACM
Column-oriented database systems [19, 23] perform better than traditional row-oriented database systems on analytical workloads such as those found in decision support and busines...
CN
2004
13 years 5 months ago
2004
In this paper, we introduce a new IP lookup scheme with worst-case search and update time of O(log n), where n is the number of prefixes in the forwarding table. Our scheme is base...
SIAMCOMP
2002
13 years 5 months ago
2002
We consider the problem of maintaining aggregates and statistics over data streams, with respect to the last N data elements seen so far. We refer to this model as the sliding wind...
SCN
2008
Springer
13 years 5 months ago
2008
Springer
Abstract-- Despite the rapid advance in networking technologies, detection of network anomalies at high-speed switches/routers is still far from maturity. To push the frontier, two...