Re: [Neo4j] Compacting files?

2010-06-02 Thread Thomas Sant'ana
On Wed, Jun 2, 2010 at 9:30 AM, Johan Svensson jo...@neotechnology.comwrote:

 Alex,

 You are correct about the holes in the store file and I would
 suggest you export the data and then re-import it again. Neo4j is not
 optimized for the use case were more data is removed than added over
 time.


I like Postgres Auto Vaccum feature. I think if neo Reuses the holes it's
already nice. Some kind of compression and truncate of the files would be
great. In my opinion.

Just my 2 cents,

 Thomas
___
Neo4j mailing list
User@lists.neo4j.org
https://lists.neo4j.org/mailman/listinfo/user


Re: [Neo4j] [Neo] Newbie question

2010-05-25 Thread Thomas Sant'ana
On Tue, May 25, 2010 at 6:00 AM, Peter Neubauer 
peter.neuba...@neotechnology.com wrote:

 Thomas,
 if your dataset is that small, you could just start at any point, e.g.
 iterating over all cars, and looking at every car node if it is
 connected to the right nodes (only shown with the year node). I
 updated the GIST at http://gist.github.com/411699 to reflect this.
 This is a very crude example, but given your amount of data, you could
 either start at the cars, or from e.g. a color or year node, that you
 could find using Lucene(not included in this example, I am connecting
 nodes to the reference node instead).


Does that help?


Sure does.

I know I have little objects to traverse, but I was more currious on how to
handle on a larger set of object. What has made me consider Neo is the
seamless way to enrich my data-set with new relations as I progress. My idea
is to add relations to represent aspects of the objects that can be searched
for. For example: one day I create a crawler that will update notes do map
the model number to some feature (say the number of doors the car has). Then
I can extend my UI to allow users to search for that criteria too (in an
ad-hoc manner).

In such a case adding lucene indexes may not be that easy. If the graph has
huge, maybe it would make since to start traversal from the nodes that will
yield the smallest starting graph.

Thomas
___
Neo4j mailing list
User@lists.neo4j.org
https://lists.neo4j.org/mailman/listinfo/user


[Neo] Newbie question

2010-05-21 Thread Thomas Sant'ana
I started looking into Neo4J and it has some interesting ideas. I have been
brainstorming on how to use it in a project I have. And have come up with
some questions:

1)  In the Matrix example (I saw it in several videos), what whould be the
proper way to query: All people that Neo knows and love him?' In this case
it's a single hops, so I think the way is to iterate through all love
relations and see if the come back to Neo. But if we have more hops would we
need to have a traversal in a traversal?

2) Is there a simple way to know how many edges/relation of a certain type
come out of a node? I figure I can iterate throw the relations, but I was
thinking of using this to choose the cheapest starting node for a traversal.

3) Let say I have a Car graph, with:

ReferenceNode (RN) -- Cars
RN ---  Manufactures -- Ford / GM/ SAAB/ Volvo etc.
RN ---  Colors --- Grey, Silver, 
RN --- MakeYear --- 2000, 2001, 2002

A given car has a relaction to a Manufactures, Color, and Make year:

Cars --- aCar
aCar -- Silver
aCar --- 2000
aCar --- SAAB

How can I get all the 2000 - 2001, Silver, SAAB?

I know I could have year as a property, but I want this is just an example
to understand how to model similar problems.


Thanks for any tips,

Thomas
___
Neo mailing list
User@lists.neo4j.org
https://lists.neo4j.org/mailman/listinfo/user