Research papers
High Quality, Scalable and Parallel Community Detection for Large Real Graphs. Arnau Prat-Pérez, David Dominguez-Sal, Josep-Lluis Larriba-Pey: WWW (2014)-
Recent Posts
Archives
Tag Archives: dex 3.0
DEX 3.0 features: large char objects
This is the last feature we are posting on the blog for DEX 3.0. This time we are taking a look at the types allowed by graph databases for its objects. String type only allows a maximum length of 2048 … Continue reading
Posted in DEX, Documentation
Tagged dex, dex 3.0, dex v.3.0, graph database, object, object type, sparsity-technologies, string, text
Comments Off on DEX 3.0 features: large char objects
DEX 3.0 features: Indexed or not indexed attributes
Fourth episode of the series about DEX features. DEX is all about performance, with this feature we are focusing on improving query performance. In the DEX graph every node and edge can have as many attributes as needed. Those attributes … Continue reading
Posted in DEX, Documentation
Tagged dex, dex 3.0, features, graph database, indexed attributes, performance, query
Comments Off on DEX 3.0 features: Indexed or not indexed attributes
DEX 3.0 features: Neighbors materialized
One common challenge when traversing a graph is to obtain the neighbors for a certain node. In previous versions of DEX it required a two-step operation; first obtaining the edges for the node and then its neighbors. Objects neighbors = … Continue reading
Posted in DEX, Documentation
Tagged dex, dex 3.0, features, graph database, materialized, neighbors, sparsity-technologies, traversals
Comments Off on DEX 3.0 features: Neighbors materialized
DEX 3.0 features: Regular Expressions
In the second delivery of this series we are going to see how DEX extends the capability to query the graph database using regular expressions. As in every database you can also query the entities in your graph database with … Continue reading
Posted in DEX, Documentation
Tagged dex, dex 3.0, features, graph database, posix, query, regular expressions
2 Comments
DEX 3.0 features: Graph algorithms
Starting today we are going to make a series of posts explaining the most exciting features of the last available version of DEX. We hope that these explanations will give you a hint on the powerful possibilities of DEX. If … Continue reading
Posted in DEX, Documentation
Tagged bfs, connectivity, dex, dex 3.0, dfs, Dijkstra, features, Gabow, graph algorithms, graph database, shortest path, traversals
7 Comments