Databases
StackOverflow2013
Postsdbo
PO
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    primarykey
    data
    text
    <p>I wrote a pair of gems, <a href="https://github.com/mezis/fuzzily" rel="noreferrer">fuzzily</a> and <a href="https://github.com/mezis/blurrily" rel="noreferrer">blurrily</a> which do trigrams-based fuzzy matching. Given your (low) volume of data Fuzzily will be easier to integrate and about as fast, in with either you'd get answers within 5-10ms on modern hardware.</p> <p>Given both are trigrams-based (which is indexable), not edit-distance-based (which isn't), you'd probably have to do this in two passes:</p> <ul> <li>first ask either gem for a set of best matches trigrams-wise</li> <li>then compare results with your input string, using Levenstein</li> <li>and return the min for that measure.</li> </ul> <p>In Ruby (as you asked), using Fuzzily + the <a href="https://github.com/threedaymonk/text" rel="noreferrer">Text gem</a>, obtaining the records withing the edit distance threshold would look like:</p> <pre><code>MyRecords.find_by_fuzzy_name(input_string).select { |result| Text::Levenshtein.distance(input_string, result.name)] &lt; my_distance_threshold } </code></pre> <p>This performas a handful of well optimized database queries and a few</p> <p>Caveats:</p> <ul> <li>if the "minimal" edit distance you're looking for is high, you'll still be doing lots of Levenshteins.</li> <li>using trigrams assumes your input text is latin text or close to (european languages basically).</li> <li>there probably are edge cases since nothing garantees that "number of matching trigrams" is a great general approximation to "edit distance".</li> </ul>
    singulars
    1. This table or related slice is empty.
    1. POFast fuzzy/approximate search in dictionary of strings in Ruby
      singulars
      1. PTQuestion
    1. PTAnswer
    1. This table or related slice is empty.
    1. USmezis
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. POFast fuzzy/approximate search in dictionary of strings in Ruby
      singulars
      1. PTQuestion
    1. This table or related slice is empty.
    1. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    2. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTAcceptedByOriginator
    3. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    1. COI'm currently doing exactly that with Blurrily so I have in memory indexes and using the levenshtein-ffi gem (C implementation - 4x faster that my own Ruby implementation) and I get request in the matter of 1-2ms on my data, where I was in the 50 - 200ms with my pure Ruby implementation. I am totally fine with the caveats so this is the perfect solution for me. Thanks a lot for those amazing gems!
      singulars
      1. PO
      1. USNicolas M.
    2. COYou're very welcome Nicolas. Do open Github issues if you spot any bugs, I do my best to keep them maintained!
      singulars
      1. PO
      1. USmezis
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload