skip to main content
article
Free Access

Faster retrieval from context trees

Published:01 September 1976Publication History
Skip Abstract Section

Abstract

Context trees provide a convenient way of storing data which is to be viewed as a hierarchy of contexts. This note presents an algorithm which improves on previous context tree retrieval algorithms. It is based on the observation that in typical uses context changes are infrequent relative to retrievals, so that data can be cached to speed up retrieval. A retrieval is started from the position of the previous retrieval and auxiliary structures are built up to make the search rapid. Algorithms for addition and deletion of data and for garbage collection are outlined.

References

  1. 1 Deutscb, L.P. An interactive program verifier. Ph.D. Th., Computer Sci. Dep., U. of California, Berkeley, May 1973.Google ScholarGoogle Scholar
  2. 2 Rulifson, J.F., Dirksen, J.A., and Waldinger, R.T. QA4--a language for writing problem solving programs. Proc. IFIP Cong. 71, Ljubljana, North-Holland Pub. Co., Amsterdam, 1971.Google ScholarGoogle Scholar
  3. 3 Sussman, G.J., and McDermott, D. Why conniving is better than planning. AFIPS Conf. Proc., Vol. 41, Part II, 1972 FJCC, AFIPS Press, Montvale, N.J., pp. 1171-1179.Google ScholarGoogle Scholar
  4. 4 Wegbreit, B. Retrieval from context trees. Inf. Proc. Left. 3, 4 (March 1975), 119-120.Google ScholarGoogle ScholarCross RefCross Ref

Recommendations

Comments

Login options

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

Sign in

Full Access

  • Published in

    cover image Communications of the ACM
    Communications of the ACM  Volume 19, Issue 9
    Sept. 1976
    44 pages
    ISSN:0001-0782
    EISSN:1557-7317
    DOI:10.1145/360336
    Issue’s Table of Contents

    Copyright © 1976 ACM

    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: 1 September 1976

    Permissions

    Request permissions about this article.

    Request Permissions

    Check for updates

    Qualifiers

    • article

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader