Databases
StackOverflow2013
Postsdbo
PO
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    primarykey
    data
    text
    <p>Here is raw Trie-like implementation. It is totally not optimized, just a proof of concept. Pure Ruby implementation.</p> <p>To test it I took 100_000 words from here <a href="http://www.infochimps.com/datasets/word-list-100000-official-crossword-words-excel-readable/downloads/195488" rel="nofollow">http://www.infochimps.com/datasets/word-list-100000-official-crossword-words-excel-readable/downloads/195488</a></p> <p>here is a gist for it <a href="https://gist.github.com/fl00r/7542994" rel="nofollow">https://gist.github.com/fl00r/7542994</a></p> <pre><code>class TrieDict attr_reader :dict def initialize @dict = {} end def put(str) d = nil str.chars.each do |c| d &amp;&amp; (d = (d[1][c] ||= [nil, {}])) || d = (@dict[c] ||= [nil, {}]) end d[0] = true end def fetch(prefix, fuzzy = 0) storage = [] str = "" error = 0 recur_fetch(prefix, fuzzy, @dict, storage, str, error) storage end def recur_fetch(prefix, fuzzy, dict, storage, str, error) dict.each do |k, vals| e = error if prefix[0] != k e += 1 next if e &gt; fuzzy end s = str + k storage &lt;&lt; s if vals[0] &amp;&amp; (prefix.size - 1) &lt;= (fuzzy - e) recur_fetch(prefix[1..-1] || "", fuzzy, vals[1], storage, s, e) end end end def bench t = Time.now.to_f res = nil 10.times{ res = yield } e = Time.now.to_f - t puts "Elapsed for 10 times: #{e}" puts "Result: #{res}" end trie = TrieDict.new File.read("/home/petr/code/tmp/words.txt").each_line do |word| trie.put(word.strip) end; :ok # Elapsed for 10 times: 0.0006465911865234375 # Result: ["hello"] bench{ trie.fetch "hello", 1 } # Elapsed for 10 times: 0.013643741607666016 # Result: ["cello", "hallo", "helio", "hell", "hello", "hellos", "hells", "hillo", "hollo", "hullo"] bench{ trie.fetch "hello", 2 } # Elapsed for 10 times: 0.08267641067504883 # Result: ["bell", "belle", "bellow", "bells", "belly", "cell", "cella", "celli", "cello", "cellos", "cells", "dell", "dells", "delly", "fell", "fella", "felloe", "fellow", "fells", "felly", "hall", "hallo", "halloa", "halloo", "hallos", "hallot", "hallow", "halls", "heal", "heals", "heel", "heels", "heil", "heils", "held", "helio", "helios", "helix", "hell", "helled", "heller", "hello", "helloed", "helloes", "hellos", "hells", "helm", "helms", "helot", "help", "helps", "helve", "herl", "herls", "hill", "hillo", "hilloa", "hillos", "hills", "hilly", "holla", "hollo", "holloa", "holloo", "hollos", "hollow", "holly", "hull", "hullo", "hulloa", "hullos", "hulls", "jell", "jells", "jelly", "mell", "mellow", "mells", "sell", "selle", "sells", "tell", "tells", "telly", "well", "wells", "yell", "yellow", "yells"] bench{ trie.fetch "engineer", 2 } # Elapsed for 10 times: 0.04654884338378906 # Result: ["engender", "engine", "engined", "engineer", "engineered", "engineers", "enginery", "engines"] bench{ trie.fetch "engeneer", 1 } # Elapsed for 10 times: 0.005484580993652344 # Result: ["engender", "engineer"] </code></pre>
    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. USfl00r
    1. USfl00r
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    1. COInteresting! Faster than my implementation. Would you mind explaining a bit your underlying data structure, especially what this crazy put method does?
      singulars
      1. PO
      1. USNicolas M.
    2. COUnderlying data structure is a kind of a [Trie](http://en.wikipedia.org/wiki/Trie). Put method is putting chars into nodes of their parents. And first item of node array (bool) is a flag that this is complete word (from top to this node)
      singulars
      1. PO
      1. USfl00r
    3. COIt could be rewritten as a gem with C extension for better performance (2-5x boost I believe)
      singulars
      1. PO
      1. USfl00r
 

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