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

2010-04-09 Thread Michael Ludwig
-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 User@lists.neo4j.org https

Re: [Neo] Traversers in the REST API

2010-04-08 Thread Michael Ludwig
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] Date effectiveness (Time Variance) implementation in Neo4J

2010-04-08 Thread Michael Ludwig
-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] How to efficiently query in Neo4J?

2010-04-08 Thread Michael Ludwig
) 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 ipsis. So I'd say there is not much in the way of graphiness. -- Michael Ludwig

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

2010-04-08 Thread Michael Ludwig
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 ___ Neo mailing list User@lists.neo4j.org https

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

2010-04-08 Thread Michael Ludwig
, 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] Requirements for an event framework for Neo4j

2010-04-01 Thread Michael Ludwig
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 ___ Neo mailing list User@lists.neo4j.org https

Re: [Neo] XPath in REST API

2010-03-30 Thread Michael Ludwig
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] Traversers in the REST API

2010-03-30 Thread Michael Ludwig
matching template for a given node. Likewise in a graph traversal, wouldn't it be reasonable to only allow something with restricted expressive and imperative power, like the match patterns in XSLT? -- Michael Ludwig ___ Neo mailing list User

Re: [Neo] XPath in REST API

2010-03-30 Thread Michael Ludwig
)? -- 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
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 like that for graphs that you could (or do) base your graph query language on? Thanks! -- Michael Ludwig

Re: [Neo] XPath in REST API

2010-03-30 Thread Michael Ludwig
. Excuse my insolence, but couldn't you simplify by letting the user say: outE/V# bound to be an inV inE/V # bound to be an outV outE/outV # confusing way of saying (in XPath) self::node() inE/inV # ditto Best, -- Michael Ludwig