article

Free access

Storing a sparse table

Authors:

Robert Endre Tarjan,

Andrew Chi-Chih YaoAuthors Info & Claims

Communications of the ACM, Volume 22, Issue 11

Pages 606 - 611

https://doi.org/10.1145/359168.359175

Published: 01 November 1979 Publication History

PDF eReader

Abstract

The problem of storing and searching large sparse tables is ubiquitous in computer science. The standard technique for storing such tables is hashing, but hashing has poor worst-case performance. We propose a good worst-case method for storing a static table of n entries, each an integer between 0 and N - 1. The method requires O(n) words of storage and allows O(log_n N) access time. Although our method is a little complicated to use in practice, our analysis shows why a simpler algorithm used for compressing LR parsing tables works so well.

References

[1]

Alto, A.V., Hopcroft, J.E., and Ullman, J.D. The Design and Analysis of Computer d Igorithm. Addison-Wesley, Reading, Mass., 1974,

Digital Library

Google Scholar

[2]

Aho, A.V., and Ullman, J.D. Principles of Compiler Design. Addison-Wesley, Reading, Mass., 1977.

Digital Library

Google Scholar

[3]

Downey, P.J., Sethi, R., and Tarjan, R.E. Variations on the common subexpression problem. To appear in J. A CM.

Digital Library

Google Scholar

[4]

Even, S., Lichtenstein, D.I., and Shiloach, Y. Remarks on Ziegler's method for matrix compression. Unpublished manuscript, 1977.

Google Scholar

[5]

Knuth, D.E. The Art of Computer Programming, VoL 3: Sorting and Searching. Addison-Wesley, Reading, Mass., 1973.

Digital Library

Google Scholar

[6]

Sprugnoli, R. Perfect hashing functions: A single probe retrieving method for static sets. Comm. ACM 20, 11 (Nov. 1977), 841-850.

Digital Library

Google Scholar

[7]

Tarjan, R.E. Graph theory and Gaussian elimination. In Sparse Matrix Computations, J.R. Bunch and D.J. Rose, Eds., Academic Press, New York, 1976, pp. 3-22.

Google Scholar

[8]

Ziegler, S.F. Smaller faster table driven parser. Unpublished manuscript, Madison Academic Comptg. Ctr., U. of Wisconsin, Madison, Wisconsin, 1977.

Google Scholar

Cited By

View all

He XChen KFeng SKim HBlaauw DDreslinski RMudge TKloeckner AMoreira J(2022)Squaring the circleProceedings of the International Conference on Parallel Architectures and Compilation Techniques10.1145/3559009.3569665(148-159)Online publication date: 8-Oct-2022
https://dl.acm.org/doi/10.1145/3559009.3569665
Yu H(2022)Nearly Optimal Static Las Vegas Succinct DictionarySIAM Journal on Computing10.1137/20M136364951:3(STOC20-174-STOC20-249)Online publication date: 2-May-2022
https://doi.org/10.1137/20M1363649
Pibiri GTrani RDiaz FShah CSuel TCastells PJones RSakai T(2021)PTHash: Revisiting FCH Minimal Perfect HashingProceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval10.1145/3404835.3462849(1339-1348)Online publication date: 11-Jul-2021
https://dl.acm.org/doi/10.1145/3404835.3462849
Show More Cited By

Storing a sparse table
1. Theory of computation
  1. Design and analysis of algorithms
    1. Data structures design and analysis

Recommendations

An optimal storage format for sparse matrices

The irregular nature of sparse matrix-vector multiplication, Ax = y, has led to the development of a variety of compressed storage formats, which are widely used because they do not store any unnecessary elements. One of these methods, the Jagged ...
Storing a sparse table
Improved sparse low-rank matrix estimation

We consider estimating simultaneously sparse and low-rank matrices from their noisy observations.We use non-convex penalty functions that are parameterized to ensure strict convexity of the overall objective function.An ADMM based algorithm is derived ...

Comments

Information & Contributors

Information

Published In

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 November 1979

Published in CACM Volume 22, Issue 11

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

194
Total Citations
View Citations
2,561
Total Downloads

Downloads (Last 12 months)246
Downloads (Last 6 weeks)35

Reflects downloads up to 09 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

He XChen KFeng SKim HBlaauw DDreslinski RMudge TKloeckner AMoreira J(2022)Squaring the circleProceedings of the International Conference on Parallel Architectures and Compilation Techniques10.1145/3559009.3569665(148-159)Online publication date: 8-Oct-2022
https://dl.acm.org/doi/10.1145/3559009.3569665
Yu H(2022)Nearly Optimal Static Las Vegas Succinct DictionarySIAM Journal on Computing10.1137/20M136364951:3(STOC20-174-STOC20-249)Online publication date: 2-May-2022
https://doi.org/10.1137/20M1363649
Pibiri GTrani RDiaz FShah CSuel TCastells PJones RSakai T(2021)PTHash: Revisiting FCH Minimal Perfect HashingProceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval10.1145/3404835.3462849(1339-1348)Online publication date: 11-Jul-2021
https://dl.acm.org/doi/10.1145/3404835.3462849
He XPal SAmarnath AFeng SPark DRovinski AYe HChen YDreslinski RMudge TAyguadé EHwu WBadia RHofstee H(2020)Sparse-TPUProceedings of the 34th ACM International Conference on Supercomputing10.1145/3392717.3392751(1-12)Online publication date: 29-Jun-2020
https://dl.acm.org/doi/10.1145/3392717.3392751
Yu HMakarychev KMakarychev YTulsiani MKamath GChuzhoy J(2020)Nearly optimal static Las Vegas succinct dictionaryProceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing10.1145/3357713.3384274(1389-1401)Online publication date: 22-Jun-2020
https://dl.acm.org/doi/10.1145/3357713.3384274
Butler JSasao T(2019)Realizing all Index Generation Functions by the Row-Shift Method2019 IEEE 49th International Symposium on Multiple-Valued Logic (ISMVL)10.1109/ISMVL.2019.00032(138-143)Online publication date: May-2019
https://doi.org/10.1109/ISMVL.2019.00032
Breslow AJayasena N(2019)Morton filters: fast, compressed sparse cuckoo filtersThe VLDB Journal10.1007/s00778-019-00561-029:2-3(731-754)Online publication date: 6-Aug-2019
https://doi.org/10.1007/s00778-019-00561-0
Breslow AJayasena N(2018)Morton filtersProceedings of the VLDB Endowment10.14778/3213880.321388411:9(1041-1055)Online publication date: 1-May-2018
https://dl.acm.org/doi/10.14778/3213880.3213884
Yoon SYoun YPark KKim S(2017)Mobile Unified Memory-Storage Structure Based on Hybrid Non-Volatile MemoriesACM Journal on Emerging Technologies in Computing Systems10.1145/300765013:3(1-18)Online publication date: 21-Apr-2017
https://dl.acm.org/doi/10.1145/3007650
Karam RPaul SPuri RBhunia S(2017)Memory-Centric Reconfigurable Accelerator for Classification and Machine Learning ApplicationsACM Journal on Emerging Technologies in Computing Systems10.1145/299764913:3(1-24)Online publication date: 1-May-2017
https://dl.acm.org/doi/10.1145/2997649
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Recommendations

An optimal storage format for sparse matrices