Zobrazeno 1 - 10
of 55
pro vyhledávání: '"KETSMAN, BAS"'
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 a given set of transactions and a given allocation of isolation levels
Externí odkaz:
http://arxiv.org/abs/2403.17665
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 interesting yet impractical technique. However, in a time where the hypercentral
Externí odkaz:
http://arxiv.org/abs/2302.14411
The transactional robustness problem revolves around deciding whether, for a given workload, a lower isolation level than Serializable is sufficient to guarantee serializability. The paper presents a new characterization for robustness against isolat
Externí odkaz:
http://arxiv.org/abs/2302.08789
Publikováno v:
Logical Methods in Computer Science, Volume 19, Issue 4 (December 25, 2023) lmcs:10173
The popular isolation level Multiversion Read Committed (RC) trades some of the strong guarantees of serializability for increased transaction throughput. Sometimes, transaction workloads can be safely executed under RC obtaining serializability at t
Externí odkaz:
http://arxiv.org/abs/2201.05021
The isolation level Multiversion Read Committed (RC), offered by many database systems, is known to trade consistency for increased transaction throughput. Sometimes, transaction workloads can be safely executed under RC obtaining the perfect isolati
Externí odkaz:
http://arxiv.org/abs/2107.12239
Publikováno v:
Logical Methods in Computer Science, Volume 18, Issue 2 (May 5, 2022) lmcs:6944
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 achieves a load of $\tilde{O}(m/p^{1/\rho})$ where $m$ is the total siz
Externí odkaz:
http://arxiv.org/abs/2011.14482
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 a given distribution policy for the reshuffle is adequate for computi
Externí odkaz:
http://arxiv.org/abs/1512.06246
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 multiway join algorithms where data is first reshuffled over many servers
Externí odkaz:
http://arxiv.org/abs/1412.4030
Autor:
KETSMAN, BAS1, KOCH, CHRISTOPH2, NEVEN, FRANK3 frank.neven@uhasselt.be, VANDEVOORT, BRECHT3 brecht.vandevoort@uhasselt.be
Publikováno v:
ACM Transactions on Database Systems. Dec2022, Vol. 47 Issue 4, p1-41. 41p.
