Databases
StackOverflow2013
Postsdbo
POData structure to work well with versioned string data?
 

Note that there are some explanatory texts on larger screens.

plurals
  1. POData structure to work well with versioned string data?
    primarykey
    data
    text
    <p>What are "versioned data structures" called correctly in CS? </p> <p>Is there some list of existing "versioned data structures" somewhere that I could go through, compare and choose from on my own? I have found only one paper for "Multiple Version Hash Table" (title <a href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.56.6833&amp;rep=rep1&amp;type=pdf" rel="nofollow">Hash Tables in Logic Programming</a>, from circa 1987) and that's all I could find. </p> <p>Sample data (requested in discussion below):</p> <pre><code>"a b" c "d e" { f { "g h" "i j" { "k l m" n "o p q" { r; } } } } "a b" x { y { "z z z"; } } "foo bar" baz; "foo baz" bar; </code></pre> <p>If multiple similar "trees" occur, then they will stay in place, like:</p> <pre><code>foo { bar; oof; bar { "a b c"; } bar; } </code></pre> <p>will never get sorted but always stay in the same order as written.</p> <p>Data will be "compiled" into binary form by some "commit/version" tool and "rolled back" back to text form or queried by another tools.</p> <p>To clarify more, let's see some usage examples in Unix shell:</p> <pre><code>sh&gt; $EDITOR file.txt File saved. sh&gt; commit file.txt # create/commit file.txt.db (we assume 9 commits before this one) Commited as version 10. sh&gt; show file.txt.db 'a b' # Trailing '*' is implicit "a b" c "d e" { f { "g h" "i j" { "k l m" n "o p q" { r; } } } } "a b" x { y { "z z z"; } } sh&gt; show file.txt.db 'a b' '*' y "a b" x { y { "z z z"; } } sh&gt; show file.txt.db 'foo *' "foo bar" baz; "foo baz" bar; sh&gt; show file.txt.db -rollback=2 'a b' # "historical" query, say that 'a b" c "d e" ...' was not there the time "a b" x { y { "z z z"; } } sh&gt; rollback file.txt.db 2 Rolled back to version 2. sh&gt; $EDITOR file.txt File saved. sh&gt; commit file.txt # new "branch" commit (because of the rollback above)! Commited as version 2.1. </code></pre> <p>Note: ALL history is always saved! Nothing is going to be erased (if not explicitely requested by some other tool or so).</p> <p>Etc. Perhaps some "log" or "journal" needed??</p>
    singulars
    1. PO
      singulars
      1. PTAnswer
    1. This table or related slice is empty.
    1. PTQuestion
    1. USmjf
    1. USmjf
    plurals
    1. PL
      singulars
      1. LTLinked
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. PO
      singulars
      1. PTAnswer
    1. VO
      singulars
      1. POData structure to work well with versioned string data?
      1. This table or related slice is empty.
      1. VTUpMod
    1. COA quick Google search yields this: http://arxiv.org/abs/1103.4282 and this: http://stackoverflow.com/questions/3024739/java-versioned-data-structures
      singulars
      1. POData structure to work well with versioned string data?
      1. USRobert Harvey
    2. COThere are actually multiple types of "versioned data structures". One might be having a binary ABI with backwards compatibility to older versions with different structures. Another would be a datastructure where you can see access older versions of memory. Knowing what you were trying to achieve would be helpful. Some problems might be best solved externally (eg change log) to the data structure.
      singulars
      1. POData structure to work well with versioned string data?
      1. USSeth Robertson
    3. COWell. I need to store and version tree-like data where any node is either a list of strings or a list of strings ending with a sub-tree, like this short example: `"a b" c "d e" { f { "g h" "i j" { "k l m" n "o p q" { r; } } } }; "a b" x { y { "z z z"; } }; etc.`. The point is it can also match from left one to each other, so I guess the task would best fit something like "multiversion trie" if something like that exists.
      singulars
      1. POData structure to work well with versioned string data?
      1. USmjf
 

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