[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
article
Free access

Trie memory

Published: 01 September 1960 Publication History
First page of PDF

References

[1]
R. DE LA BRIANDAIS. File searching using variable length keys. Proceedings, Western Joint Computer Conference, 1959, pp. 295-298.
[2]
E. FREDKIN, Trie memory. Informal Memorandum. Bolt Beranek and Newman Inc. Cambridge, Mass., 23 January 1959.
[3]
J. C, R. LICKUDER AND N. BURTON, Long range constraints in the statistical structure of printed English. Am. J. Psychol. 68 (1955), 650-653.
[4]
C. E. SHANNON, Prediction and entropy in printed English. Bell System Tech. J 30 (1951), 50-64.
[5]
J. C. SHAW, A. NEWELL. AND H. A. SIMON. A command structure for complex information processing. Proceedings, Western Joint Computer Conference, 1958, pp. 119-128.

Cited By

View all
  • (2025)Two-level massive string dictionariesInformation Systems10.1016/j.is.2024.102490128:COnline publication date: 1-Feb-2025
  • (2024)BWBEV: A Bitwise Query Processing Algorithm for Approximate Prefix SearchJournal of the Brazilian Computer Society10.5753/jbcs.2024.423630:1(527-541)Online publication date: 27-Oct-2024
  • (2024)Leveraging Partially Context-Sensitive Profiles for Enhanced AOT Compilation: A ReviewInternational Journal of Engineering and Advanced Technology10.35940/ijeat.A4538.1401102414:1(6-9)Online publication date: 30-Oct-2024
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Communications of the ACM
Communications of the ACM  Volume 3, Issue 9
September 1960
31 pages
ISSN:0001-0782
EISSN:1557-7317
DOI:10.1145/367390
  • Editor:
  • Alan J. Perlis
Issue’s Table of Contents
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 September 1960
Published in CACM Volume 3, Issue 9

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)653
  • Downloads (Last 6 weeks)134
Reflects downloads up to 03 Mar 2025

Other Metrics

Citations

Cited By

View all
  • (2025)Two-level massive string dictionariesInformation Systems10.1016/j.is.2024.102490128:COnline publication date: 1-Feb-2025
  • (2024)BWBEV: A Bitwise Query Processing Algorithm for Approximate Prefix SearchJournal of the Brazilian Computer Society10.5753/jbcs.2024.423630:1(527-541)Online publication date: 27-Oct-2024
  • (2024)Leveraging Partially Context-Sensitive Profiles for Enhanced AOT Compilation: A ReviewInternational Journal of Engineering and Advanced Technology10.35940/ijeat.A4538.1401102414:1(6-9)Online publication date: 30-Oct-2024
  • (2024)NemoProceedings of the 21st International Conference on Principles of Knowledge Representation and Reasoning10.24963/kr.2024/70(743-754)Online publication date: 2-Nov-2024
  • (2024)SLIPP: A Space-Efficient Learned Index for String KeysProceedings of the 2024 6th International Conference on Big-data Service and Intelligent Computation10.1145/3686540.3686550(69-77)Online publication date: 29-May-2024
  • (2024)Hyper: A High-Performance and Memory-Efficient Learned Index via Hybrid ConstructionProceedings of the ACM on Management of Data10.1145/36549482:3(1-26)Online publication date: 30-May-2024
  • (2024)Tackling Challenges in Implementing Large-Scale Graph DatabasesCommunications of the ACM10.1145/365331467:8(40-44)Online publication date: 16-Jul-2024
  • (2024)Spruce: a Fast yet Space-saving Structure for Dynamic Graph StorageProceedings of the ACM on Management of Data10.1145/36392822:1(1-26)Online publication date: 26-Mar-2024
  • (2024)Look What’s There! Utilizing the Internet’s Existing Data for Censorship Circumvention with OPPRESSIONProceedings of the 19th ACM Asia Conference on Computer and Communications Security10.1145/3634737.3637676(80-95)Online publication date: 1-Jul-2024
  • (2024)The simpliciality of higher-order networksEPJ Data Science10.1140/epjds/s13688-024-00458-113:1Online publication date: 7-Mar-2024
  • 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

Full Access

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media