EDBT 2026 Demo / reviewers in the wild / expert
Matthew Renzelmann
dblp:21/709
· DBLP profile ↗
5ranked-venue papers
0as first author
0since 2021 · last 2020
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 2Human-computer interaction and ubiquitous computing · 2Software engineering, systems software and programming languages · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer architecture, parallel and distributed computing, and storage systems
3 papers |
Distributed systems · 80% Interconnection networks and networks-on-chip · 14% Cloud and datacenter computing · 3% | |
| Databases, data mining, and information retrieval
2 papers |
Transaction processing and concurrency control · 46% Graph data management · 27% Distributed and cloud data management · 27% |
Topics — the 12 heaviest of 14, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Graph data management › graph database
distributed graph database |
0.4 | 1 | 2020 | A1: A Distributed In-Memory Graph Database · SIGMOD Conference 2020 |
Distributed and cloud data management
distributed query processing |
0.4 | 1 | 2020 | A1: A Distributed In-Memory Graph Database · SIGMOD Conference 2020 |
Transaction processing and concurrency control
distributed transaction processing |
0.4 | 1 | 2019 | Fast General Distributed Transactions with Opacity · SIGMOD Conference 2019 |
Transaction processing and concurrency control › serializability
strict serializability |
0.4 | 1 | 2019 | Fast General Distributed Transactions with Opacity · SIGMOD Conference 2019 |
Distributed systems
fault tolerance |
0.4 | 1 | 2019 | Fast General Distributed Transactions with Opacity · SIGMOD Conference 2019 |
Distributed systems › fault tolerance
high availability |
0.4 | 1 | 2019 | Fast General Distributed Transactions with Opacity · SIGMOD Conference 2019 |
Distributed systems
replication |
0.4 | 1 | 2019 | Fast General Distributed Transactions with Opacity · SIGMOD Conference 2019 |
Distributed systems › fault tolerance
transparent fault tolerance |
0.4 | 1 | 2019 | Fast General Distributed Transactions with Opacity · SIGMOD Conference 2019 |
Distributed systems › distributed database
distributed transactions |
0.2 | 1 | 2015 | No compromises: distributed transactions with consistency, availability, and performance · SOSP 2015 |
Interconnection networks and networks-on-chip › remote direct memory access
RDMA-based replication |
0.2 | 1 | 2015 | No compromises: distributed transactions with consistency, availability, and performance · SOSP 2015 |
Distributed systems › replication › replication and fault tolerance
replication and recovery |
0.2 | 1 | 2015 | No compromises: distributed transactions with consistency, availability, and performance · SOSP 2015 |
Interconnection networks and networks-on-chip
remote direct memory access |
0.1 | 1 | 2020 | A1: A Distributed In-Memory Graph Database · SIGMOD Conference 2020 |
Methods — techniques the papers use, named apart from their topics
RDMA · 1.1FaRM · 0.9timestamp ordering · 0.8failover protocol · 0.8clock synchronization · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2020 | A1: A Distributed In-Memory Graph DatabaseabstractA1 is an in-memory distributed database used by the Bing search engine to support complex queries over structured data. The key enablers for A1 are availability of cheap DRAM and high speed RDMA (Remote Direct Memory Access) networking in commodity hardware. A1 uses FaRM [11,12] as its underlying storage layer and builds the graph abstraction and query engine on top. The combination of in-memory storage and RDMA access requires rethinking how data is allocated, organized and queried in a large distributed system. A single A1 cluster can store tens of billions of vertices and edges and support a throughput of 350+ million of vertex reads per second with end to end query latency in single digit milliseconds. In this paper we describe the A1 data model, RDMA optimized data structures and query execution. Chiranjeeb Buragohain, Knut Magne Risvik, Paul Brett, Miguel Castro 0001, Wonhee Cho 0004, Joshua Cowhig, Nikolas Gloy, Karthik Kalyanaraman, Richendra Khanna, John Pao, Matthew Renzelmann, Alex Shamis, Timothy Tan, Shuheng Zheng |
SIGMOD Conference | 11 |
| 2019 | Fast General Distributed Transactions with OpacityabstractTransactions can simplify distributed applications by hiding data distribution, concurrency, and failures from the application developer. Ideally the developer would see the abstraction of a single large machine that runs transactions sequentially and never fails. This requires the transactional subsystem to provide opacity (strict serializability for both committed and aborted transactions), as well as transparent fault tolerance with high availability. As even the best abstractions are unlikely to be used if they perform poorly, the system must also provide high performance. Existing distributed transactional designs either weaken this abstraction or are not designed for the best performance within a data center. This paper extends the design of FaRM --- which provides strict serializability only for committed transactions --- to provide opacity while maintaining FaRM's high throughput, low latency, and high availability within a modern data center. It uses timestamp ordering based on real time with clocks synchronized to within tens of microseconds across a cluster, and a failover protocol to ensure correctness across clock master failures. FaRM with opacity can commit 5.4 million neworder transactions per second when running the TPC-C transaction mix on 90 machines with 3-way replication. Alex Shamis, Matthew Renzelmann, Stanko Novakovic, Georgios Chatzopoulos, Aleksandar Dragojevic, Dushyanth Narayanan, Miguel Castro 0001 |
SIGMOD Conference | 2 |
| 2015 | No compromises: distributed transactions with consistency, availability, and performanceabstractTransactions with strong consistency and high availability simplify building and reasoning about distributed systems. However, previous implementations performed poorly. This forced system designers to avoid transactions completely, to weaken consistency guarantees, or to provide single-machine transactions that require programmers to partition their data. In this paper, we show that there is no need to compromise in modern data centers. We show that a main memory distributed computing platform called FaRM can provide distributed transactions with strict serializability, high performance, durability, and high availability. FaRM achieves a peak throughput of 140 million TATP transactions per second on 90 machines with a 4.9 TB database, and it recovers from a failure in less than 50 ms. Key to achieving these results was the design of new transaction, replication, and recovery protocols from first principles to leverage commodity networks with RDMA and a new, inexpensive approach to providing non-volatile DRAM. Aleksandar Dragojevic, Dushyanth Narayanan, Ed Nightingale, Matthew Renzelmann, Alex Shamis, Anirudh Badam, Miguel Castro 0001 |
SOSP | 4 |
| 2007 | Automated tactile graphics translation: in the fieldabstractWe address the practical problem of automating the process of translating figures from mathematics, science, and engineering textbooks to a tactile form suitable for blind students. The Tactile Graphics Assistant (TGA) and accompanying workflow is described. Components of the TGA that identify text and replace it with Braille use machine learning, computational geometry, and optimization algorithms. We followed through with the ideas in our 2005 paper by creating a more detailed workflow, translating actual images, and analyzing the translation time. Our experience in translating more than 2,300 figures from 4 textbooks demonstrates that figures can be translated in ten minutes or less of human time on average. We describe our experience with training tactile graphics specialists to use the new TGA technology. Chandrika Jayant, Matthew Renzelmann, Dana Wen, Satria Krisnandi, Richard E. Ladner, Dan Comden |
ASSETS | 2 |
| 2005 | Automating tactile graphics translationabstractAccess to graphical images (bar charts, diagrams, line graphs, etc.) that are in a tactile form (representation through which content can be accessed by touch) is inadequate for students who are blind and take mathematics, science, and engineering courses. We describe our analysis of the current work practices of tactile graphics specialists who create tactile forms of graphical images. We propose automated means by which to improve the efficiency of current work practices.We describe the implementation of various components of this new automated process, which includes image classification, segmentation, simplification, and layout. We summarize our development of the tactile graphics assistant, which will enable tactile graphics specialists to be more efficient in creating tactile graphics both in batches and individually. We describe our unique team of researchers, practitioners, and student consultants who are blind, all of whom are needed to successfully develop this new way of translating tactile graphics. Richard E. Ladner, Melody Y. Ivory, Rajesh Rao, Sheryl Burgstahler, Dan Comden, Sangyun Hahn, Matthew Renzelmann, Satria Krisnandi, Mahalakshmi Ramasamy, Beverly Slabosky, Amelia Lacenski, Stuart Olsen, Dmitri Groce |
ASSETS | 7 |