33 citations · 67 across the 15 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.DB2018
On the expressive power of linear algebra on graphs
Floris Geerts
Most graph query languages are rooted in logic. By contrast, in this paper we consider graph query languages rooted in linear algebra. More specifically, we consider MATLANG, a mat…
cs.DB2018★ 2 cited
A General Framework for Anytime Approximation in Probabilistic Databases
Maarten Van den Heuvel, Floris Geerts, Wolfgang Gatterbauer +1
Anytime approximation algorithms that compute the probabilities of queries over probabilistic databases can be of great use to statistical learning tasks. Those approaches have bee…