Performance Tuning an Algorithm for Compressing Relational Tables
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.
KeywordsHash Function Hash Table Relation Scheme Compression Scheme Performance Tune
Unable to display preview. Download preview PDF.
- A. V. Aho, J. E. Hopcroft, AND J. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley (1974).Google Scholar
- Array Technology A/S, Array technology, Website accessible at http://www.arraytechnology.com (2002).
- T. Hagerup, Sorting and searching on the word RAM, Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science 1373, Springer-Verlag (1998), 366–398.Google Scholar
- J. Katajainen AND M. Lykke, Experiments with universal hashing, Technical Report 96/8, Department of Computer Science, University of Copenhagen (1996).Google Scholar
- A. K. Mackworth, Constraint satisfaction, Encyclopedia of Artificial Intelligence, 2nd Edition, John Wiley & Sons (1992), 285–293.Google Scholar
- J. N. Madsen, Algorithms for compressing and joining relations, CPH STL Report 2002-1, Department of Computing, University of Copenhagen (2002). Available at http://www.cphstl.dk.
- N. C. Meyers, Traits: A new and useful template technique, C++ Report (1995). Available at http://www.cantrip.org/traits.html.
- G. L. Møller, On the technology of array-based logic, Ph.D. Thesis, Technical University of Denmark (1995). Available at http://www.arraytechnology.com/documents/lic.pdf.
- M. Thorup, Even strongly universal hashing is pretty fast, Proceedings of the 11th Annual Symposium on Discrete Algorithms, ACM-SIAM (2000), 496–497.Google Scholar