1 citations · 2 across the 3 of their papers we have counts for
4 papers · 1 filter
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…
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…