term indexing

Term indexing uses a data structure that enables sublinear-time lookups.

The term indexing language can seem rather daunting and has certainly had different meanings in its different incarnations.

In computer science, term indexing is the task of creating an index of terms and clauses in a collection.

Taube had split coordinate indexing into two categories, item and term indexing.

Controlled term indexing languages are claimed to be more consistent and therefore more efficient, but the many tests on indexing languages have failed to prove this convincingly.