Demo Data from EDBT 2026 / reviewers in the wild / expert
Ivan Kelly
dblp:37/10440
· DBLP profile ↗
3ranked-venue papers
0as first author
0since 2021 · last 2017
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 3Artificial intelligence and machine learning · 1Systems, architecture and hardware · 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.
| Databases, data mining, and information retrieval
2 papers |
Transaction processing and concurrency control · 100% | |
| Computer architecture, parallel and distributed computing, and storage systems
2 papers |
Distributed systems · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Transaction processing and concurrency control
distributed transaction processing |
0.5 | 2 | 2017 | Omid, Reloaded: Scalable and Highly-Available Transaction Processing · FAST 2017 Omid: Lock-free transactional support for distributed data stores · ICDE 2014 |
Transaction processing and concurrency control › isolation levels
snapshot isolation |
0.2 | 1 | 2014 | Omid: Lock-free transactional support for distributed data stores · ICDE 2014 |
Distributed systems
fault tolerance |
0.1 | 2 | 2017 | Omid, Reloaded: Scalable and Highly-Available Transaction Processing · FAST 2017 Omid: Lock-free transactional support for distributed data stores · ICDE 2014 |
Distributed systems › fault tolerance
high availability |
0.1 | 1 | 2017 | Omid, Reloaded: Scalable and Highly-Available Transaction Processing · FAST 2017 |
Methods — techniques the papers use, named apart from their topics
snapshot isolation · 0.4centralized transaction metadata · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2017 | Omid, Reloaded: Scalable and Highly-Available Transaction Processing
Edward Bortnikov, Eshcar Hillel, Idit Keidar, Ivan Kelly, Matthieu Morel, Sameer Paranjpye, Francisco Perez-Sorrosal, Ohad Shacham |
FAST | 4 |
| 2014 | Omid: Lock-free transactional support for distributed data storesabstractIn this paper, we introduce Omid, a tool for lock-free transactional support in large data stores such as HBase. Omid uses a centralized scheme and implements snapshot isolation, a property that guarantees that all read operations of a transaction are performed on a consistent snapshot of the data. In a lock-based approach, the unreleased, distributed locks that are held by a failed or slow client block others. By using a centralized scheme for Omid, we are able to implement a lock-free commit algorithm, which does not suffer from this problem. Moreover, Omid lightly replicates a read-only copy of the transaction metadata into the clients where they can locally service a large part of queries on metadata. Thanks to this technique, Omid does not require modifying either the source code of the data store or the tables' schema, and the overhead on data servers is also negligible. The experimental results show that our implementation on a simple dual-core machine can service up to a thousand of client machines. While the added latency is limited to only 10 ms, Omid scales up to 124K write transactions per second. Since this capacity is multiple times larger than the maximum reported traffic in similar systems, we do not expect the centralized scheme of Omid to be a bottleneck even for current large data stores. Daniel Gómez Ferro, Flavio Paiva Junqueira, Ivan Kelly, Benjamin C. Reed, Maysam Yabandeh |
ICDE | 3 |
| 2011 | Assigning documents to master sites in distributed searchabstractAn appealing solution to scale Web search with the growth of the Internet is the use of distributed architectures. Distributed search engines rely on multiple sites deployed in distant regions across the world, where each site is specialized to serve queries issued by the users of its region. This paper investigates the problem of assigning each document to a master site. We show that by leveraging similarities between a document and the activity of the users, we can accurately detect which site is the most relevant to place a document. We conduct various experiments using two document assignment approaches, showing performance improvements of up to 20.8% over a baseline technique which assigns the documents to search sites based on their language. Roi Blanco, Berkant Barla Cambazoglu, Flavio Paiva Junqueira, Ivan Kelly, Vincent Leroy 0001 |
CIKM | 4 |