— Bloom filters are a well known data structure for approximate set membership. Bloom filters are space efficient but require many independent hashes and consecutive memory acces...
This paper presents a vectorized algorithm for entering data into a hash table. A program that enters multiple data could not be executed on vector processors by conventional vect...
This paper provides an overview of MediaDART, a framework for building online services for distributing and sharing digital media. Inspired by the participative model of Web 2.0, ...
A peer-to-peer file sharing system includes a lookup and a content distribution protocol. Very efficient peer-to-peer protocols exist for content distribution, but efficient in...
Abstract. We present MinervaDL, a digital library architecture that supports approximate information retrieval and filtering functionality under a single unifying framework. The a...
Christian Zimmer, Christos Tryfonopoulos, Gerhard ...