The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Analysis and performance of inverted data base structures
Open accessAbstract
The need to envision and architecture data base systems in a hierarchical level by level framework is stressed. The inverted data base (file) organization is then analyzed, considering implementation oriented aspects. The inverted directory is viewed realistically as another large data base which itself is subjected to inversion. Formulations are derived to estimate average access time (read only) and storage requirements, formalizing the interaction of data base content characteristics, logical complexity of queries, and machine timing and blocking specifications identified as having a first-order effect on performance. The formulations presented are necessary to be used in conjunction with any index selection criteria to determine the optimum set of index keys.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A relational model of data for large shared data banks
Codd, E. F. (1970) · Communications of the ACM · doi:10.1145/362384.362685 · Cited by 5,547
A relational model of data for large shared data banks
Codd, E. F. (1983) · Communications of the ACM · doi:10.1145/357980.358007 · Cited by 4,796
Data structures and accessing in data-base systems, I: Evolution of information systems
Senko, M. E., Altman, E. B., Astrahan, M. M., & Fehder, P. L. (1973) · IBM Systems Journal · doi:10.1147/sj.121.0030 · Cited by 171
Multi-attribute retrieval with combined indexes
Lum, V. Y. (1970) · Communications of the ACM · doi:10.1145/362790.362794 · Cited by 78
Treating hierarchical data structures in the SDC Time-Shared Data Management System (TDMS)
Bleier, R. E. (1967) · ACM National Conference · doi:10.1145/800196.805973 · Cited by 45
Cited by
Suffix Arrays: A New Method for On-Line String Searches
Manber, U., & Myers, G. (1993) · SIAM Journal on Computing · doi:10.1137/0222058 · Cited by 1,915
Inverted files for text search engines
Zobel, J., & Moffat, A. (2006) · ACM Computing Surveys · doi:10.1145/1132956.1132959 · Cited by 1,081
Inverted files versus signature files for text indexing
Zobel, J., Moffat, A., & Ramamohanarao, K. (1998) · ACM Transactions on Database Systems · doi:10.1145/296854.277632 · Cited by 341
Suffix arrays: a new method for on-line string searches
Manber, U., & Myers, E. W. (1990) · doi:10.5555/320176.320218 · Cited by 293
Metadata
- Authors
- Cárdenas, A. F.
- Venue
- Communications of the ACM
- Published
- 1975-05
- Volume
- 18
- Issue
- 5
- Pages
- 253-263
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W2123209274
- Cited by
- 306
- References
- 5
- FWCI
- 31.88
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.