Abstract
In this paper, two different structures for inverted files are analyzed and compared. The structures are called shared and separate inverted files. In the shared inverted file, the access keys can handle all the information usually handled by two separate inverted files. The results are given of some experiments which compare the shared structure with the separate one when the relational equi-join operation is executed. Moreover an evaluation is made of the memory space required by the shared and separate structures when a given application is taken into account.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
W. Kim: “A New Way to Compute the Product and Join of Relations”. Proceedings of ACM/SIGMOD Int. Conf. on Management of Data, 179–187 (1980).
T.J. Teorey, J.P. Frey: “Design of Database Structures”. Prentice-Hall Inc., Englewood Cliffs, N.J., (1982).
M.M. Astrahan et al.: “System R: A Relational Approach to Database Management”. ACM Trans. on Database Systems 1(2), 97–137 (1976).
M. Stonebraker et al.: “The Design and Implementation of INGRES”. ACM Trans. on Database Systems 1(3), 189–222 (1976).
P. Valduriez, H. Boral: “Evaluation of Recursive Queries Using Join Indexes”. Proc. of Int. Conf. on Expert Database Systems, 197–208 (1986).
T. Haerder: “Implementing a Generalized Access Path Structure for a Relational Database System”. ACM Trans. on Database Systems 3(3), 285–298 (1978).
M. Jarke, J. Schmidt: “Query Processing Strategies in the PASCAL/R Relational Database Management System”. Proc. of ACM/SIGMOD Int. Conf. on Management of Data, (1982).
D. Tsichritzis: “LSL: a Link and Selector Language.” Proc. of ACM/SIGMOD Int. Conf. on Management of Data, 123–133 (1976).
E. Grazzini, R. Pinzani, F. Pippolini: “A Physical Structure for Efficient Processing of Relational Queries”. Foundations of Data Organization, Plenum Press, New York, N.J., 501–514 (1987).
D. Bitton, H. Boral, D.J. DeWitt: “Parallel Algorithms for the Execution of Relational Database Operations”. ACM Trans. on Database Systems 8(3), 324–353 (1983).
D.E. Knuth: “The Art of Computer Programming: Sorting and Searching”. Addison-Wesley, Reading, Ma. (1973).
P. Valduriez: “Join Indices”. ACM Trans. on Database Systems 12(2), 218–246 (1987).
L.D. Shapiro: “Join Processing in Database Systems with Large Main Memories”. ACM Trans. on Database Systems 11(3), 239–264 (1986).
D.J. DeWitt et al.: “Implementation Techniques for Main Memory Database Systems”. Proc. of ACM/SIGMOD Int. Conf. on Management of Data, 1–9 (1984).
P. Valduriez and G. Gardarin: “Join and Semijoin Algorithms for a Multiprocessor Database Machine”. ACM Trans. on Database Systems 9(1), 133–161 (1984).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Grazzini, E., Pippolini, F. (1989). Shared vs separate inverted files. In: Litwin, W., Schek, HJ. (eds) Foundations of Data Organization and Algorithms. FODO 1989. Lecture Notes in Computer Science, vol 367. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51295-0_152
Download citation
DOI: https://doi.org/10.1007/3-540-51295-0_152
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51295-0
Online ISBN: 978-3-540-46186-9
eBook Packages: Springer Book Archive