Sciweavers

568 search results - page 45 / 114
» Query by table
Sort
View
INFOCOM
2008
IEEE
15 years 4 months ago
Peacock Hashing: Deterministic and Updatable Hashing for High Performance Networking
—Hash tables are extensively used in networking to implement data-structures that associate a set of keys to a set of values, as they provide O(1), query, insert and delete opera...
Sailesh Kumar, Jonathan S. Turner, Patrick Crowley
PVLDB
2008
84views more  PVLDB 2008»
14 years 9 months ago
When is it time to rethink the aggregate configuration of your OLAP server?
OLAP servers based on relational backends typically exploit materialized aggregate tables to improve response times of complex analytical queries. One of the key problems in this ...
Katja Hose, Daniel Klan, Matthias Marx, Kai-Uwe Sa...
AICT
2006
IEEE
102views Communications» more  AICT 2006»
14 years 12 months ago
Publishing, Retrieving and Streaming Lectures via Application Level Multicast
Structured peer-to-peer overlay network is an efficient solution for querying and retrieving resources spread between the peers. Unfortunately, key based routing of Distributed Ha...
Marco Milanesio, Giancarlo Ruffo
ESORICS
2005
Springer
15 years 3 months ago
Sybil-Resistant DHT Routing
Distributed Hash Tables (DHTs) are very efficient distributed systems for routing, but at the same time vulnerable to disruptive nodes. Designers of such systems want them used in ...
George Danezis, Chris Lesniewski-Laas, M. Frans Ka...
VLDB
1989
ACM
98views Database» more  VLDB 1989»
15 years 1 months ago
A Family of Incomplete Relational Database Models
In this paper. we utilize intervals for unknown values in incompleterelational databases.We usetablesto representunknown relations. First, we define three partial tuple types in a...
Adegbemiga Ola, Gultekin Özsoyoglu