On the selection of the access path in inverted database organization

Abstract The query in inverted file organization can be expressed in the form of a Boolean expression, that states the data selection criterion. In response to a query the system accesses inverted lists, merges them and then accesses those records in the secondary storage, that satisfy the search logic. Because the stored inverted lists are selected by taking into consideration the file organization as a whole, it is not always advantageous to use all the stored inverted lists. The remaining conditions will be examined from the records that fulfil the conditions, which are examined using inverted lists, In this paper we present an optimization algorithm for the selection of the address lists that are worth using.