HEURISTICAL FILE TYPE SEARCH
A search based on heuristics of certain file types.

INTENTIONSAL DEFINITION

Search in places where people end up the most when searching in a certain
context.

EXTENSIONAL DEFINITION

When searching a database, the result happens to be in the second to fifth parts
of the file. This could be explained because people are looking for
recent-but-not-too-recent and older information.

When searching a book, the result happens to be in the middle because that's
where memorable events occur.

When searching in a document, the result happens to be in a random place.

When searching code the result happens to be from the first quarter to the near
end, because that's where a lot of logic code is declared.

I think that paints the picture of what I'm trying to explain.

Using a heuristical search in combination with a linear search, we can obtain
progressive search patterns. As the linear search fills in the gaps, the
progressive search can fill in parts that are heuristically known to have
answers. This should be faster than most O(log n) because it becomes a O(n / m)
where m is the probability.