Proceedings of the 1971 ACM SIGFIDET (Now SIGMOD) Workshop on Data Description, Access and Control - SIGFIDET '71 1971
DOI: 10.1145/1734714.1734730
|View full text |Cite
|
Sign up to set email alerts
|

Storage optimization of tree structured files representing descriptor sets

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

1976
1976
2019
2019

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 11 publications
(4 citation statements)
references
References 4 publications
0
4
0
Order By: Relevance
“…If the principle of commonality is not obeyed, then the amount of storage required for the abstract network can increase dramatically. However, the speed of retrieval is not measurably affected [24]. It should be recalled that the security facility can always be invoked to deny unauthorized access to any item of information.…”
Section: Tql Examplesmentioning
confidence: 99%
See 1 more Smart Citation
“…If the principle of commonality is not obeyed, then the amount of storage required for the abstract network can increase dramatically. However, the speed of retrieval is not measurably affected [24]. It should be recalled that the security facility can always be invoked to deny unauthorized access to any item of information.…”
Section: Tql Examplesmentioning
confidence: 99%
“…However, because only non-redundant information is inserted into RFILE, the number of information paths stored per memory block significantly increase when the number of entries in a database(s) increases [24]. We have estimated that less than one eighth of the storage that is required to store the formulae in the National Compound Registry, which has more than 8,000,000 entries, is required for RFILE.…”
Section: B Expected Performancementioning
confidence: 99%
“…De Maine and Rotwitt 5 found that the order in which the characters are tested in building the trie has influences on the size of resulting tries. Using this idea, Comer and Sethi 6 defined the ordercontaining trie (O-Trie).…”
Section: Introductionmentioning
confidence: 99%
“…For details see [lOI. As noted in [3,12] and [4], the high space requirement is the main disadvantage of tries, so in this paper we present several algorithms for reducing the space while trying to preserve the efficiency of the trie search. As first observed by Rotwitt and de Maine [13], one way to reduce the number of nodes of a trie, and thus to reduce the total space required, is to reorder the testing of attributes. As a trivial example of this approach, consider the trie representation for the words WITH, WITS, WIFE.…”
Section: An Introduction To the Trie Data Structurementioning
confidence: 99%