Mammoths are Slow: The Overlooked Transactions of Graph Data
Article 2023 en
Authors
AC
Audrey Cheng
JW
Jack Waudby
HF
Hugo Firth
Abstract
1 min read
This paper argues for better concurrency control to support mammoth transactions , which read and write to many items. While these requests are prevalent on graph data, few systems support them efficiently. Currently, developers must make the uncomfortable choice between accepting dismal performance or abandoning transactional semantics. Applications deserve better: we believe that inherent graph properties provide a path forward to designing efficient concurrency control that preserves strong isolation.
Owen R. Jones, Jean‐Michel Gaillard, Shripad Tuljapurkar, Jussi Alho, Kenneth B. Armitage, Peter Becker, Pierre Bize, Jon E. Brommer, Anne Charmantier, Marie J. E. Charpentier, Tim Clutton-brock, F. Stephen Dobson, Marco Festa‐Bianchet, Lars Gustafsson, Henrik Jensen, Carl G. Jones, Bo‐Göran Lillandt, R. H. McCleery, Juha Merilä, Peter Neuhaus, Malcolm A. C. Nicoll, Ken Norris, Madan K. Oli, Josephine M. Pemberton, Hannu Pietiäinen, Thor Harald Ringsby, Alexandre Roulin, Bernt‐Erik Sæther, Joanna M. Setchell, Ben C. Sheldon, Paul M. Thompson, Henri Weimerskirch, E. Jean Wickings, Tim Coulson
Discussion(0)
No comments yet. Be the first to comment.