Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yonatan Gottesman

dblp:183/0746 · DBLP profile ↗
← Back
6ranked-venue papers
3as first author
0since 2021 · last 2020
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 5 · 3 first-authorDatabases, data management, data science and information retrieval · 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
Storage systems · 70% Memory systems · 19% Cloud and datacenter computing · 11%
Databases, data mining, and information retrieval
1 paper
Transaction processing and concurrency control · 44% Distributed and cloud data management · 44% Query processing and optimization · 13%
Software engineering, system software, and programming languages
1 paper
Runtime systems and virtual machines · 100%

Topics — the 7 heaviest of 10, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Storage systems
key-value storage
0.922020
Oak: a scalable off-heap allocated key-value map · PPoPP 2020
EvenDB: optimizing key-value storage for spatial locality · EuroSys 2020
Runtime systems and virtual machines
garbage collection
0.412020
Oak: a scalable off-heap allocated key-value map · PPoPP 2020
Storage systems › key-value storage
LSM-tree
0.412020
EvenDB: optimizing key-value storage for spatial locality · EuroSys 2020
Memory systems › data locality
spatial locality
0.412020
EvenDB: optimizing key-value storage for spatial locality · EuroSys 2020
Transaction processing and concurrency control
distributed transaction processing
0.312018
Taking Omid to the Clouds: Fast, Scalable Transactions for Real-Time Cloud Analytics · Proc. VLDB Endow. 2018
Storage systems
storage virtualization
0.212016
NeSC: Self-virtualizing nested storage controller · MICRO 2016
Cloud and datacenter computing
virtualization
0.212016
NeSC: Self-virtualizing nested storage controller · MICRO 2016

Methods — techniques the papers use, named apart from their topics

off-heap memory management · 0.9single-key transaction optimization · 0.3fast path protocol · 0.3SR-IOV · 0.2PCIe virtual device interfaces · 0.2
YearPublicationVenuePosition
2020 EvenDB: optimizing key-value storage for spatial locality
abstract
Applications of key-value (KV-)storage often exhibit high spatial locality, such as when many data items have identical composite key prefixes. This prevalent access pattern is underused by the ubiquitous LSM design underlying high-throughput KV-stores today.
Eran Gilad, Edward Bortnikov, Anastasia Braginsky, Yonatan Gottesman, Eshcar Hillel, Idit Keidar, Nurit Moscovici, Rana Shahout
EuroSys4
2020 Oak: a scalable off-heap allocated key-value map
abstract
Efficient ordered in-memory key-value (KV-)maps are paramount for the scalability of modern data platforms. In managed languages like Java, KV-maps face unique challenges due to the high overhead of garbage collection (GC).
Hagar Meir, Dmitry Basin, Edward Bortnikov, Anastasia Braginsky, Yonatan Gottesman, Idit Keidar, Eran Meir, Gali Sheffi, Yoav Zuriel
PPoPP5
2018 Taking Omid to the Clouds: Fast, Scalable Transactions for Real-Time Cloud Analytics
abstract
We describe how we evolve Omid, a transaction processing system for Apache HBase, to power Apache Phoenix, a cloud-grade real-time SQL analytics engine. Omid was originally designed for data processing pipelines at Yahoo, which are, by and large, throughput-oriented monolithic NoSQL applications. Providing a platform to support converged real-time transaction processing and analytics applications - dubbed translytics - introduces new functional and performance requirements. For example, SQL support is key for developer productivity, multi-tenancy is essential for cloud deployment, and latency is cardinal for just-in-time data ingestion and analytics insights. We discuss our efforts to adapt Omid to these new domains, as part of the process of integrating it into Phoenix as the transaction processing backend. A central piece of our work is latency reduction in Omid's protocol, which also improves scalability. Under light load, the new protocol's latency is 4x to 5x smaller than the legacy Omid's, whereas under increased loads it is an order of magnitude faster. We further describe a fast path protocol for single-key transactions, which enables processing them almost as fast as native HBase operations.
Ohad Shacham, Yonatan Gottesman, Aran Bergman, Edward Bortnikov, Eshcar Hillel, Idit Keidar
Proc. VLDB Endow.2
2017 Fragola: low-latency transactions in distributed data stores
abstract
As transaction processing services begin to be used in new application domains, low transaction latency becomes an important consideration. Motivated by such use cases we developed Fragola, a highly scalable low-latency and high-throughput transaction processing engine for Apache HBase. Similarly to other modern transaction managers, Fragola provides a variant of generalized snapshot isolation (SI), which scales better than traditional serializability implementations.
Yonatan Gottesman, Aran Bergman, Edward Bortnikov, Eshcar Hillel, Idit Keidar, Ohad Shacham
SoCC1
2016 NeSC: Self-virtualizing nested storage controller
abstract
The emergence of high-speed, multi GB/s storage devices has shifted the performance bottleneck of storage virtualization to the software layers of the hypervisor. The hypervisor overheads can be avoided by allowing the virtual machine (VM) to directly access the storage device (a method known as direct device assignment), but this method voids all protection guarantees provided by filesystem permissions, since the device has no notion of client isolation. Recently, following the introduction of 10Gbs and higher networking interfaces, the PCIe specification was extended to include the SR-IOV specification for self-virtualizing devices, which allows a single physical device to present multiple virtual interfaces on the PCIe interconnect. Using SR-IOV, a hypervisor can directly assign a virtual PCIe device interface to each of its VMs. However, as networking interfaces simply multiplex packets sent from/to different clients, the specification does not dictate the semantics of a virtual storage device and how to maintain data isolation in a self-virtualizing device. In this paper we present the self-virtualizing, nested storage controller (NeSC) architecture, which includes a filesystem-agnostic protection mechanism that enables the physical device to export files as virtual PCIe storage devices. The protection mechanism maps file offsets to physical blocks and thereby offloads the hypervisor's storage layer functionality to hardware. Using NeSC, a hypervisor can securely expose its files as virtual PCIe devices and directly assign them to VMs. We have prototyped a 1GB/s NeSC controller using a Virtex-7 FPGA development board connected to the PCIe interconnect. Our evaluation of NeSC on a real system shows that NeSC virtual devices enable VMs to access their data with near-native performance (in terms of both throughput and latency).
Yonatan Gottesman, Yoav Etsion
MICRO1
2016 Using Storage Class Memory Efficiently for an In-memory Database
abstract
Storage class memory (SCM) is an emerging class of memory devices that are both byte addressable, and persistent. There are many different technologies that can be considered SCM, at different stages of maturity. Examples of such technologies include NVDIMM-N, PCM, SttRAM, Racetrack, FeRAM, and others.
Yonatan Gottesman, Joel Nider, Ronen I. Kat, Yaron Weinsberg, Michael Factor
SYSTOR1