1890 search results - page 334 / 378 » Querying Big Data by Accessing Small Data |
INFOCOM
1992
IEEE
15 years 3 months ago
1992
IEEE
The current Internet is based on a stateless (datagram) architecture. However, many recent proposals rely on the maintenance of state information within network routers, leading t...
CIKM
2009
Springer
15 years 2 months ago
2009
Springer
A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current metho...
ESORICS
2006
Springer
15 years 2 months ago
2006
Springer
Abstract. While processor based systems often enforce memory protection to prevent the unintended sharing of data between processes, current systems built around reconfigurable har...
101
click to vote
CCR
2004
14 years 10 months ago
2004
IP address lookup is challenging for high performance routers because it requires a longest matching prefix at speeds of up to 10 Gbps (OC-192). Existing solutions have poor updat...
IPPS
2010
IEEE
14 years 9 months ago
2010
IEEE
Transactional memory is an alternative programming model for managing contention in accessing shared in-memory data objects. Distributed transactional memory (TM) promises to alle...