Demo Data from EDBT 2026 / reviewers in the wild / expert
Meng Xu 0023
dblp:75/4287-23
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2023
0000-0002-9930-0403ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021
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
2 papers |
Storage systems · 78% Distributed systems · 13% Parallel and multicore computing · 5% | |
| Theoretical computer science
1 paper |
Approximation and online algorithms · 100% |
Topics — the 10 heaviest of 10, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Storage systems
key-value storage |
0.7 | 2 | 2023 | FoundationDB: A Distributed Unbundled Transactional Key Value Store · SIGMOD Conference 2021 Provably Good Randomized Strategies for Data Placement in Distributed Key-Value Stores · PPoPP 2023 |
Storage systems
data placement |
0.7 | 1 | 2023 | Provably Good Randomized Strategies for Data Placement in Distributed Key-Value Stores · PPoPP 2023 |
Storage systems
distributed storage |
0.7 | 1 | 2023 | Provably Good Randomized Strategies for Data Placement in Distributed Key-Value Stores · PPoPP 2023 |
Approximation and online algorithms
online algorithms |
0.7 | 1 | 2023 | Provably Good Randomized Strategies for Data Placement in Distributed Key-Value Stores · PPoPP 2023 |
Approximation and online algorithms › online algorithms
randomized online algorithms |
0.7 | 1 | 2023 | Provably Good Randomized Strategies for Data Placement in Distributed Key-Value Stores · PPoPP 2023 |
Distributed systems › distributed database
distributed transactions |
0.5 | 1 | 2021 | FoundationDB: A Distributed Unbundled Transactional Key Value Store · SIGMOD Conference 2021 |
Storage systems
storage reliability |
0.5 | 1 | 2021 | FoundationDB: A Distributed Unbundled Transactional Key Value Store · SIGMOD Conference 2021 |
Storage systems › key-value storage
transactional key-value store |
0.5 | 1 | 2021 | FoundationDB: A Distributed Unbundled Transactional Key Value Store · SIGMOD Conference 2021 |
Parallel and multicore computing
load balancing |
0.2 | 1 | 2023 | Provably Good Randomized Strategies for Data Placement in Distributed Key-Value Stores · PPoPP 2023 |
Cloud and datacenter computing
cloud infrastructure |
0.1 | 1 | 2021 | FoundationDB: A Distributed Unbundled Transactional Key Value Store · SIGMOD Conference 2021 |
Methods — techniques the papers use, named apart from their topics
randomization · 1.3adversarial analysis · 1.3deterministic simulation · 0.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Provably Good Randomized Strategies for Data Placement in Distributed Key-Value StoresabstractDistributed storage systems are used widely in clouds, databases, and file systems. These systems store a large amount of data across multiple servers. When a request to access data comes in, it is routed to the appropriate server, queued, and eventually processed. If the server's queue is full, then requests may be rejected. Thus, one important challenge when designing the algorithm for allocating data to servers is the fact that the request pattern may be unbalanced, unpredictable, and may change over time. If some servers get a large fraction of the requests, they are overloaded, leading to many rejects. In this paper, we analyze this problem theoretically under adversarial assumptions. In particular, we assume that the request sequence is generated by an adversarial process to maximize the number of rejects and analyze the performance of various algorithmic strategies in terms of the fraction of the requests rejected. We show that no deterministic strategy can perform well. On the other hand, a simple randomized strategy guarantees that at most a constant fraction of requests are rejected in expectation. We also show that moving data to load balance is essential if we want to reject a very small fraction (1/m where m is the number of servers) of requests. We design a strategy with randomization and data transfer to achieve this performance with speed augmentation. Finally, we conduct experiments and show that our algorithms perform well in practice. Zhe Wang 0056, Jinhao Zhao, Kunal Agrawal 0001, Meng Xu 0023, Jing Li 0025 |
PPoPP | 5 |
| 2021 | FoundationDB: A Distributed Unbundled Transactional Key Value StoreabstractFoundationDB is an open source transactional key value store created more than ten years ago. It is one of the first systems to combine the flexibility and scalability of NoSQL architectures with the power of ACID transactions (a.k.a. NewSQL). FoundationDB adopts an unbundled architecture that decouples an in-memory transaction management system, a distributed storage system, and a built-in distributed configuration system. Each sub-system can be independently provisioned and configured to achieve the desired scalability, high-availability and fault tolerance properties. FoundationDB uniquely integrates a deterministic simulation framework, used to test every new feature of the system under a myriad of possible faults. This rigorous testing makes FoundationDB extremely stable and allows developers to introduce and release new features in a rapid cadence. FoundationDB offers a minimal and carefully chosen feature set, which has enabled a range of disparate systems (from semi-relational databases, document and object stores, to graph databases and more) to be built as layers on top. FoundationDB is the underpinning of cloud infrastructure at Apple, Snowflake and other companies, due to its consistency, robustness and availability for storing user data, system metadata and configuration, and other critical information. Jingyu Zhou, Meng Xu 0023, Alexander Shraer, Bala Namasivayam, Evan Tschannen, Steve Atherton, Andrew J. Beamon, Rusty Sears, John Leach, Dave Rosenthal, Will Wilson, Ben Collins, David Scherer, Alec Grieser, Young Liu, Alvin Moore, Bhaskar Muppana, Xiaoge Su, Vishesh Yadav |
SIGMOD Conference | 2 |