Skip to main content
SpringerLink
Log in

Performance Tuning an Algorithm for Compressing Relational Tables

  • Conference paper
  • First Online:
Algorithm Theory — SWAT 2002 (SWAT 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2368))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. V. Aho, J. E. Hopcroft, AND J. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley (1974).

    Google Scholar 

  2. Array Technology A/S, Array technology, Website accessible at http://www.arraytechnology.com (2002).

  3. J. L. Bentley AND J. B. Saxe, Algorithms on vector sets, SIGACT News 11,9 (1979), 36–39.

    Article  Google Scholar 

  4. J. L. Carter AND M. N. Wegman, Universal classes of hash functions, Journal of Computer and System Sciences 18,2 (1979), 143–154.

    Article  MATH  MathSciNet  Google Scholar 

  5. E. F. Codd, A relational model of data for large shared data banks, Communications of the ACM 13,6 (1970), 377–387.

    Article  MATH  Google Scholar 

  6. 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 

  7. J. Katajainen AND M. Lykke, Experiments with universal hashing, Technical Report 96/8, Department of Computer Science, University of Copenhagen (1996).

    Google Scholar 

  8. A. K. Mackworth, Constraint satisfaction, Encyclopedia of Artificial Intelligence, 2nd Edition, John Wiley & Sons (1992), 285–293.

    Google Scholar 

  9. 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.

  10. N. C. Meyers, Traits: A new and useful template technique, C++ Report (1995). Available at http://www.cantrip.org/traits.html.

  11. 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.

  12. 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 

  13. M. N. Wegman AND J. L. Carter, New hash functions and their use in authentication and set equality, Journal of Computer and System Sciences 22,3 (1981), 265–279.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computing, University of Copenhagen, Universitetsparken 1, DK-2100, Copenhagen East, Denmark

    Jyrki Katajainen

  2. Array Technology A/S, Fruebjergvej 3, DK-2100, Copenhagen East, Denmark

    Jeppe Nejsum Madsen

Authors
  1. Jyrki Katajainen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jeppe Nejsum Madsen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Applied Mathematics, University of Kuopio, P.O. Box 1627, 70211, Kuopio, Finland

    Martti Penttonen

  2. BRICS, University of Aarhus, Department of Computer Science, NY Munkegade, 8000, Aarhus C, Denmark

    Erik Meineche Schmidt

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Katajainen, J., Madsen, J.N. (2002). Performance Tuning an Algorithm for Compressing Relational Tables. In: Penttonen, M., Schmidt, E.M. (eds) Algorithm Theory — SWAT 2002. SWAT 2002. Lecture Notes in Computer Science, vol 2368. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45471-3_41

Download citation

  • DOI: https://doi.org/10.1007/3-540-45471-3_41

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43866-3

  • Online ISBN: 978-3-540-45471-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation