On 23.12.2017 00:47, Andrew U. Frank wrote: > are there some rules which queries are linear in the amount of data in > the graph? is it correct to assume that searching for a triples based > on a single condition (?p a X) is logarithmic in the size of the data > collection? Why should it be logarithmic? The complexity of matching a single BGP depends on the implementation. I could search for matches by doing a scan on the whole dataset - that would for sure be not logarithmic but linear. Usually, if exists, a triple store would use the POS index in order to find bindings for variable ?p.
Cheers, Lorenz
