Performance Tuning an Algorithm for Compressing Relational Tables

Authors:
Jyrki Katajainen;Jeppe Nejsum Madsen
Affiliations:
-;-
Venue:
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Year:
2002

Citing 5
Cited 1

Even strongly universal hashing is pretty fast

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A relational model of data for large shared data banks

Communications of the ACM
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Sorting and Searching on the Word RAM

STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
Algorithms on vector sets

ACM SIGACT News

On converting CNF to DNF

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the behaviour of an algorithm which compresses relational tables by representing common subspaces as Cartesian products. The output produced allows space to be saved while preserving the functionality of many relational operations such as select, project and join. We describe an implementation of an existing algorithm, propose a slight modification which with high probability produces the same output, and present a performance study showing that for all test instances used both adaptations are considerably faster than the current implementation in a commercial software product.