30 search results - page 3 / 6 » Lookup Tables: Fine-Grained Partitioning for Distributed Dat... |
WIDM
2004
ACM
15 years 2 months ago
2004
ACM
We address the problem of querying XML data over a P2P network. In P2P networks, the allowed kinds of queries are usually exact-match queries over file names. We discuss the exte...
111
click to vote
INFOCOM
2008
IEEE
15 years 4 months ago
2008
IEEE
—Continuous growth in network link rates poses a strong demand on high speed IP lookup engines. While Ternary Content Addressable Memory (TCAM) based solutions serve most of toda...
173
click to vote
SIGMOD
2008
ACM
15 years 9 months ago
2008
ACM
In the implementation of hosted business services, multiple tenants are often consolidated into the same database to reduce total cost of ownership. Common practice is to map mult...
89
Voted
ERLANG
2003
ACM
15 years 2 months ago
2003
ACM
The viability of implementing an in-memory database, Erlang ETS, using a relatively-new data structure, called a Judy array, was studied by comparing the performance of ETS tables...
165
click to vote
SIGMOD
2009
ACM
15 years 9 months ago
2009
ACM
The query models of the recent generation of very large scale distributed (VLSD) shared-nothing data storage systems, including our own PNUTS and others (e.g. BigTable, Dynamo, Ca...