Abstract
The inverted file has been generated essentially by using the chain organization with the length of each chain equal to one item. This increased the directory size to include, for each key, as many entries as there are items characterized by that key.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 1978 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(1978). 7. Record processing using inverted files. In: A Comparative Study of Very Large Data Bases. Lecture Notes in Computer Science, vol 59. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08653-6_15
Download citation
DOI: https://doi.org/10.1007/3-540-08653-6_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08653-6
Online ISBN: 978-3-540-35930-2
eBook Packages: Springer Book Archive