Re: Search Algorithms

davidgt0@xxxxxxxxx <davidgt0@xxxxxxxxx> wrote:
I was wondering if anyone heard of a search algorithm that has the
search time almost constant regardless of the volume of data searched.

Does anyone know which is the fastest search algorithm that performs
well for very large volumes of data?

I'd say it depends on the data. If you have a bunch of keys (single
values of some data type) ordered by their value, there is always the
binary search algorithm.

However, I guess the data you are referring to does not meet these
requirements. In that case, you might want to see:
http://en.wikipedia.org/wiki/No_free_lunch_theorem

Whether you agree with the theorem or not, I'd still say the choice of
a search algorithm is strongly dependent on the data.

--
MJV ~ Eric S. Raymond & Rick Moen: "How to Ask Questions the Smart Way"
~ http://www.catb.org/~esr/faqs/smart-questions.html

[ comp.ai is moderated ... your article may take a while to appear. ]
.

Relevant Pages

  • Re: Search Algorithms
    ... search time almost constant regardless of the volume of data searched. ... Does anyone know which is the fastest search algorithm that performs ... Basically, if you can create indices of the possible search queries, ...
    (comp.ai)
  • Search Algorithms
    ... search time almost constant regardless of the volume of data searched. ... Does anyone know which is the fastest search algorithm that performs ...
    (comp.ai)