Re: [Neo] How to efficiently query in Neo4J?

2010-04-09 Thread Michael Ludwig
://intelligent-enterprise.informationweek.com/001020/celko.jhtml Note that this needs some custom logic for category tree updates. But it's not difficult in SQL, and I think it's not much more difficult in Neo4j either. -- Michael Ludwig ___ Neo mailing list Us

Re: [Neo] How to efficiently query in Neo4J?

2010-04-08 Thread Michael Ludwig
to > tackle very demanding and diverse application challenges! Yes, it's becoming very interesting. Lots of new high-level tools for specialized or relaxed requirements. SQL won't be dethroned, though. -- Michael Ludwig ___ Neo mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user

Re: [Neo] How to efficiently query in Neo4J?

2010-04-08 Thread Michael Ludwig
of both worlds. Exactly what I think. An iterable index, and a great one for the kind of graphy queries that cannot be done efficiently using sets and joins. Any thoughts on what constitutes *graphiness*, if I may venture this term? -- Michael Ludwig

Re: [Neo] How to efficiently query in Neo4J?

2010-04-08 Thread Michael Ludwig
tags is simply N-M, and that's it. There aren't any real links (edges) between posts, which arguably would make your data model more graphy. In your model, related posts are related by virtue of their attributes (they share some tags, or are posted by the same user), and not eis i

Re: [Neo] Date effectiveness (Time Variance) implementation in Neo4J

2010-04-08 Thread Michael Ludwig
we model the date in Neo4J? Heretical counter-question: Why model the date in Neo4J if any SQL database provides full-spectrum date-time functionality? -- Michael Ludwig ___ Neo mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user

Re: [Neo] Traversers in the REST API

2010-04-08 Thread Michael Ludwig
le waiting for the client to request the next page. If you ensure a binary tree index is used to do the sorting, you should be fine. -- Michael Ludwig ___ Neo mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user

Re: [Neo] is neo4j the correct tool to store trees?

2010-04-06 Thread Michael Ludwig
cking an XML/XQuery database, or an app server such as eXist. http://www.rpbourret.com/xml/ProdsNative.htm And does anyone know or of or can recommend non-XML tree databases with tree navigation and processing tools such as XPath, or maybe even XPath? -- Mi

Re: [Neo] Requirements for an event framework for Neo4j

2010-04-01 Thread Michael Ludwig
ACH > ROW EXECUTE someFunction() ) I think what you're referring to here is *triggers* (as common in SQL databases), which react on events, not dissimilar to what has been outlined by Tobias in the mail you're replying to. -- Michael Ludwig __

Re: [Neo] XPath in REST API

2010-03-30 Thread Michael Ludwig
which I know and hold in high esteem, has got me thinking. All in all I'm not sure how well XPath maps to a reasonable graph model you might come up with, but it's an interesting topic to think about. Best, -- Michael Ludwig ___ Neo mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user

Re: [Neo] XPath in REST API

2010-03-30 Thread Michael Ludwig
; (the tail of the > edge). inV means "the incoming vertex of the edge" (the head of the > edge). In Neo4j speak, its startNode and endNode, respectively. Excuse my insolence, but couldn't you simplify by letting the user say: outE/V# bound to be an inV inE/

Re: [Neo] XPath in REST API

2010-03-30 Thread Michael Ludwig
E, inE and bothE. Edges may have a direction (or two, or none - depending on the point of view), so in/out/both looks like the logical thing to do. But what about outV and inV? Vertices aren't directional, are they? -- Michael Ludwig ___ Neo mailing

Re: [Neo] XPath in REST API

2010-03-30 Thread Michael Ludwig
hat would be natural to a graph. I think it would have to be something on the data layer, or a meta attribute, so that you get sortable edges. XSLT and XQuery are built on the XDM (XPath Data Model), which is an abstraction of an XML document. In fact, it's an ordered tree. Is there something li

Re: [Neo] XPath in REST API

2010-03-30 Thread Michael Ludwig
edges specified to be unordered, such as attributes in XDM (XPath Data Model)? -- Michael Ludwig ___ Neo mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user

Re: [Neo] Traversers in the REST API

2010-03-30 Thread Michael Ludwig
ving the processor traverse the tree and the user define templates featuring a match pattern. For every node, the processor dispatches to the best matching template, from where you can control further processing. Now those match patterns are a subset of XPath, and rightly so: If the use

Re: [Neo] XPath in REST API

2010-03-30 Thread Michael Ludwig
ditional branching, loops and lots more. Also, XPath being for trees, do you constrain the graph to tree form? [1] http://www.xmlplease.com/axis -- Michael Ludwig ___ Neo mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user

Re: [Neo] Heresy

2010-02-17 Thread Michael Ludwig
her one: Hessian Binary Web Service Protocol http://hessian.caucho.com/ -- Michael Ludwig ___ Neo mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user