Path lengths and TMQL
"Andrew S. Townley" <[email protected]>
| Newsgroups | gmane.text.xml.xtm.general |
|---|---|
| Message-ID | <[email protected]> |
Hi Folks,
I've been doing some reading on path languages, graph queries, etc. over the last few days and I was wondering why the notion of the path length wasn't included in any of the drafts I've seen. If you could qualify the depth of the search of the path expressions, it seems like our disagreement over how to reference "direct" vs "indirect" links of type X might disappear. It also might come in handy for other scenarios as well as this is orthogonal to the limit concept for query results themselves.
I don't know how you'd sensibly attach it to the path operators, but syntactically, it might be possible to borrow from the RegEx quantifier syntax, e.g. {n, m} to quantify the min and max depth of the subgraph to match.
Probably been already discussed before, and I just can't come up with the right google-fu to find it. Any pointers to historical discussions would be appreciated.
Cheers,
ast
P.S. For those interested, I'm looking at Leser's Pathway Query Language (PQL) from 2005 at the moment which is why this came up for me now.
--
Andrew S. Townley <[email protected]>
http://atownley.org