Sciweavers

648 search results - page 86 / 130
» Authenticated hash tables
Sort
View
IJNSEC
2008
95views more  IJNSEC 2008»
13 years 7 months ago
SurePath: An Approach to Resilient Anonymous Routing
Current anonymous systems either use a small, fixed core set of mixes or randomly choose a sequence of peer nodes to form anonymous paths/tunnels. The resulting paths are fragile ...
Yingwu Zhu, Yiming Hu
PVLDB
2008
71views more  PVLDB 2008»
13 years 7 months ago
Read-optimized databases, in depth
Recently, a number of papers have been published showing the benefits of column stores over row stores. However, the research comparing the two in an "apples-to-apples" ...
Allison L. Holloway, David J. DeWitt
SEMWEB
2010
Springer
13 years 5 months ago
SPARQL Query Optimization on Top of DHTs
We study the problem of SPARQL query optimization on top of distributed hash tables. Existing works on SPARQL query processing in such environments have never been implemented in a...
Zoi Kaoudi, Kostis Kyzirakos, Manolis Koubarakis
EDBT
2009
ACM
127views Database» more  EDBT 2009»
14 years 2 months ago
Approximate substring selectivity estimation
We study the problem of estimating selectivity of approximate substring queries. Its importance in databases is ever increasing as more and more data are input by users and are in...
Hongrae Lee, Raymond T. Ng, Kyuseok Shim
INFOCOM
2006
IEEE
14 years 1 months ago
Improving Lookup Performance Over a Widely-Deployed DHT
— During recent years, Distributed Hash Tables (DHTs) have been extensively studied by the networking community through simulation and analysis, but until recently were not adopt...
Daniel Stutzbach, Reza Rejaie