11 search results - page 2 / 3 » HEXA: Compact Data Structures for Faster Packet Processing |
CLUSTER
2005
IEEE
13 years 10 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...
CAV
2010
Springer
13 years 8 months ago
2010
Springer
For efficiency and portability, network packet processing code is typically written in low-level languages and makes use of bit-level operations to compactly represent data. Althou...
SIGCOMM
2005
ACM
13 years 10 months ago
2005
ACM
Hash table is used as one of the fundamental modules in several network processing algorithms and applications such as route lookup, packet classification, per-flow state manage...
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...
TVCG
2010
12 years 11 months ago
2010
Efficient multiresolution representations for isosurfaces and interval volumes are becoming increasingly important as the gap between volume data sizes and processing speed continu...