태그: AgensBrowser

AgensGraph: graph sampling with random selection

In the previous post, we did make ag_labels() function by #plpgsql. In this time, we will make ag_sample() function that do sampling graph-data by limit N on an edge basis. Also this function has the optional parameter of whether using random-selection. PL/pgSQL is a loadable procedural language for the PostgreSQL database system. [ref] It adds ...

AgensBrowser – play Timeline

#PlayTimeline is a application function of “find neighbors” with Datetime property of graph. If a graph was propagated on the timeline, you could see with “play timeline” function of #AgensBrowser. The way of starting play is very simple. At first, you should select one property of label for the base of timeline data. That property must be ...

AgensBrowser – graph overlay

Targets of #GraphSearch would be elements (like nodes, edges) or path or sub-graph. The target of #GraphOverlay searching is a #subgraph that is matched to source graph with graph as a unit. This function works on searching full-matches by elements’ id and half-matches by same label and direction. It help you compare two graphs each other and find out related parts ...

AgensBrowser – search titles

The most basic function in #GraphVisualization tools is #GraphSearch. #AgensBrowser support various search functions like #SearchTitles, “search elements with any property value”, “search neighbors”, “search cycles”, etc. “Search titles” functions let you find fast what you want. Title is specified by “Label styles” setting. For example, if you select ‘country’ property to Title of customer label, you could see like that ...

AgensBrowser – find shortestPath

There are many paths on the graph, and finding the path of the lowest weight among them is called the #shortestPathSearch. #Path is a set of relations and means there are the dependency in the case of production lines. #AgensBrowser support #Dijkstra ‘s shortest path algorithm. (weight=# of edges) If you switch on toggle-button, shortest path algorithm work with direction of edges. ...

AgensBrowser – PL/Python editor

#AgensGraph is built on the base of #postgresql and take over the functions of postgresql extentions like PL/Python, PL/R, etc. Especially #PL_Python is powerful and used widly on Data-analysis domain. For examples, PL/Python functions parsed by postgresql can work the way you want it to data preprocessing, search algorithms, db-handling, so on. Also it could query by Cypher and modify ...

AgensBrowser – functions list

#AgensBrowser is a #graph_visualization tool and #GDB_client for #AgensGraph. AgensBrowser have many graph search-methods like ‘find title’, ‘find shortestpath’, ‘find cyclepath’, so on. These are not provided by AgensGraph, but are embed in AgensBrowser by Tinkerpop, cytoscape.js. What you did work by graph-analysis tools, as a graph-project you can save and load for re-use. Or you can export graphson files. Besides ...

AgensBrowser – graph filtering

As the previous post, “groupBy” and #filterBy are very fascinating functions in #AgensBrowser. #graph_filtering is used to find what you want to see and hide others. The way to select properties is same to that of #graph_grouping. And you should select operator and value for filtering. Operators of “filterBy” function can be worked to property data of “Numeric” and “String” type. ...

AgensBrowser – groupBy graph

#GraphGrouping is the most fancinating function in #AgensBrowser toolbar. The bigger the graph, the harder it is to understand. For that reason, you’d better that manipulate original data-graph to understandable level. When you click ‘#groupby-filterby’ button, Meta-graph is shown up and you can select some properties for groupBy. That works that gather data of graph by selected properties. For ...

AgensBrowser – Find connected-components

Real-world graph consist of so many #subgraphs. One subgraph is located off with others subgraphs, that have not any intersection. In this case, you’d better that remove out relation-less subgraphs. In #AgensBrowser, you can find connected components by graph #toolbar. “#findComponents” functions let result-graph to divide more subgraph and cover by square box with grey ...