244 search results - page 36 / 49 » Fast Set Intersection in Memory |
ISSS
2002
IEEE
14 years 20 days ago
2002
IEEE
Adding a small loop cache to a microprocessor has been shown to reduce average instruction fetch energy for various sets of embedded system applications. With the advent of core-b...
WG
1993
Springer
13 years 11 months ago
1993
Springer
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algori...
VLDB
1995
ACM
13 years 11 months ago
1995
ACM
New telecommunication services and mobility networks have introduced databases in telecommunication networks. Compared with traditional use of databases, telecom databases must fu...
RTS
2008
13 years 7 months ago
2008
Dynamic memory allocation has been used for decades. However, it has seldom been used in real-time systems since the worst case of spatial and temporal requirements for allocation ...
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
—Many popular algorithms for fast packet forwarding and filtering rely on the tree data structure. Examples are the trie-based IP lookup and packet classification algorithms. W...