BIT Numerical Mathematics

, Volume 30, Issue 3, pp 561–565 | Cite as

Performance evaluation of shared and separate inverted files

  • Elisabetta Grazzini
  • Fabio Pippolini
Scientific Notes
Received:
Revised:

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.

C.R. Categories

E.5 H.2.2 H.3.1 

Key Words and Phrases

Join inverted files algorithms performance evaluation 
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [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 (1980Google Scholar
  2. [2]
    T. J. Teorey, J. P. Frey:Design of Database Structures. Prentice-Hall Inc., Englewood Cliffs, N. J., (1982).Google Scholar
  3. [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. [4]
    M. Stonebraker et al.:The design and implementation of INGRES. ACM Trans. on Database Systems 1(3), 189–222 (1976).Google Scholar
  5. [5]
    P. Valduriez, H. Boral:Evaluation of recursive queries using join indexes. Proc. of Int. Conf. on Expert Database Systems, 197–208 (1986).Google Scholar
  6. [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. [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).Google Scholar
  8. [8]
    D. Tsichritzis:LSL: a link and selector language, Proc. of ACM/SIGMOD Int. Conf. on Management of Data, 123–133 (1976).Google Scholar
  9. [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).Google Scholar
  10. [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. [11]
    D. E. Knuth:The Art of Computer Programming: Sorting and Searching, Addison-Wesley, Reading, MA. (1973).Google Scholar
  12. [12]
    P. Valduriez:Join indices. ACM Trans. on Database Systems 12(2), 218–246 (1987).Google Scholar
  13. [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. [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).Google Scholar
  15. [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

Copyright information

© BIT Foundations 1990

Authors and Affiliations

  • Elisabetta Grazzini
    • 1
    • 2
  • Fabio Pippolini
    • 1
    • 2
  1. 1.Dipartimento di Sistemi e InformaticaUniversità di FirenzeFirenzeItaly
  2. 2.Istituto per le Applicazioni della Matematica e dell'Informatica C.N.R.FirenzeItaly

Personalised recommendations