Sciweavers

73 search results - page 6 / 15
» Perfect Hashing for Data Management Applications
Sort
View
TOIS
2002
97views more  TOIS 2002»
14 years 9 months ago
Burst tries: a fast, efficient data structure for string keys
Many applications depend on efficient management of large sets of distinct strings in memory. For example, during index construction for text databases a record is held for each d...
Steffen Heinz, Justin Zobel, Hugh E. Williams
ARCS
2004
Springer
15 years 3 months ago
Cryptonite - A Programmable Crypto Processor Architecture for High-Bandwidth Applications
Cryptographic methods are widely used within networking and digital rights management. Numerous algorithms exist, e.g. spanning VPNs or distributing sensitive data over a shared ne...
Rainer Buchty, Nevin Heintze, Dino Oliva
SAC
2006
ACM
15 years 3 months ago
BambooTrust: practical scalable trust management for global public computing
Global public computing platforms, such as PlanetLab, grid computing systems, and XenoServers, require facilities for managing trust to allow their participants to interact effect...
Evangelos Kotsovinos, Aled Williams
KDD
2008
ACM
140views Data Mining» more  KDD 2008»
15 years 10 months ago
Semi-supervised approach to rapid and reliable labeling of large data sets
Supervised classification methods have been shown to be very effective for a large number of applications. They require a training data set whose instances are labeled to indicate...
György J. Simon, Vipin Kumar, Zhi-Li Zhang
ICDE
2008
IEEE
118views Database» more  ICDE 2008»
15 years 11 months ago
XML processing in DHT networks
We study the scalable management of XML data in P2P networks based on distributed hash tables (DHTs). We identify performance limitations in this context, and propose an array of t...
Serge Abiteboul, Ioana Manolescu, Neoklis Polyzoti...