neo4jr-social | self contained HTTP REST JSON interface | Graph Database library

by mdeiters Ruby Version: Current License: MIT

Download this library from

kandi X-RAY | neo4jr-social Summary

neo4jr-social is a Ruby library typically used in Database, Graph Database, Neo4j applications. neo4jr-social has no bugs, it has no vulnerabilities, it has a Permissive License and it has low support. You can download it from GitHub.

Neo4jr-Social is a self contained HTTP REST + JSON interface to the graph database Neo4j. Neo4jr-Social supports simple dynamic node creation, building relationships between nodes and also includes a few common social networking queries out of the box (i.e. linkedin degrees of seperation and facebook friend suggestion) with more to come. Think of Neo4jr-Social is to Neo4j like Solr is to Lucene.

Support

Quality

Security

License

Reuse

kandi-support Support

neo4jr-social has a low active ecosystem.
It has 167 star(s) with 17 fork(s). There are 6 watchers for this library.
It had no major release in the last 12 months.
There are 2 open issues and 2 have been closed. On average issues are closed in 113 days. There are no pull requests.
It has a neutral sentiment in the developer community.
The latest version of neo4jr-social is current.

neo4jr-social Support

Best in #Graph Database

Average in #Graph Database

neo4jr-social Support

Best in #Graph Database

Average in #Graph Database

quality kandi Quality

neo4jr-social has 0 bugs and 13 code smells.

neo4jr-social Quality

Best in #Graph Database

Average in #Graph Database

neo4jr-social Quality

Best in #Graph Database

Average in #Graph Database

security Security

neo4jr-social has no vulnerabilities reported, and its dependent libraries have no vulnerabilities reported.
neo4jr-social code analysis shows 0 unresolved vulnerabilities.
There are 0 security hotspots that need review.

neo4jr-social Security

Best in #Graph Database

Average in #Graph Database

neo4jr-social Security

Best in #Graph Database

Average in #Graph Database

license License

neo4jr-social is licensed under the MIT License. This license is Permissive.
Permissive licenses have the least restrictions, and you can use them in most projects.

neo4jr-social License

Best in #Graph Database

Average in #Graph Database

neo4jr-social License

Best in #Graph Database

Average in #Graph Database

build Reuse

neo4jr-social releases are not available. You will need to build from source code and install.
neo4jr-social saves you 346 person hours of effort in developing the same functionality from scratch.
It has 828 lines of code, 36 functions and 15 files.
It has high code complexity. Code complexity directly impacts maintainability of the code.

neo4jr-social Reuse

Best in #Graph Database

Average in #Graph Database

neo4jr-social Reuse

Best in #Graph Database

Average in #Graph Database

Top functions reviewed by kandi - BETA

kandi has reviewed neo4jr-social and discovered the below as its top functions. This is intended to give you an instant insight into neo4jr-social implemented functionality, and help decide if they suit your requirements.

Describe the info about the info .
Returns the required parameter
Define an optional parameter
generate a path
Converts a hash to a hash .
params template id
The parameter number of the request parameters .
Retrieves the direction of the query .

neo4jr-social Key Features

neo4jr-social Examples and Code Snippets

No Code Snippets are available at this moment for neo4jr-social.

See all Code Snippets related to Graph Database

Community Discussions

Trending Discussions on Graph Database

Can I create a knowledge graph in Memgraph?
Using a graph database to store and retrieve sorted users by personality scores
idiomatic way to atomically create a table that as a record that is associated to other tables
Gremlin query language - how to limit/filter path or start from specific verticle in chain?
SQL Graph Database VS Cosmos Gremlin graph DB
AWS Neptune performance / Comparing to Neo4j AuraDB
@Async method inside synchronized method Java
NEO4J find records that not exist in other pattern result
Check if Neighbors have subset of connected nodes
Cytoscape Integration with Neo4j

Trending Discussions on Graph Database

QUESTION

Can I create a knowledge graph in Memgraph?

Asked 2022-Mar-28 at 11:17

I know that knowledge graphs are represented in RDF, but I am wondering whether Memgraph as a graph database can store this kind of data?

ANSWER

Answered 2022-Mar-28 at 11:17

While Memgraph is not an RDF store, it is capable of handling this kind of data with the labeled property graph model (LPG). LPG is represented by a set of nodes, relationships, properties (key-value attributes) and labels. RDF statements can be directly treated as nodes, relationships and properties of the graph, which are explored using the Cypher query language. Therefore, both RDF and LPG allow the creation of a knowledge graph.

Source https://stackoverflow.com/questions/71644714

QUESTION

idiomatic way to atomically create a table that as a record that is associated to other tables

Asked 2022-Feb-23 at 17:11

I am coming from graph databases and postgres is still super foreign to me.

I have the following tables

CREATE TYPE runnerenum AS ENUM ('runner');

CREATE TABLE IF NOT EXISTS collections (
  collectionid UUID PRIMARY KEY,
  name VARCHAR(256) UNIQUE NOT NULL,
  runner runnerenum NOT NULL,
  runconfig JSONB 
);

CREATE TABLE IF NOT EXISTS namedexprs(
  namedexprid UUID PRIMARY KEY,
  name VARCHAR(256) UNIQUE NOT NULL,
  -- exprid UUID NOT NULL REFERENCES expressions(exprid),
  collectionid UUID NOT NULL REFERENCES collections(collectionid) ON DELETE CASCADE
);

CREATE TABLE IF NOT EXISTS expressions(
  exprid UUID PRIMARY KEY,
  ast JSONB NOT NULL,
  namedexprid UUID NOT NULL REFERENCES namedexprs(namedexprid) ON DELETE CASCADE
);

My question is what is the idiomatic way to create a collections atomically (while also creating associated expressions and namedexprs). Currently I am executing three separate queries and getting errors because of a foreign key violation.

ANSWER

Answered 2022-Feb-23 at 17:11

Example of using DEFERRABLE:

CREATE TABLE parent_tbl (
    parent_id integer PRIMARY KEY,
    parent_val varchar UNIQUE
);


CREATE TABLE child_tbl (
    child_id integer PRIMARY KEY,
    parent_fk varchar REFERENCES parent_tbl (parent_val) 
        ON DELETE CASCADE DEFERRABLE INITIALLY DEFERRED,
    child_val varchar
);



\d child_tbl
                    Table "public.child_tbl"
  Column   |       Type        | Collation | Nullable | Default 
-----------+-------------------+-----------+----------+---------
 child_id  | integer           |           | not null | 
 parent_fk | character varying |           |          | 
 child_val | character varying |           |          | 
Indexes:
    "child_tbl_pkey" PRIMARY KEY, btree (child_id)
Foreign-key constraints:
    "child_tbl_parent_fk_fkey" FOREIGN KEY (parent_fk) REFERENCES parent_tbl(parent_val) ON DELETE CASCADE DEFERRABLE INITIALLY DEFERRED

BEGIN;
INSERT INTO child_tbl VALUES (1, 'dog', 'cat');

SELECT * FROM child_tbl ;
 child_id | parent_fk | child_val 
----------+-----------+-----------
        1 | dog       | cat
(1 row)

SELECT * FROM parent_tbl ;
 parent_id | parent_val 
-----------+------------
(0 rows)

INSERT INTO parent_tbl VALUES (1, 'dog');

SELECT * FROM parent_tbl ;
 parent_id | parent_val 
-----------+------------
         1 | dog

COMMIT;

The key to using DEFERRABLE is that the individual data entry statements need to be bundled into the same transaction, the BEGIN;/COMMIT;. This allows DEFERRABLE INITIALLY DEFERRED to work as the constraint check is deferred until the end of the transaction. For more ways you can manipulate this see SET CONSTRAINTS.

Source https://stackoverflow.com/questions/71228385

QUESTION

Gremlin query language - how to limit/filter path or start from specific verticle in chain?

Asked 2022-Feb-12 at 21:05

I am new to the graph databases and Gremlin. What I am trying to achieve is to ask a simple question to the database. Provided id of the Entity and id of the File, I want to find all other entites who have access to this file via the Share and return the result with the property "type" of the share. Here is the graph itself:

What I tried:

g.V("Enity:1").out("Created").hasLabel("Share").where(out("Shared").hasId("File:1")).in("Access").path()

This returns me:

[
  {
    //Omitted empty aray
    "objects": [
      {
        "id": "dseg:/Entity/1",
        "label": "Entity",
        "type": "vertex",
        "properties": {}
      },
      {
        "id": "dseg:/Share/1",
        "label": "Share",
        "type": "vertex",
        "properties": {}
      },
      {
        "id": "dseg:/Entity/1",
        "label": "Entity",
        "type": "vertex",
        "properties": {}
      }
    ]
  },
  {
    //Omitted empty aray
    "objects": [
      {
        "id": "dseg:/Entity/1",
        "label": "Entity",
        "type": "vertex",
        "properties": {}
      },
      {
        "id": "dseg:/Share/1",
        "label": "Share",
        "type": "vertex",
        "properties": {}
      },
      {
        "id": "dseg:/Entity/3",
        "label": "Entity",
        "type": "vertex",
        "properties": {}
      }
    ]
  }
]

It shows the path taken from the entry point(Entity:1) to the target(s) Entity 2 and 3

My question with technical details: Is there a way to start gathering path() after Entity:1 or intermediate verticle I chose, so that in result I will get only Share + Entity who has Access to it?

ANSWER

Answered 2022-Feb-12 at 21:05

You just need to tell path step where to start from. You can do something like this:

gremlin> g.V("entity:1").
......1>   out("Created").
......2>   hasLabel("Share").
......3>   where(out("Shared").hasId("File:1")).as('a').
......4>   in("Access").
......5>   path().from('a').by('Type').by()
==>[RO,v[entity:2]]
==>[RO,v[entity:3]]

Another way to do this is :

gremlin> g.V().
......1>   hasLabel('Share').
......2>   where(out('Shared').hasId('File:1')).
......3>   where(__.in('Created').hasId('entity:1')).
......4>   in('Access').
......5>   path().by('Type').by()
==>[RO,v[entity:2]]
==>[RO,v[entity:3]]

Source https://stackoverflow.com/questions/71092176

QUESTION

AWS Neptune performance / Comparing to Neo4j AuraDB

Asked 2022-Feb-01 at 14:30

We use Neo4j AuraDB for our graph database but there we have issues with data upload. So, we decided to move to AWS Neptune using the migration tool.

We have 3.7M nodes and 11.2M relations in our database. The DB instance is db.r5.large with 2 CPUs and 16GiB RAM.

The same AWS Neptune OpenCypher queries are much slower than AuraDB Cypher queries (about 7-10 times slower). Also, we tried to rewrite the queries to Gremlin and test performance but it is still very slow. We have node and lookup indexes on AuraDB but we can't create them on AWS Neptune as it handles them automatically.

Is there any way to reach better performance on AWS Neptune?

UPDATE:

Example of Gremlin query: g.V().hasLabel('Member').has('address', eq('${address}')).outE('HAS').as('member_has').inV().as('token').hasLabel('Token').inE('HAS').as('other_member_has').outV().as('other_member').hasLabel('Member').where(__.select('member_has').where(neq('other_member_has'))).select('other_member', 'token').group().by(__.select('other_member').local(__.properties().group().by(__.key()).by(__.map(__.value())))).by(__.fold().project('member', 'number_of_tokens').by(__.unfold().select('other_member').choose(neq('cypher.null'), __.local(__.properties().group().by(__.key()).by(__.map(__.value()))))).by(__.unfold().select('token').count())).unfold().select(values).order().by(__.select('number_of_tokens'), desc).limit(20)

Example of Cypher query: MATCH (member:Member { address: '${address}' })-[:HAS]->(token:Token)<-[:HAS]-(other_member:Member) RETURN PROPERTIES(other_member) as member, COUNT(token) AS number_of_tokens ORDER BY number_of_tokens DESC LIMIT 20

ANSWER

Answered 2022-Feb-01 at 14:30

As discussed in the comments, as of this moment, the openCypher support is a preview, not quite GA level. The more recent engine versions do have some significant improvements but more are yet to be delivered. As to the Gremlin query, tools that convert Cypher to Gremlin tend to build quite complex queries. I think the Gremlin equivalent to the Cypher query is going to look something like this.

g.V().has('Member','address', address).as('m').
      out('HAS').hasLabel('Token').as('t').
      in('HAS').hasLabel('Member').as('om').
      where(neq('m')).
      group().
        by('om').
        by(select('t').count()).
      order(local).
        by(values,desc).
      limit(20)

and if you want all of the properties just add a valueMap as in:

g.V().has('Member','address', address).as('m').
      out('HAS').hasLabel('Token').as('t').
      in('HAS').hasLabel('Member').as('om').
      where(neq('m')).
      group().
        by(select('om').valueMap(true)).
        by(select('t').count()).
      order(local).
        by(values,desc).
      limit(20)

Source https://stackoverflow.com/questions/70880522

QUESTION

@Async method inside synchronized method Java

Asked 2022-Jan-26 at 12:47

To summarize the problem, I am trying to call some method which is annotated with @async in a synchronized method. Reason for using @async was because I wish to return the response of the post method (to reduce waiting time on client’s side) and continue doing some post processing work (resetting certain properties). However, as the POST method involve altering a graph database, I declare the method with synchronized keyword to prevent altering of the graph database while another computation is going on. The result of this seem to be that two threads are entering the synchronized method, which shouldn’t be occurring?

@RestController
public class Controller {

@PostMapping(path = “/compute”)
public synchronized String compute() {

System.out.println(“===== > In thread: “ + Thread.currentThread().getName());

System.out.print(“===== > Doing some work in compute”);

ResetService.reset()
Return(“===== > done computing”)
}


@Service
public class ResetService {@Async public void reset (){

System.out.println(“===== > resetting in thread: “ + Thread.currentThread().getName());
#(resetting some properties in neo4j graph database)
resetMethod();
System.out.print(“===== > Done Resetting”);
}

This will give me an output similar to something like this:

===== > In Thread: http-nio-10080-exec-2

===== > Doing some work in compute

===== > done computing

=====> Resetting in Thread: Async-1

===== > In Thread: http-nio-10080-exec-3

===== > Doing some work in compute

===== > Done Resetting

My understanding of Synchronized method is that it only allows a single thread to enter the method at any time. But it seems like there are two threads running the Synchronized compute method at the same time. I tried to come up with some reasons for this and the two main ones I could think of are:

Due to different instances of the Controller class, however I recalled reading somewhere that a RESTController is a singleton scope by default, so it shouldn’t be due to this?
Context switching? Does synchronized method allow for context switching from one thread to another?

I apologise if any part of my question is confusing as I am relatively new to Java Spring/Spring Boot especially the concept of concurrency, multithreading etc. Please do let me know if you need me to clarify any part of my question.

ANSWER

Answered 2022-Jan-26 at 12:45

When you call the asynchronous method reset() within the synchronized method compute() the latter method will not wait for reset() to finish. Instead it will spawn a new thread that handles the code execution of reset() and then immediately proceeds to the next line Return(“===== > done computing”). After that the method will complete. When it completes a new thread will be allowed to call compute(), even when the reset() call of the previous thread that entered compute() is still running in the separate thread.

So to be more clear, The method compute() is not entered by two threads simultaneously. It only looks that way because part of the text prints from thread http-nio-10080-exec-3 come before the Done Resetting print of thread Async-1. So your code is working as intended.

Source https://stackoverflow.com/questions/70863401

QUESTION

Check if Neighbors have subset of connected nodes

Asked 2022-Jan-13 at 18:57

I currently have a Neo4J Graph Database that stores 4 different kind of nodes that are connected via edges. Yellow/Red nodes that are connected to blue nodes and the yellow/red nodes have green nodes connected that give additional info on them.

What I want to do is to check if the selected node(either yellow or red) has a neighbor that is connected via the blue node, has a subset of common connected green nodes.

For example if I select the lower red node the upper red node would be returned as they both share the same far left green node neighbor which is a subset of the green node neighbors of the selected red node.

Example Graph Structure

I currently have the following Cypher query, where the table nodes are the yellow and red nodes and the keyNode are the green nodes. The blue node is the objectType.

MATCH(table:TABLE)
where table.Name = $name
MATCH (table)-[keyRel:IS_DEFINED_BY_KEY]->(keyNode)
MATCH (table)<-[createRel:IS_CREATED_IN]-(objectType)-[createRel2:IS_CREATED_IN]->(createTables)
MATCH (createTables)-[keyRel2:IS_DEFINED_BY_KEY]->(addKey)

So at the end of the current query I have the searched/selected table, its neighboring green nodes, the yellow/red nodes that are connected via the blue node and the green nodes that are connected to them.

With that I now want to only return the connected yellow/red nodes that are connected to a subset of green nodes. So in the example only the upper red node.

Has anybody an idea how I can achieve this?

ANSWER

Answered 2022-Jan-13 at 18:57

I think I have found a solution.

I thought it the other way around. So instead of searching via the blue node that is connected to both my nodes I went via the green node.

The green neighbors of the other nodes can only be a subset of the selected nodes green neighbors if all of the other nodes neighbors are also connected to the selected node. You can find the used cypher query below. The interesting part where the subset is tested is:

Match (table) WHERE NOT ALL(t2key in t2keys WHERE (table)-[:IS_DEFINED_BY_KEY]->(t2key)).

MATCH(table:TABLE)
where table.Name = $name
Match (table)<-[:IS_CREATED_IN]-(objectType)

WITH Distinct table, objectType

MATCH (table)-[:IS_DEFINED_BY_KEY]->(keyNode)

MATCH (keyNode)<-[:IS_DEFINED_BY_KEY]-(T2:RECORDTABLE)
WHERE (T2.Neo4JId)<>(table.Neo4JId) and Exists ((objectType)-[:IS_CREATED_IN]->(T2))

MATCH (T2)-[:IS_DEFINED_BY_KEY]->(T2Key)

WITH table, collect(T2Key) as t2keys

// RETURN DISTINCT table, t2keys
Match (table)
WHERE NOT ALL(t2key in t2keys WHERE (table)-[:IS_DEFINED_BY_KEY]->(t2key))

Return table

Source https://stackoverflow.com/questions/70668998

Community Discussions, Code Snippets contain sources that include Stack Exchange Network

Vulnerabilities

No vulnerabilities reported

Install neo4jr-social

You can download it from GitHub.
On a UNIX-like operating system, using your system’s package manager is easiest. However, the packaged Ruby version may not be the newest one. There is also an installer for Windows. Managers help you to switch between multiple Ruby versions on your system. Installers can be used to install a specific or multiple Ruby versions. Please refer ruby-lang.org for more information.

Support

For any new features, suggestions and bugs create an issue on GitHub. If you have any questions check and ask questions on community page Stack Overflow .