Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.5555/338219.338249acmconferencesArticle/Chapter ViewAbstractPublication PagessodaConference Proceedingsconference-collections
Article
Free access

Engineering the compression of massive tables: an experimental approach

Published: 01 February 2000 Publication History
First page of PDF

References

[1]
M. Burrows and D. J. Wheeler. A block-sorting lossless data compression algorithm. Technical Report 124, DEC SRC, May 1994.]]
[2]
Census of population and housing, 1990: Summary tape file 3 on CD-ROM. U.S. Bureau of the Census, Washington, 1992.]]
[3]
M. Charikar and S. Guha. Improved combinatorial algorithms for the facility location and k-median problems. In Proc. 40th IEEE FOCS, pages 378-88, 1999.]]
[4]
E A. Chudak. Improved approximation algorithms for uncapacitated facility location. In Proc. 6th IPCO, volume 1412 of LNCS, pages 180-94. Springer-Verlag, 1998.]]
[5]
E A. Chudak and D. B. Shmoys. improved approximation algorithms for the uncapacitated facility location problem. Unpublished manuscript, 1998.]]
[6]
J. G. Cleary and I. H. Witten. Data-compression using adaptive coding and partial string matching. IEEE Trans. Comm., 32(4):396-402, 1984.]]
[7]
G. Cormack. Data compression in a data base system. C. ACM, 28(12):1336, 1985.]]
[8]
J. Goldstein, R. Ramakrishnan, and U. Shaft. Compressing relations and indexes. In Proc. 14th Int'l. Conf. on Data Eng., pages 370--9, 1998.]]
[9]
D. A. Huffman. A method for the construction of minimumredundancy codes. Proc. IRE, 49(9):1098-101, 1952.]]
[10]
J. J. Hunt, K.-E Vo, and W. E Tichy. An empirical study of delta algorithms. In IEEE Software Configuration and Maintenance Wks., 1996.]]
[11]
K. Jain and V. V. Vazirani. Primal-dual approximation algorithms for metric facility location and k-median problems. In Proc. 40th IEEE FOCS, pages 2-13, 1999.]]
[12]
J.-H. Juang, D. Y. Wong, and A. H. Gray, Jr. Distortion performance of vector quantization for LPC voice coding. IEEE Trans. Acous., Spclt, and Sig. Proc., ASSP-30(2):294- 304, 1982.]]
[13]
B. Kobler, J. Berben, E Caulk, and E C. Hariharan. Architecture and design of storage and data management for the NASA Earth Observing System Data and Information System (EOSDIS). In Proc. 14th IEEE Syrup. on Mass Storage Systems, pages 65--76, 1995.]]
[14]
M. Korupolu, G. Plaxton, and R. Rajaraman. Analysis of a local heuristic for facility location problems. In Proc. 9th ACM-SIAM SODA, pages 1-10, 1998.]]
[15]
J. D. Markel and A. H. Gray, Jr. Linear Prediction of Speech. Springer-Verlag, 1976.]]
[16]
A. Moffat. Implementing the PPM data-compression scheme. IEEE Trans. Comm., 38(11): 1917-21, 1990.]]
[17]
D. Shmoys, E. Tardos, and K. Aardal. Approximation algorithms for facility location problems. In Proc. 29th ACM STOC, pages 265-74, 1997.]]
[18]
T. A. Welch. A technique for high performance data compression. IEEE Computer, 17(6):8-19, 1984.]]
[19]
I. H. Witten, R. M. Neal, and J. G. Cleary. Arithmetic coding for data-compression. C. ACM, 30(6):520-40, 1987.]]
[20]
J. Ziv and A. Lempel. A universal algorithm for sequential data compression. IEEE Trans. Inf. Thy., IT-23(3):337-43, 1977.]]
[21]
J. Ziv and A. Lempel. Compression of individual sequences via variable-rate coding. IEEE Trans. Inf. Thy., IT-24(5):530- 36, 1978.]]

Cited By

View all
  • (2019)A universal compression strategy using sorting transformationInternational Journal of Computational Science and Engineering10.5555/3337494.333749518:3(211-216)Online publication date: 1-Jan-2019
  • (2015)Scalable Facility Location for Massive Graphs on Pregel-like SystemsProceedings of the 24th ACM International on Conference on Information and Knowledge Management10.1145/2806416.2806508(273-282)Online publication date: 17-Oct-2015
  • (2011)PRESIDIOACM Transactions on Storage10.1145/1970348.19703517:2(1-60)Online publication date: 1-Jul-2011
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
SODA '00: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
February 2000
965 pages
ISBN:0898714532

Sponsors

Publisher

Society for Industrial and Applied Mathematics

United States

Publication History

Published: 01 February 2000

Check for updates

Qualifiers

  • Article

Acceptance Rates

Overall Acceptance Rate 411 of 1,322 submissions, 31%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)50
  • Downloads (Last 6 weeks)13
Reflects downloads up to 25 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2019)A universal compression strategy using sorting transformationInternational Journal of Computational Science and Engineering10.5555/3337494.333749518:3(211-216)Online publication date: 1-Jan-2019
  • (2015)Scalable Facility Location for Massive Graphs on Pregel-like SystemsProceedings of the 24th ACM International on Conference on Information and Knowledge Management10.1145/2806416.2806508(273-282)Online publication date: 17-Oct-2015
  • (2011)PRESIDIOACM Transactions on Storage10.1145/1970348.19703517:2(1-60)Online publication date: 1-Jul-2011
  • (2009)AlphaSumProceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology10.1145/1516360.1516373(96-107)Online publication date: 24-Mar-2009
  • (2007)RadixZipProceedings of the 33rd international conference on Very large data bases10.5555/1325851.1325984(1162-1172)Online publication date: 23-Sep-2007
  • (2007)Compressing table data with column dependencyTheoretical Computer Science10.1016/j.tcs.2007.07.016387:3(273-283)Online publication date: 20-Nov-2007
  • (2006)A compression-boosting transform for two-dimensional dataProceedings of the Second international conference on Algorithmic Aspects in Information and Management10.1007/11775096_13(126-137)Online publication date: 20-Jun-2006
  • (2004)Compressing large boolean matrices using reordering techniquesProceedings of the Thirtieth international conference on Very large data bases - Volume 3010.5555/1316689.1316693(13-23)Online publication date: 31-Aug-2004
  • (2003)Optimal partitions of stringsProceedings of the 14th annual conference on Combinatorial pattern matching10.5555/1756553.1756563(129-143)Online publication date: 25-Jun-2003
  • (2003)Improving table compression with combinatorial optimizationJournal of the ACM10.1145/950620.95062250:6(825-851)Online publication date: 1-Nov-2003
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media