DocumentCode :
752895
Title :
A Method for Representing Data Items of Unlimited Length in a Computer Memory
Author :
Baber, Robert L.
Issue :
6
fYear :
1981
Firstpage :
590
Lastpage :
593
Abstract :
In this paper, a recursive data structure is defined which permits a data item of-unlimited length to be represented in a computer memory. The encoded data are a linear string of symbols which contains a specification of the length of the data item and the data item itself. In a single forward scan of the encoded data string, the length of the data item can be determined and the data item located and/or extracted.
Keywords :
Coding unbounded numbers; infinite address space; recursive data structure; storing data in a computer memory; unbounded address space; unbounded linear list; unlimited length data format; unlimited length data item; unlimited length data string; variable length data; Application software; Data mining; Data structures; Decoding; Information processing; System software; Coding unbounded numbers; infinite address space; recursive data structure; storing data in a computer memory; unbounded address space; unbounded linear list; unlimited length data format; unlimited length data item; unlimited length data string; variable length data;
fLanguage :
English
Journal_Title :
Software Engineering, IEEE Transactions on
Publisher :
ieee
ISSN :
0098-5589
Type :
jour
DOI :
10.1109/TSE.1981.226470
Filename :
1702891
Link To Document :
بازگشت