1 citations · 1 across the 5 of their papers we have counts for
6 papers
Numerical Stability of Linear Algebra Operations over Relational Databases
Andrei Draghici, Yuchen He, Dan Olteanu
A large body of work in the database literature develops efficient algorithms for linear algebra and machine learning over matrices defined by relational joins, yet the numerical s…
The Role of Semirings in Incremental View Maintenance
Eden Chmielewski, Andrei Draghici, Dan Olteanu +1
We study the problem of incremental view maintenance (IVM) under inserts to semiring-annotated databases. The key observation put forward in this paper is that the complexity of th…
Maintaining Queries under Updates Using Heavy-Light Partitioning of the Input Relations
Mahmoud Abo-Khamis, Eden Chmielewski, Andrei Draghici +2
We study the classical incremental view maintenance problem: Given a query and a database, maintain the query output under single-tuple updates (inserts or deletes) to the database…
Reachability in Fixed VASS: Expressiveness and Lower Bounds
Andrei Draghici, Christoph Haase, Andrew Ryzhikov
The recent years have seen remarkable progress in establishing the complexity of the reachability problem for vector addition systems with states (VASS), equivalently known as Petr…
Semënov Arithmetic, Affine VASS, and String Constraints
Andrei Draghici, Christoph Haase, Florin Manea
We study extensions of Semënov arithmetic, the first-order theory of the structure . It is well-knonw that this theory becomes undecidable when extended with…
On the Complexity of Inductively Learning Guarded Rules
Andrei Draghici, Georg Gottlob, Matthias Lanzinger
We investigate the computational complexity of mining guarded clauses from clausal datasets through the framework of inductive logic programming (ILP). We show that learning guarde…