Given a finite set of texts S = { w 1, … , w k } over some fixed finite alphabet Σ, a complete inverted file for S is an abstract data type that provides the functions find ( w ), which returns the longest prefix of w that occurs (as a subword of a word) in S ; freq ( w ), which returns the number of times w occurs in S ; and locations ( w ), which returns the set of positions where w occurs in S . A data structure that implements a complete inverted file for S that occupies linear space and can be built in linear time, using the uniform-cost RAM model, is given. Using this data structure, the time for each of the above query functions is optimal. To accomplish this, techniques from the theory of finite automata and the work on suffix trees are used to build a deterministic finite automaton that recognizes the set of all subwords of the set S . This automaton is then annotated with additional information and compacted to facilitate the desired query functions. The result is a data structure that is smaller and more flexible than the suffix tree.

Given a finite set of texts S = {ω1, ..., ωk} over some fixed finite alphabet Σ, a complete inverted file for S is an abstract data type that provides the functions find(ω), which returns the longest prefix of ω which occurs in S; freq(ω), which returns the number of times ω occurs in S; and locations(ω) which returns the set of positions at which ω occurs. We give a data structure to implement a complete inverted file for S which occupies linear space and can be built in linear time, using the uniform cost RAM model. Using this data structure, the time for each of the above query functions is optimal. To accomplish this, we use techniques from the theory of finite automata to build a deterministic finite automaton which recognizes the set of all sub words of the set S. This automaton is then annotated with additional information and compacted to facilitate the desired query functions.