Congratulations! Now the Neo4j team has reached a earned rest. Happy New Year!
On Thu, Dec 30, 2010 at 22:30, Tobias Ivarsson <tobias.ivars...@neotechnology.com> wrote: > Happy new year — happy new Neo4j version! > > The Neo4j team is happy to announce version 1.2 of the Neo4j graph database. > Building on the line of milestone releases of Neo4j, version 1.2 contains > only a few minor bug fixes over 1.2.M06, and should be very stable. The > official announcement has been posted here: > http://www.dzone.com/links/neo4j_12_final_prtporter.html > If you like this version, please vote for the article on DZone, and share > the link with your friends and colleagues. > > We would like to thank everyone on this mailing list, and all of our > customers, who provided the bug reports, feedback, suggestions and patches > that made this release what it is. You've already given us a lot of great > ideas for the road ahead, but keep them coming, let's make Neo4j even better > together! > > Your next stop, for downloading this version of Neo4j, is: > http://neo4j.org/download > > The main new features in Neo4j 1.2 compared to Neo4j 1.1 are: > > * The Neo4j Server > > The Neo4j standalone server builds upon the RESTful API that was > pre-released for Neo4j 1.1. The server provides a complete stand alone Neo4j > graph database experience, making it easy to access Neo4j from any > programming language or platform. Some of you have already provided great > client libraries for languages such as Python, Ruby, PHP, the .Net stack and > more. Links and further information about client libraries can be found at: > http://www.delicious.com/neo4j/drivers > > * Neo4j High Availability > > The High Availability feature of Neo4j provides an easy way to set up a > cluster of graph databases. This allows for read scalability and tolerates > faults in any of the participating machines. Writes are allowed to any > machine, but are synchronized with a slight delay across all of them. > > High Availability in Neo4j is still in quite an early stage of its evolution > and thus still have a few limitations. While it provides scalability for > read load, write operations are slightly slower. Adding new machines to a > cluster still requires some manual work, and very large transactions cannot > be transmitted across machines. These limitations will be addressed in the > next version of Neo4j. > > Some other noteworthy changes include: > > * Additional services for the Neo4j kernel can now be loaded during startup, > or injected into a running instance. Examples of such additional services > are the Neo4j shell server and the Neo4j management interface. > > * Memory footprint and read performance has been improved. > > * A new cache implementation has been added for high load, low latency > workloads. > > * A new index API has been added that is more tightly integrated with the > database. This new index API supports indexing relationships as well as > nodes, and also supports indexing and querying multiple properties for each > node or relationship. The old index API has been deprecated but remains > available and will continue to receive bug fixes for a while. > > * The Neo4j shell supports performing path algorithm queries. > > * Built in automatic feedback to improve future versions of Neo4j. See: > http://blog.neo4j.org/2010/10/announcing-neo4j-12m01-and-focus-on.html > > Last but not least all known issues have been fixed. If you want more > details, please read the change log and/or the announcements for the > previous milestone releases. > > Happy hacking, and a happy new year 2011! > - the Neo4j team, through > -- > Tobias Ivarsson <tobias.ivars...@neotechnology.com> > Hacker, Neo Technology > www.neotechnology.com > Cellphone: +46 706 534857 > _______________________________________________ > Neo4j mailing list > User@lists.neo4j.org > https://lists.neo4j.org/mailman/listinfo/user > -- Javier de la Rosa http://versae.es _______________________________________________ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user
