Method for encoding and decoding acyclic, linked-list data struc

Boots – shoes – and leggings

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

364300, G06F 940, G06F 1540, G06F 1208

Patent

active

048036510

ABSTRACT:
To encode hierarchial information the invention recognizes that there is implicit information which must be made explicit. Thus the hierarchial information is annotated by selectively adding to it two spatial representing characters, each instance of a first spatial representing character corresponds to a unit step to the right, each instance of a second spatial representing character represents a unit identation to the left, and the first instance of the second spatial representing character in a string of the second spatial representing characters also represents a carriage return and line feed. The annotated hierarchial information is then scanned to produce two byproduct strings. The first byproduct string is merely the sequence of first and second spatial representing characters, in the order in which they appear, to which is added two place holding characters, one representing an alpha-numeric string, and the second representing a string of one or more blank or null characters. The second byproduct string is merely the concatenation of the alpha-numeric strings appearing in the hierarchial information. The first and second byproduct strings are then stored. The method is reversible so tht the encoded and stored hierarchial data structure (including its contents) can be retrieved and reconstituted. The encoded stored hierarchy (and its contents) can also be rapidly searched in its encoded form.

REFERENCES:
patent: 3670310 (1972-06-01), Bharwani et al.
patent: 3737864 (1973-06-01), Werner
patent: 4047248 (1987-09-01), Lyman et al.
patent: 4064489 (1977-12-01), Babb
patent: 4068298 (1978-01-01), Dechant et al.
patent: 4086629 (1978-04-01), Desyllas et al.
patent: 4149240 (1979-04-01), Misunas et al.
patent: 4283771 (1981-08-01), Chang
patent: 4322815 (1982-03-01), Broughton
patent: 4429385 (1984-01-01), Cichelli et al.
patent: 4606002 (1986-08-01), Waisman et al.
Bobrow, "A Note on Hash Linking", Communications of the ACM, vol. 18, No. 7, Jul. 1975, pp. 413-415.
Bobrow et al, "Compact Encodings of List Structure", ACM Transactions on Programming Languages and Systems, vol. 1, No. 2, Oct. 1979, pp. 266-286.
Steele, "Data Representation in PDP-10 MACLISP", MIT A. I. Memo No. 420, NTIS Report AD-A052-305, Apr. 1978.
Knuth, The Art of Computer Programming, vol. 1, "Fundamental Algorithms", 2nd ed, Addison Wellsley, pp. 408 et seq.
D. Comer, "The Ubiquitous B-Tree", Computing Surveys, vol. 11, No. 2, Jun. 1979, pp. 121-137.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Method for encoding and decoding acyclic, linked-list data struc does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method for encoding and decoding acyclic, linked-list data struc, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for encoding and decoding acyclic, linked-list data struc will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-1089195

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.