Databases
StackOverflow2013
Postsdbo
PO
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    primarykey
    data
    text
    <p>You could create your own code without having to rely on a D3 layout in order to get it done.</p> <p>I've provided an <a href="http://jsfiddle.net/plaliberte/6vCFg/" rel="noreferrer">example in a jsFiddle</a>. The example is pretty simplistic and would need to be worked a little bit to accommodate more complex examples. </p> <p>The example could be re-worked to process hierarchical data as well with relatively little effort.</p> <p>Here is the code I have used in the jsFiddle:</p> <pre><code> // Sample data set var json = { nodes: [{ name: 'A'}, { name: 'B'}, { name: 'C'}, { name: 'D'}], links: [{ source: 'A', target: 'B'}, { source: 'A', target: 'C'}, { source: 'B', target: 'D'}, { source: 'C', target: 'D'} ] }; var vis = d3.select('#vis').attr('transform', 'translate(20, 20)'); // Build initial link elements - Build first so they are under the nodes var links = vis.selectAll('line.link').data(json.links); links.enter().append('line').attr('class', 'link').attr('stroke', '#000'); // Build initial node elements var nodes = vis.selectAll('g.node').data(json.nodes); nodes.enter().append('g').attr('class', 'node').append('circle').attr('r', 10).append('title').text(function(d) { return d.name; }); // Store nodes in a hash by name var nodesByName = {}; nodes.each(function(d) { nodesByName[d.name] = d; }); // Convert link references to objects links.each(function(link) { link.source = nodesByName[link.source]; link.target = nodesByName[link.target]; if (!link.source.links) { link.source.links = []; } link.source.links.push(link.target); if (!link.target.links) { link.target.links = []; } link.target.links.push(link.source); }); // Compute positions based on distance from root var setPosition = function(node, i, depth) { if (!depth) { depth = 0; } if (!node.x) { node.x = (i + 1) * 40; node.y = (depth + 1) * 40; if (depth &lt;= 1) { node.links.each(function(d, i2) { setPosition(d, i2, depth + 1); }); } } }; nodes.each(setPosition); // Update inserted elements with computed positions nodes.attr('transform', function(d) { return 'translate(' + d.x + ', ' + d.y + ')'; }); links.attr('x1', function(d) { return d.source.x; }).attr('y1', function(d) { return d.source.y; }).attr('x2', function(d) { return d.target.x; }).attr('y2', function(d) { return d.target.y; }); </code></pre>
    singulars
    1. This table or related slice is empty.
    1. POHow to layout a non-tree hierarchy with D3
      singulars
      1. PTQuestion
    1. PTAnswer
    1. This table or related slice is empty.
    1. USPhil Laliberte
    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
    2. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    1. COThanks for the example, Phil! I ended up doing something very similar. It turns out the layout algorithm I really wanted was implemented in GraphViz. It has python bindings, but they don't work. Instead I did the following: 1) Form graph into DOT language (http://www.graphviz.org/content/dot-language) 2) Pass graph to graphviz's dot command via commandline, which does the layout and puts (x,y) coordinates into DOT 3) Reformat DOT into javascript objects, embed into page 4) Use D3 to place nodes according to (x,y) coordinates in DOT. This works really well with very large graphs.
      singulars
      1. PO
      1. USJohn Walthour
 

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