News for hackers. Stuff that matters.
Re:Taxonomy Is Hard by zozbot234 on Tuesday November 01, 2022 @09:35AM (#33421013)
I think what you're describing is database query, not search. Heuristic search is going to be non-exhaustive by definition.

Desktop-focused databases are of course widely available (Paradox, Access, LibreOffice Base etc.) but the volume of data you could manage with them is of course limited. I.e. non-toy datasets will naturally be hosted on some sort of "cloud".

Re:Taxonomy Is Hard by TeMPOraL on Tuesday November 01, 2022 @09:43AM (#33421135)
> I think what you're describing is database query, not search.

What's the difference?

> Heuristic search is going to be non-exhaustive by definition.

To me, a non-exhaustive search is broken by design, because it will miss results. Making data accessible only through such search means there will be a hole in the system into which some of the data falls, never to be seen again.

Re:Taxonomy Is Hard by PaulHoule on Tuesday November 01, 2022 @10:10AM (#33421462)
Elasticsearch in particular can do the kind of queries most people expect from a database, see

https://www.elastic.co/kibana/

At work we have a search interface powered by Postgres that uses the full text index but also uses GIN indexes on arrays to index things based on categories/tags.

Re:Taxonomy Is Hard by yencabulator on Wednesday November 02, 2022 @08:43PM (#33445105)
That argument is much more convincing in the "open world" of internet searches, where enumerating all results is simply not going to happen.

In the scenario where you're searching for a file in a group of low-hundreds of files, it's nothing but a bad cop-out excuse.