Hi, I wanted to ask a general question, and to know if Neo4j can help to solve it.
I have data that can be represented in a graph: 1. Objects of type A 2. Relations from A to A 3. Objects of type B 4. Relations from B to B 5. Relations from A to B Each table has between 20,000 and 50,000 records. Currently I'm using a DB and the queries run slow. I can hold redundant data to make specific queries run faster but before I do that I wanted to know if a graph db may help. I want to be able to do the following queries: 1. The first 50 joined results of A->B (including all A's and B's in the hierarchy), with paging ability (50 records at a time) 2. Give the same query as (1) but with a filter for A, or B or both 3. Give statistics for A's with the top number of B's (again it does not matter if A is related to B directly or through more A's and B's) If it is possible to do 1-3 then I guess the rest of my requirements will be covered. Can someone help, or give me a name of another tool? Thanks, Ori _______________________________________________ Neo4j mailing list [email protected] https://lists.neo4j.org/mailman/listinfo/user
