-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
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
-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
) 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
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
, 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
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
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
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
)?
--
Michael Ludwig
___
Neo mailing list
User@lists.neo4j.org
https://lists.neo4j.org/mailman/listinfo/user
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
.
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
12 matches
Mail list logo