On the allocation of binary trees to secondary storage (Q1157927): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5558293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3853109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparative study of very large data bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic hashing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4051594 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequence search trees: Their analysis using recurrence relations / rank
 
Normal rank

Latest revision as of 14:13, 13 June 2024

scientific article
Language Label Description Also known as
English
On the allocation of binary trees to secondary storage
scientific article

    Statements

    On the allocation of binary trees to secondary storage (English)
    0 references
    0 references
    0 references
    1981
    0 references
    0 references
    0 references
    0 references
    0 references
    21, 305-316 (1981)
    0 references
    searching
    0 references
    information storage and retrieval
    0 references
    data organization
    0 references
    paging binary trees
    0 references
    combinatorial properties of trees
    0 references
    0 references