75 search results - page 2 / 15 » Optimal splitters for database partitioning with size bounds |
FSTTCS
2009
Springer
13 years 9 months ago
2009
Springer
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...
ICDE
2012
IEEE
11 years 7 months ago
2012
IEEE
—This paper investigates the problem of incremental detection of errors in distributed data. Given a distributed database D, a set Σ of conditional functional dependencies (CFDs...
IDEAS
2003
IEEE
13 years 10 months ago
2003
IEEE
We propose a new storage model called MBSM (Multiresolution Block Storage Model) for laying out tables on disks. MBSM is intended to speed up operations such as scans that are typ...
ISPD
2003
ACM
13 years 10 months ago
2003
ACM
This paper studies the optimality, scalability and stability of stateof-the-art partitioning and placement algorithms. We present algorithms to construct two classes of benchmarks...
VLDB
1989
ACM
13 years 9 months ago
1989
ACM
We present a framework for the estimation of the size of binary recursively defined relations. We show how the framework can be used to provide estimating algo rithms for the size...