Skip to main content
Log in

Performance evaluation of shared and separate inverted files

  • Scientific Notes
  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

In this paper, two different structures for inverted files are analyzed and compared, when the relational join operation is taken into account. The structures are called shared and separate inverted files. The results are given of some experiments which show that the shared inverted organization is always advantageous when the inverted files are not sorted and is almost always advantageous when the files are sorted.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. W. Kim:A new way to compute the product and join of relations. Proc. of ACM/SIGMOD Int. Conf. on Management of Data, 179–187 (1980

  2. T. J. Teorey, J. P. Frey:Design of Database Structures. Prentice-Hall Inc., Englewood Cliffs, N. J., (1982).

    Google Scholar 

  3. M. M. Astrahan et al.:System R: A relational approach to database management. ACM Trans. on Database System 1(2), 97–137 (1976).

    Google Scholar 

  4. M. Stonebraker et al.:The design and implementation of INGRES. ACM Trans. on Database Systems 1(3), 189–222 (1976).

    Google Scholar 

  5. P. Valduriez, H. Boral:Evaluation of recursive queries using join indexes. Proc. of Int. Conf. on Expert Database Systems, 197–208 (1986).

  6. T. Haerder:Implementing a generalized access path structure for a relational database system. ACM Trans. on Database Systems 3(3), 285–298 (1978).

    Google Scholar 

  7. 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).

  8. D. Tsichritzis:LSL: a link and selector language, Proc. of ACM/SIGMOD Int. Conf. on Management of Data, 123–133 (1976).

  9. E. Grazzini, F. Pippolini:Shared vs separate inverted files. Foundations of data organization and algorithms; Proceedings of FODO'89, Paris, Lecture Notes in Computer Science n. 367, Springer-Verlag, 517–531 (1989).

  10. 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).

    Google Scholar 

  11. D. E. Knuth:The Art of Computer Programming: Sorting and Searching, Addison-Wesley, Reading, MA. (1973).

    Google Scholar 

  12. P. Valduriez:Join indices. ACM Trans. on Database Systems 12(2), 218–246 (1987).

    Google Scholar 

  13. L. D. Shapiro:Join processing in database system with large main memories. ACM Trans. on Database Systems 11(3), 239–264 (1986).

    Google Scholar 

  14. 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).

  15. P. Valduriez and G. Gardarin:Join and semijoin algorithms for a multiprocessor database machine. ACM Trans. on Database Systems 9(1), 133–161 (1984).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Grazzini, E., Pippolini, F. Performance evaluation of shared and separate inverted files. BIT 30, 561–565 (1990). https://doi.org/10.1007/BF01931668

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01931668

C.R. Categories

Key Words and Phrases

Navigation