Skip to main content

Adaptive Tuple Differential Coding

  • Conference paper
Database and Expert Systems Applications (DEXA 2007)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4653))

Included in the following conference series:

Abstract

It is desirable to employ compression techniques in Relational OLAP systems to reduce disk space requirements and increase disk I/O throughput. Tuple Differential Coding (TDC) techniques have been introduced to compress views on a tuple level by storing only the differences between consecutive ordered tuples. These techniques work well for highly regular data in which the differences between tuples are fairly constant but are less effective on real data containing either skew or outliers. In this paper we introduce Adaptive Tuple Differential Coding (ATDC), which employs optimization techniques to analyze blocks of tuples to detect large tuple differences, with the purpose of isolating them to minimize their negative effect on the compression of neighbouring tuples. Our experiments show that this new algorithm provides an increase in compression ratio of 15–30% over TDC on typical real datasets.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Bender, M.A., Farach-Colton, M., Pemmasani, G., Skiena, S., Sumazin, P.: Lowest common ancestors in trees and directed acyclic graphs. Journal of Algorithms 57, 75–94 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  2. cgmLab: OLAP data generator (2000), http://cgmlab.cs.dal.ca/downloadarea/

  3. Chen, Z., Seshadri, P.: An algebraic compression framework for query results. In: ICDE, pp. 177–188 (2000)

    Google Scholar 

  4. Dehne, F., Eavis, T., Rau-Chaplin, A.: Parallel multi-dimensional ROLAP indexing. In: Proc. Int’l Symposium on Cluster Computing and the Grid, 2003, pp. 86–93 (2003)

    Google Scholar 

  5. Liang, B.: Compressing data cube in parallel OLAP systems. Master’s thesis, Carleton University (2004)

    Google Scholar 

  6. Ng, W.K., Ravishankar, C.V.: Block-oriented compression techniques for large statistical databases. Knowledge and Data Engineering 9(2), 314–328 (1997)

    Article  Google Scholar 

  7. US Geological Survey. HYDRO1k elevation derivative database (2003), http://edcdaac.usgs.gov/gtopo30/hydro/index.asp

  8. Vuillemin, J.: A unifying look at data structures. Communications of the ACM 23, 229–239 (1980)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Roland Wagner Norman Revell Günther Pernul

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Deveaux, JP., Rau-Chaplin, A., Zeh, N. (2007). Adaptive Tuple Differential Coding. In: Wagner, R., Revell, N., Pernul, G. (eds) Database and Expert Systems Applications. DEXA 2007. Lecture Notes in Computer Science, vol 4653. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74469-6_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74469-6_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74467-2

  • Online ISBN: 978-3-540-74469-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics