In my store I have (for purposes of discussion) one tuple S P O
and then some number of quadlets on it. I want to find out how many. However, to make matters more complex, what I'd really like to do is set up a construct query that finds S (p1|p2|p3|p4...) O and also then returns the count of quadlets for each of these it comes up with. Is this plausible .... ? Obviously, I can do it by first finding the statements and then going back and using the COUNT extension to do the counting. Is TDB particularly good or bad at this?
