Difference between a graph and a hypergraph database? -


is there difference between graph , hypergraph database?

is every hypergraph database system graph database system?

i asking side-by-side comparison. if possible show in 1 row:

graph support:       no/graph/hypergraph 

or if better use 2 rows:

graph support:       no/yes hypergraph suppport: no/yes 

or means "graph" , "hypergraph" same in database context?

how graph database handles edges implementation detail. hence answer cannot given in regards "[hyper]graph databases in general".

from point of mathematical graph theory there difference:

  • edges known standard graphs model (directed or undirected) 1:1 connections.
  • hyperedges known hypergraphs model (directed or undirected) n:n connections.

graph vs. hypergraph:

a simple graph can considered special case of hypergraph, namely 2-uniform hypergraph. however, when stated without qualification, edge assumed consist of @ 2 vertices, , graph never confused hypergraph. (source)

undirected hyperedges:

a[n] [undirected] hyperedge edge allowed take on any number of vertices, possibly more 2. graph allows hyperedge called hypergraph. (source)

directed hyperedges:

directed hypergraphs (ausiello et al., 1985; gallo et al., 1993) generalization of directed graphs (digraphs) , can model binary relations among subsets of given set. (source)


Comments

Popular posts from this blog

java - Play! framework 2.0: How to display multiple image? -

gmail - Is there any documentation for read-only access to the Google Contacts API? -

php - Controller/JToolBar not working in Joomla 2.5 -