Reducing vertices in property graphs.
Graph databases are constantly growing, and, at the same time, some of their data is the same or similar. Our experience with the management of the existing databases, especially the bigger ones, shows that certain vertices are particularly replicated there numerous times. Eliminating repetitive or...
Main Authors: | Dominik Tomaszuk, Karol Pąk |
---|---|
Format: | Article |
Language: | English |
Published: |
Public Library of Science (PLoS)
2018-01-01
|
Series: | PLoS ONE |
Online Access: | http://europepmc.org/articles/PMC5812617?pdf=render |
Similar Items
-
PGO: Describing Property Graphs in RDF
by: Dominik Tomaszuk, et al.
Published: (2020-01-01) -
Mapping RDF Databases to Property Graph Databases
by: Renzo Angles, et al.
Published: (2020-01-01) -
A Study on Metric Properties of Graphs: Hinge Vertices and Graph Powers
by: Ting-Yem Ho, et al.
Published: (2000) -
Reducing the maximum degree of a graph by deleting vertices: the extremal cases
by: Peter Borg, et al.
Published: (2018-10-01) -
Properties of Small Ordered Graphs Whose Vertices are Weighted by Their Degree
by: Blalock, Constance M
Published: (2014)