On search performance for conjunctive queries in compressed, fully transposed ordered files

  • Authors:
  • Per Svensson

  • Affiliations:
  • -

  • Venue:
  • VLDB '79 Proceedings of the fifth international conference on Very Large Data Bases - Volume 5
  • Year:
  • 1979

Quantified Score

Hi-index 0.00

Visualization

Abstract

A new file organization method, providing very high performance for a large class of associative queries. is abstractly defined. The organization may be viewed both as a development of the fully transposed file, and as a generalized trie. Its average search performance is modelled under some simplifying assumptions. Also, the model's predictions are compared with measurement results obtained from a prototype system, and a qualitative agreement is found. For purposes of comparison, analytical and measured cost curves for fully transposed file search are also given.