Sciweavers

30 search results - page 4 / 6
» Lookup Tables: Fine-Grained Partitioning for Distributed Dat...
Sort
View
DOLAP
2004
ACM
15 years 5 months ago
Handling big dimensions in distributed data warehouses using the DWS technique
The DWS (Data Warehouse Striping) technique allows the distribution of large data warehouses through a cluster of computers. The data partitioning approach partition the facts tab...
Marco Costa, Henrique Madeira
ANCS
2009
ACM
14 years 9 months ago
Progressive hashing for packet processing using set associative memory
As the Internet grows, both the number of rules in packet filtering databases and the number of prefixes in IP lookup tables inside the router are growing. The packet processing e...
Michel Hanna, Socrates Demetriades, Sangyeun Cho, ...
ICDE
2010
IEEE
379views Database» more  ICDE 2010»
15 years 11 months ago
Osprey: Implementing MapReduce-Style Fault Tolerance in a Shared-Nothing Distributed Database
In this paper, we describe a scheme for tolerating and recovering from mid-query faults in a distributed shared nothing database. Rather than aborting and restarting queries, our s...
Christopher Yang, Christine Yen, Ceryen Tan, Samue...
SIGMOD
2010
ACM
215views Database» more  SIGMOD 2010»
14 years 6 months ago
Crescando
This demonstration presents Crescando, an implementation of a distributed relational table that guarantees predictable response time on unpredictable workloads. In Crescando, data...
Georgios Giannikis, Philipp Unterbrunner, Jeremy M...
VLDB
2004
ACM
93views Database» more  VLDB 2004»
15 years 5 months ago
Symmetric Relations and Cardinality-Bounded Multisets in Database Systems
In a binary symmetric relationship, A is related to B if and only if B is related to A. Symmetric relationships between k participating entities can be represented as multisets of...
Kenneth A. Ross, Julia Stoyanovich