Sciweavers

73 search results - page 5 / 15
» Perfect Hashing for Data Management Applications
Sort
View
ICDE
2005
IEEE
146views Database» more  ICDE 2005»
15 years 5 months ago
Best Effort Query Processing in DHT-based P2P Systems
Structured P2P systems in the form of distributed hash tables (DHT) are a promising approach for building massively distributed data management platforms. However, for many applic...
Philipp Rösch, Kai-Uwe Sattler, Christian von...
ERLANG
2003
ACM
15 years 4 months ago
A study of Erlang ETS table implementations and performance
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...
Scott Lystig Fritchie
84
Voted
VLDB
2000
ACM
136views Database» more  VLDB 2000»
15 years 3 months ago
Managing Intervals Efficiently in Object-Relational Databases
Modern database applications show a growing demand for efficient and dynamic management of intervals, particularly for temporal and spatial data or for constraint handling. Common...
Hans-Peter Kriegel, Marco Pötke, Thomas Seidl
89
Voted
CIT
2006
Springer
15 years 3 months ago
A new collision resistant hash function based on optimum dimensionality reduction using Walsh-Hadamard transform
Hash functions play the most important role in various cryptologic applications, ranging from data integrity checking to digital signatures. Our goal is to introduce a new hash fu...
Barzan Mozafari, Mohammad Hasan Savoji
78
Voted
FAST
2003
15 years 1 months ago
Data Staging on Untrusted Surrogates
We show how untrusted computers can be used to facilitate secure mobile data access. We discuss a novel architecture, data staging, that improves the performance of distributed ï¬...
Jason Flinn, Shafeeq Sinnamohideen, Niraj Tolia, M...