Re: [Neo4j] [Neo] Newbie question
Thomas, sure, the smallest starting graph is probably a viable approach initially. If things get big, you can always add Lucene indexes as you go, and search in them to get a smaller initial set of nodes. HTH Cheers, /peter neubauer COO and Sales, Neo Technology GTalk: neubauer.peter Skype peter.neubauer Phone +46 704 106975 LinkedIn http://www.linkedin.com/in/neubauer Twitter http://twitter.com/peterneubauer http://www.neo4j.org - Your high performance graph database. http://www.thoughtmade.com - Scandinavia's coolest Bring-a-Thing party. On Tue, May 25, 2010 at 3:39 PM, Thomas Sant'ana wrote: > 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 > ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user
Re: [Neo4j] [Neo] Newbie question
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
Re: [Neo4j] [Neo] Newbie question
> How can I get all the 2000 - 2001, Silver, SAAB? > This is a query based on multiple properties and I think there are three options for this: - Identify limited property and traverse on that, testing for the others in the traversal. I think this is what Peter was suggesting. So, for example, if we feel that selecting the age will limit the result set the most, traverse down the age tree to the cars in the correct ages, and for all cars found test if they have relations back to the 'silver' and 'saab' nodes. - Make a lucene index on the combinations of properties you are likely to search for. Essentially you are creating a composite key, like '2000-silver-saab', for each car and indexing that in lucene. This can make it slightly tricky to deal with ranges, but integer ranges like 2000-2001 are simply two queries, so not too bad. Adding new properties to the cars requires creating new keys for those cars also. - Create composite index nodes for all unique combinations you are likely to search for. So instead of ref-->colors->silver-->carA and ref-->make-->saab-->carA, you would have ref-->colors-makes-->silver-saab-->carA. Since you are likely to have many 'Silver SAAB's, this is still a decent index tree. If, however, the complete combination of properties becomes too diverse (so the index nodes are as plentify as the car nodes), this becomes less efficient. For your example, it looks good. This last option is my personal favourite (as you can see be searching the mailing lists :-) ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user
Re: [Neo4j] [Neo] Newbie question
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? Cheers, /peter neubauer COO and Sales, Neo Technology GTalk: neubauer.peter Skype peter.neubauer Phone +46 704 106975 LinkedIn http://www.linkedin.com/in/neubauer Twitter http://twitter.com/peterneubauer http://www.neo4j.org - Your high performance graph database. http://www.thoughtmade.com - Scandinavia's coolest Bring-a-Thing party. On Mon, May 24, 2010 at 11:18 PM, Thomas Sant'ana wrote: >> 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 have made the basic structure in http://gist.github.com/411699 . >> Now, the question is about how best to optimize set operations between >> the different criteria. You could start at the year_2000 node (finding >> it with an index lookup for the year 2000, to be added to the code) as >> I did and iterate through all car nodes, and return everything that >> has a COLOR connection to the Silver node, and a MANUFACTURER >> connection to SAAB. However, having multiple years, you even could add >> an index on top of e.g. the year nodes in order to be able to >> effectively select multiple years. Do you have some more info on the >> dataset sizes of your domain so I can flesh the GIST out a bit with >> your search? >> >> > I'm still looking at the information. I used the car example to make it > simple do describe. My dataset should be small, should be some 5000 car like > objects, and some 25000 related objects. I want to use relations so object > like color, make, year etc to decorate the base objects. One reason for this > is that I can incrementally decorate the objects as I release versions of my > software. > > Thomas > ___ > Neo mailing list > User@lists.neo4j.org > https://lists.neo4j.org/mailman/listinfo/user > ___ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user
Re: [Neo] Newbie question
> 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 have made the basic structure in http://gist.github.com/411699 . > Now, the question is about how best to optimize set operations between > the different criteria. You could start at the year_2000 node (finding > it with an index lookup for the year 2000, to be added to the code) as > I did and iterate through all car nodes, and return everything that > has a COLOR connection to the Silver node, and a MANUFACTURER > connection to SAAB. However, having multiple years, you even could add > an index on top of e.g. the year nodes in order to be able to > effectively select multiple years. Do you have some more info on the > dataset sizes of your domain so I can flesh the GIST out a bit with > your search? > > I'm still looking at the information. I used the car example to make it simple do describe. My dataset should be small, should be some 5000 car like objects, and some 25000 related objects. I want to use relations so object like color, make, year etc to decorate the base objects. One reason for this is that I can incrementally decorate the objects as I release versions of my software. Thomas ___ Neo mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user
Re: [Neo] Newbie question
2010/5/24 Peter Neubauer : > Thomas, > sorry for taking so long to answer. Welcome to Neo4j! > > On Fri, May 21, 2010 at 10:37 PM, Thomas Sant'ana wrote: >> 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? > In this case, one approach would be to go along the KNOWS > relationships of Neo (probably later in several hops) and check if > there is an outgoing LOVES relationship back to Neo, something like > http://gist.github.com/411695 (where Trinity doesn't know Neo so we go > 2 KNOWS hops deep. > > >> >> 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. > Not really, since there are no global measures stored per se and > almost all data is loaded lazy. However, if you want that, you could > store the number of relationships when you operate on that node in an > index (e.g. Lucene). Who useful that is regarding update performance > and keeping things in sync depends on your usecase. Or you could store that number on the node directly, which to me seems like a better place. > >> >> 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 have made the basic structure in http://gist.github.com/411699 . > Now, the question is about how best to optimize set operations between > the different criteria. You could start at the year_2000 node (finding > it with an index lookup for the year 2000, to be added to the code) as > I did and iterate through all car nodes, and return everything that > has a COLOR connection to the Silver node, and a MANUFACTURER > connection to SAAB. However, having multiple years, you even could add > an index on top of e.g. the year nodes in order to be able to > effectively select multiple years. Do you have some more info on the > dataset sizes of your domain so I can flesh the GIST out a bit with > your search? > > /peter > ___ > Neo mailing list > User@lists.neo4j.org > https://lists.neo4j.org/mailman/listinfo/user > -- Mattias Persson, [matt...@neotechnology.com] Hacker, Neo Technology www.neotechnology.com ___ Neo mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user
Re: [Neo] Newbie question
Thomas, sorry for taking so long to answer. Welcome to Neo4j! On Fri, May 21, 2010 at 10:37 PM, Thomas Sant'ana wrote: > 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? In this case, one approach would be to go along the KNOWS relationships of Neo (probably later in several hops) and check if there is an outgoing LOVES relationship back to Neo, something like http://gist.github.com/411695 (where Trinity doesn't know Neo so we go 2 KNOWS hops deep. > > 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. Not really, since there are no global measures stored per se and almost all data is loaded lazy. However, if you want that, you could store the number of relationships when you operate on that node in an index (e.g. Lucene). Who useful that is regarding update performance and keeping things in sync depends on your usecase. > > 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 have made the basic structure in http://gist.github.com/411699 . Now, the question is about how best to optimize set operations between the different criteria. You could start at the year_2000 node (finding it with an index lookup for the year 2000, to be added to the code) as I did and iterate through all car nodes, and return everything that has a COLOR connection to the Silver node, and a MANUFACTURER connection to SAAB. However, having multiple years, you even could add an index on top of e.g. the year nodes in order to be able to effectively select multiple years. Do you have some more info on the dataset sizes of your domain so I can flesh the GIST out a bit with your search? /peter ___ Neo mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user
[Neo] Newbie question
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
Re: [Neo] newbie question regarding compatibility with other Java network analysis libraries
Hi Larry! Larry White wrote: > Hi, > Sorry if this has been asked and re-asked, but i couldn't find a convenient > way to search the archives. Here's searchable archives: http://www.mail-archive.com/user@lists.neo4j.org/info.html /anders ___ Neo mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user
Re: [Neo] newbie question regarding compatibility with other Java network analysis libraries
Larry,
via Gremlin, there is an adapter to e.g. use Jung with Neo4j, see
http://wiki.github.com/tinkerpop/gremlin/working-with-jung-algorithms
. The main problem is that every graph algo package has its own graph
model and needs an adapter - in this case the multi-labeled graph has
to be morphed into a unlabeled graph that Jung can work with.You can
even try it out directly on http://try.neo4j.org:
$_g := neo4j:open('/db')
g:load('http://github.com/tinkerpop/gremlin/raw/master/data/graph-example-1.xml')
jung:pagerank()
Which will use the Jung version of pagerank.
Let us know if this is interesting to you, and I can help you get going!
Cheers,
/peter neubauer
COO and Sales, Neo Technology
GTalk: neubauer.peter
Skype peter.neubauer
Phone +46 704 106975
LinkedIn http://www.linkedin.com/in/neubauer
Twitter http://twitter.com/peterneubauer
http://www.neo4j.org - Your high performance graph database.
http://nosqleu.org- The biggest NOSQL event. Ever.
http://www.thoughtmade.com - Scandinavias coolest Bring-a-Thing party.
On Tue, Apr 13, 2010 at 4:28 AM, Larry White wrote:
> Hi,
> Sorry if this has been asked and re-asked, but i couldn't find a convenient
> way to search the archives. I have a couple questions but I'll ask them
> separately.
>
> Is the db's model of networks compatible with any of the java open source
> network analysis and visualization libraries - or would I have to transform
> the network in order to do any visualization, etc. I know there's an
> analysis package that comes with the db, but some of the other open source
> tools seem especially powerful.
> ___
> Neo mailing list
> User@lists.neo4j.org
> https://lists.neo4j.org/mailman/listinfo/user
>
___
Neo mailing list
User@lists.neo4j.org
https://lists.neo4j.org/mailman/listinfo/user
Re: [Neo] newbie question regarding compatibility with other Java network analysis libraries
Hi, As I know, Neo4j is an efficient "Graph Storage". So visualization, analysis algorithms,... have to be implemented (some of them are already exist) separately and they are not related to the core component of Neo4j. Regards, Amir --- On Mon, 4/12/10, Larry White wrote: From: Larry White Subject: [Neo] newbie question regarding compatibility with other Java network analysis libraries To: user@lists.neo4j.org Date: Monday, April 12, 2010, 10:28 PM Hi, Sorry if this has been asked and re-asked, but i couldn't find a convenient way to search the archives. I have a couple questions but I'll ask them separately. Is the db's model of networks compatible with any of the java open source network analysis and visualization libraries - or would I have to transform the network in order to do any visualization, etc. I know there's an analysis package that comes with the db, but some of the other open source tools seem especially powerful. ___ Neo mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user ___ Neo mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user
[Neo] newbie question regarding compatibility with other Java network analysis libraries
Hi, Sorry if this has been asked and re-asked, but i couldn't find a convenient way to search the archives. I have a couple questions but I'll ask them separately. Is the db's model of networks compatible with any of the java open source network analysis and visualization libraries - or would I have to transform the network in order to do any visualization, etc. I know there's an analysis package that comes with the db, but some of the other open source tools seem especially powerful. ___ Neo mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user
Re: [Neo] Newbie question: remote access
Nishith, using Rails, Neo4j is supporting that nicely, see http://github.com/andreasronge/neo4j/tree/42280d991fb73cfb11e61eb52c035a46616a2e20 , and we have some code pulling out and inserting stuff from MySQL into Neo4j via ActiveRecord that will be put onto GIThub very soon. >From PHP, there are different scenarios of which we know of some working ok, see http://wiki.neo4j.org/content/PHP . We don't running example code on such an integration (yet) and would love to get a contribution in that area - the core team are PHP n00bs :) Of course either the JRuby REST bridge (example http://github.com/andreasronge/neo4j/blob/42280d991fb73cfb11e61eb52c035a46616a2e20/examples/rest/example.rb) or the soon-to-be-awesome Java REST bindings at https://svn.neo4j.org/laboratory/components/rest/ are always a good start if you are keeping big traversals on the Neo4j side of things. Otherwise, REST might get to chatty for good performance. Let us know if you have any questions. Would LOVE to get some feedback from other people using PHP with Neo4j! Cheers, /peter neubauer COO and Sales, Neo Technology GTalk: neubauer.peter Skype peter.neubauer Phone +46 704 106975 LinkedIn http://www.linkedin.com/in/neubauer Twitter http://twitter.com/peterneubauer http://www.neo4j.org - Your high performance graph database. http://www.tinkerpop.com - Processing for Internet-scale graphs. http://www.thoughtmade.com - Scandinavias coolest Bring-a-Thing party. On Wed, Feb 17, 2010 at 2:59 PM, Nishith Shah wrote: > Hi, > > In our setup, we would have application servers (Rails/PHP), a server > running MySQL, and a server running neo4j. I'm wondering how would > the application (on server A) talk to neo4j (on server B)? Is Rest API > the only way to work in such a scenario? > > Any pointers, links would be helpful. > > Thanks, > Nishith > ___ > Neo mailing list > User@lists.neo4j.org > https://lists.neo4j.org/mailman/listinfo/user > ___ Neo mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user
[Neo] Newbie question: remote access
Hi, In our setup, we would have application servers (Rails/PHP), a server running MySQL, and a server running neo4j. I'm wondering how would the application (on server A) talk to neo4j (on server B)? Is Rest API the only way to work in such a scenario? Any pointers, links would be helpful. Thanks, Nishith ___ Neo mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user
Re: [Neo] Newbie question: PHP bindings?
Hi, On Sun, Jul 12, 2009 at 23:10, Jjj Bbb wrote: > PHP bindings? > > Anybody working on that? Not that I know of. I know of some instances where people are connecting to a Neo4j-based backend from PHP frontends. In those cases, they've either used REST or Thrift to connect to the service. Important to note here, tho, is that the frontends have connected to the backend service, not directly to Neo4j per se. > > Anybody using neo4j from PHP using home-cooked connections? I'm completely Clueless(tm) when it comes to PHP so I don't really know what you mean with home-cooked connections. Feel free to educate me! Cheers, -- Emil Eifrém, CEO [e...@neotechnology.com] Neo Technology, www.neotechnology.com Cell: +46 733 462 271 | US: 206 403 8808 http://twitter.com/emileifrem ___ Neo mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user
[Neo] Newbie question: PHP bindings?
PHP bindings? Anybody working on that? Anybody using neo4j from PHP using home-cooked connections? Thx ___ Neo mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user
Re: [Neo] Newbie Question - Possible FAQ Addition?
On Tue, May 5, 2009 at 11:11 PM, Ivan Lazarte wrote: > So I know I'm just missing something very basic here, but lets say I have 3 > nodes representing users. The users have first name, last name, and email > properties. Now say I have 2 million users. > How do I efficiently implement findUserByEmail ? By creating an index that maps email to nodes. You will need to use the index-util component for this: http://components.neo4j.org/index-util/ I wrote a response to the very same question less than two hours ago: http://lists.neo4j.org/pipermail/user/2009-May/001166.html So I guess we _really_ need to improve our FAQ on the aspect of indexes. Thank you Ivan for bringing this to our attention. Cheers, -- Tobias Ivarsson Hacker, Neo Technology www.neotechnology.com Cellphone: +46 706 534857 ___ Neo mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user
[Neo] Newbie Question - Possible FAQ Addition?
So I know I'm just missing something very basic here, but lets say I have 3 nodes representing users. The users have first name, last name, and email properties. Now say I have 2 million users. How do I efficiently implement findUserByEmail ? The question which it answers first is really: How do I get 1 node from the node space based on a property? Thanks in advance! Looking forward to using this project. Ivan ___ Neo mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user
Re: [Neo] newbie question
Tetsu, 2008/6/6 <[EMAIL PROTECTED]>: > And I'd appreciate it if you can offer me some benchmark on any one working > platform. Well, there are benchmarks available for the standard Neo4j implementation, IMHO they actually should be published somewhere so people can get an impression on what Neo4j can do. Until then I think this could be provided to you directly, but that is not on an embedded Java platform, we can take that discussion off list as it involves some more work ... /peter -- GTalk: neubauer.peter Skype peter.neubauer ICQ 18762544 GTalk neubauer.peter Phone +46704 106975 LinkedIn http://www.linkedin.com/in/neubauer http://www.neo4j.org - New Energy for Data - the Graph Database. http://www.ops4j.org - New Energy for OSS Communities - Open Participation Software. http://www.qi4j.org - New Energy for Java - Domain Driven Development. ___ Neo mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user
Re: [Neo] newbie question
Hi Peter, Thanks for your answer. Yes, our project is base on OSGi Platform profile, just as you said. And I'd appreciate it if you can offer me some benchmark on any one working platform. Not have to be OSGi environment. Tetsu "Peter Neubauer" 送信者:cc user-bounc [EMAIL PROTECTED] 件名 eo4j.org Re: [Neo] newbie question 2008/06/06 13:38 Neo user discussion s <[EMAIL PROTECTED] s.neo4j.or g> へ 返信してく ださい Hi Tetsu, Neo4j requires at least a Java 1.4 runtime, and a Java 5 development environment. We have tested it with Android which it runs fine on since Neo4j does not use runtime annotations and thus can be compiled down to Java 1.4 compliant class fies. However, CDC1.01 (sounds like you are thinking OSGi Platform profile) does not support generics and would require adaptation in that respect. Neo4j is probably very well suited even for embedded devices but we have not really focused on an embedded edition as of now. If there is demand, please feel free to contact us and we can see if we can pull that off. That said, CDC is better than CLDC (we have written a CLDC implementation of Neo4j) so it should certainly be possible, and I for one have a couple of compelling scenarios where Neo in small nodes would form extremely interesting distributed data structures and information fabrics. Do not heistate to contact us off list if you are interested, since we simply did not have time to get around to this. /peter On Fri, Jun 6, 2008 at 3:16 AM, <[EMAIL PROTECTED]> wrote: > Hello, > > I am seeking quick answers for the following question. > > 1. About the runtime environment for neo4j. Is it possible to run one > CDC1.01? > > 2. How about the performance? Is there any benchmark and profiling? > > Background: > I am working on a embedded project which running on CDC1.01, with upper to > 8MB heap. > Right now we are using Hsqldb CDC port version. Our database is relatively > small, which only support 1000 data. > Every data has max size about 350 bytes. > We had considered about Db4o, but it is hard to use and defeated by hsqldb > on performance. > > Thanks in advance, and > Best regards, > > Tetsu > > ___ > Neo mailing list > User@lists.neo4j.org > https://lists.neo4j.org/mailman/listinfo/user > > -- GTalk: neubauer.peter Skype peter.neubauer ICQ 18762544 GTalk neubauer.peter Phone +46704 106975 LinkedIn http://www.linkedin.com/in/neubauer http://www.neo4j.org - New Energy for Data - the Graph Database. http://www.ops4j.org - New Energy for OSS Communities - Open Participation Software. http://www.qi4j.org - New Energy for Java - Domain Driven Development. ___ Neo mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user ___ Neo mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user
Re: [Neo] newbie question
Hi Tetsu, Neo4j requires at least a Java 1.4 runtime, and a Java 5 development environment. We have tested it with Android which it runs fine on since Neo4j does not use runtime annotations and thus can be compiled down to Java 1.4 compliant class fies. However, CDC1.01 (sounds like you are thinking OSGi Platform profile) does not support generics and would require adaptation in that respect. Neo4j is probably very well suited even for embedded devices but we have not really focused on an embedded edition as of now. If there is demand, please feel free to contact us and we can see if we can pull that off. That said, CDC is better than CLDC (we have written a CLDC implementation of Neo4j) so it should certainly be possible, and I for one have a couple of compelling scenarios where Neo in small nodes would form extremely interesting distributed data structures and information fabrics. Do not heistate to contact us off list if you are interested, since we simply did not have time to get around to this. /peter On Fri, Jun 6, 2008 at 3:16 AM, <[EMAIL PROTECTED]> wrote: > Hello, > > I am seeking quick answers for the following question. > > 1. About the runtime environment for neo4j. Is it possible to run one > CDC1.01? > > 2. How about the performance? Is there any benchmark and profiling? > > Background: > I am working on a embedded project which running on CDC1.01, with upper to > 8MB heap. > Right now we are using Hsqldb CDC port version. Our database is relatively > small, which only support 1000 data. > Every data has max size about 350 bytes. > We had considered about Db4o, but it is hard to use and defeated by hsqldb > on performance. > > Thanks in advance, and > Best regards, > > Tetsu > > ___ > Neo mailing list > User@lists.neo4j.org > https://lists.neo4j.org/mailman/listinfo/user > > -- GTalk: neubauer.peter Skype peter.neubauer ICQ 18762544 GTalk neubauer.peter Phone +46704 106975 LinkedIn http://www.linkedin.com/in/neubauer http://www.neo4j.org - New Energy for Data - the Graph Database. http://www.ops4j.org - New Energy for OSS Communities - Open Participation Software. http://www.qi4j.org - New Energy for Java - Domain Driven Development. ___ Neo mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user
[Neo] newbie question
Hello, I am seeking quick answers for the following question. 1. About the runtime environment for neo4j. Is it possible to run one CDC1.01? 2. How about the performance? Is there any benchmark and profiling? Background: I am working on a embedded project which running on CDC1.01, with upper to 8MB heap. Right now we are using Hsqldb CDC port version. Our database is relatively small, which only support 1000 data. Every data has max size about 350 bytes. We had considered about Db4o, but it is hard to use and defeated by hsqldb on performance. Thanks in advance, and Best regards, Tetsu ___ Neo mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user
