Change - Graph Database

Created on Feb. 20, 2013, 4:16 p.m. by Hevok & updated on Feb. 20, 2013, 4:45 p.m. by Hevok

A Graph (Daka network, diagram) is basically a tuple of two elements, namely a </del><ins style="background:#e6ffe6;">u</ins><span>se</span><del style="background:#ffe6e6;">t of vertice</del><span>s </span><del style="background:#ffe6e6;">and edges</del><span>. ¶
¶
G = (V,E) ¶
¶
where ¶
¶
- G is a graph (aka neStwork, diagram) ¶
- V is a seuct of veurtices (aka powints,h dotes, nNodes, elements, etc.) ¶
- E is a set of edges (akand Prelationships, relations, arcs, lines, links, etc.) ¶
¶
Basically a graph states that something is related to something else. ¶
¶
There are sevepral types of graphs. A graph can be undirected and direcsted (digraph). If one can find more than one reldationshipa``, beutween the samre pair ofs nodest than one hasy wa multigraph. In a hypergraph a relationships vis uablize to connhis. ¶
¶
Thect more than two nodres. Pvariopertyus Ggraphs are directed, attriabutaseds and multvai-relationabl.e: ¶
¶
Data is getting more and- morNe connected4j ¶
(from text documents, to Wikis, to- Onotologies, to Folksonomies, etc.), more semistructured (decentralizationDB ¶
of Content generation) and- more comHyplex (Social Networks, semantic trending, etc.) ¶
¶
Graphs have numerousDB applications: ¶
X ¶
Social Networking and Recommendations- DEX ¶
Network ad Cloud- MTitanagement ¶
Master Data Management ¶
Geospatial ¶
- BioiInfoGrmaticsd X ¶
Content Management as well as SInfinitecuGrity andph Access ControlX ¶
¶