An empirical comparison: tree and lattice structures for symbolic data bases

Authors:
Lawrence J. Mazlack
Affiliations:
University of Cincinnati, Cincinnati, Ohio
Venue:
SIGIR '79 Proceedings of the 2nd annual international ACM SIGIR conference on Information storage and retrieval: information implications into the eighties
Year:
1979

Citing 5
Cited 0

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases

Journal of the ACM (JACM)
Trie memory

Communications of the ACM
Data Structures: Theory and Practice

Data Structures: Theory and Practice
An investigation of computer generated crossword puzzle techniques

An investigation of computer generated crossword puzzle techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

Unidirectional trees and lattices may both be used to hold a symbolic data base consisting of lexes, lexemes or other symbol strings. This paper empirically compares placing symbolic information into both trees and lattices (a lattice may be thought of as a unidirectional network with single and initiating and terminating nodes).