Database engineer @StardogHQ. Graph query planning, optimisations, evaluation -- all that stuff. University of Manchester alum. Endurance cyclist. Immigrant.
Nov 11, 2021 • 9 tweets • 2 min read
i wonder how many people who know something about "usual" complexity stuff, eg big-O, common time/space compl. classes like P/NP or PSPACE, have heard about enumeration complexity, eg delays. Because it's extremely useful when it comes to query languages, esp. on graphs. 1/
massively simplifying, the "usual" complexity stuff is going to tell you how much time or memory your query engine may use (in worst case) for query/data of some size. Great, but not the whole story. 2/
