3 citations · 8 across the 8 of their papers we have counts for
9 papers
Using Read Promotion and Mixed Isolation Levels for Performant Yet Serializable Execution of Transaction Programs
Brecht Vandevoort, Alan Fekete, Bas Ketsman +2
We propose a theory that can determine the lowest isolation level that can be allocated to each transaction program in an application in a mixed-isolation-level setting, to guarant…
When View- and Conflict-Robustness Coincide for Multiversion Concurrency Control
Brecht Vandevoort, Bas Ketsman, Frank Neven
A DBMS allows trading consistency for efficiency through the allocation of isolation levels that are strictly weaker than serializability. The robustness problem asks whether, for…
Distributed Subweb Specifications for Traversing the Web
Bart Bogaerts, Bas Ketsman, Younes Zeboudj +3
Link Traversal-based Query Processing (ltqp), in which a sparql query is evaluated over a web of documents rather than a single dataset, is often seen as a theoretically interestin…
Detecting Robustness against MVRC for Transaction Programs with Predicate Reads
Brecht Vandevoort, Bas Ketsman, Christoph Koch +1
The transactional robustness problem revolves around deciding whether, for a given workload, a lower isolation level than Serializable is sufficient to guarantee serializability. T…
Robustness against Read Committed for Transaction Templates with Functional Constraints
Brecht Vandevoort, Bas Ketsman, Christoph Koch +1
The popular isolation level Multiversion Read Committed (RC) trades some of the strong guarantees of serializability for increased transaction throughput. Sometimes, transaction wo…
Robustness against Read Committed for Transaction Templates
Brecht Vandevoort, Bas Ketsman, Christoph Koch +1
The isolation level Multiversion Read Committed (RC), offered by many database systems, is known to trade consistency for increased transaction throughput. Sometimes, transaction w…
A Near-Optimal Parallel Algorithm for Joining Binary Relations
Bas Ketsman, Dan Suciu, Yufei Tao
We present a constant-round algorithm in the massively parallel computation (MPC) model for evaluating a natural join where every input relation has two attributes. Our algorithm a…
Parallel-Correctness and Containment for Conjunctive Queries with Union and Negation
Gaetano Geck, Bas Ketsman, Frank Neven +1
Single-round multiway join algorithms first reshuffle data over many servers and then evaluate the query at hand in a parallel and communication-free way. A key question is whether…
Parallel-Correctness and Transferability for Conjunctive Queries
Tom J. Ameloot, Gaetano Geck, Bas Ketsman +2
A dominant cost for query evaluation in modern massively distributed systems is the number of communication rounds. For this reason, there is a growing interest in single-round mul…