Sciweavers

30 search results - page 2 / 6
» Lookup Tables: Fine-Grained Partitioning for Distributed Dat...
Sort
View
ISAS
2005
Springer
13 years 10 months ago
Dependable Distributed Computing Using Free Databases
Abstract. Designing and programming dependable distributed applications is very difficult. Databases provide features like transactions and replication that can help in the impleme...
Christof Fetzer, Trevor Jim
DOLAP
1998
ACM
13 years 9 months ago
Dynamic Maintenance of Multidimensional Range Data Partitioning for Parallel Data Processing
Star schema has been a typical model for both online transaction processing in traditional databases and online analytical processing in large data warehouses. In the star schema,...
Junping Sun, William I. Grosky
SIGMOD
2007
ACM
179views Database» more  SIGMOD 2007»
14 years 5 months ago
How to barter bits for chronons: compression and bandwidth trade offs for database scans
Two trends are converging to make the CPU cost of a table scan a more important component of database performance. First, table scans are becoming a larger fraction of the query p...
Allison L. Holloway, Vijayshankar Raman, Garret Sw...
DBISP2P
2003
Springer
136views Database» more  DBISP2P 2003»
13 years 10 months ago
Building Content-Based Publish/Subscribe Systems with Distributed Hash Tables
Abstract. Building distributed content–based publish/subscribe systems has remained a challenge. Existing solutions typically use a relatively small set of trusted computers as b...
David K. Tam, Reza Azimi, Hans-Arno Jacobsen
ICDE
2005
IEEE
146views Database» more  ICDE 2005»
13 years 10 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...