Eran Rom

dblp:69/3567 · DBLP profile ↗
← Back
6ranked-venue papers
2as first author
0since 2021 · last 2017
—ORCID · none

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

Systems, architecture and hardware · 3Databases, data management, data science and information retrieval · 3Theory of computation · 2 · 2 first-author

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% Cloud and datacenter computing · 30%
Databases, data mining, and information retrieval
1 paper
Distributed and cloud data management · 100%
Theoretical computer science
1 paper
Coding theory · 100%

Topics — the 9 heaviest of 11, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Distributed and cloud data management
query offloading
0.312017
Too Big to Eat: Boosting Analytics Data Ingestion from Object Stores with Scoop · ICDE 2017
Storage systems
object storage
0.312017
Crystal: Software-Defined Storage for Multi-Tenant Object Stores · FAST 2017
Storage systems › storage architecture
software-defined storage
0.312017
Crystal: Software-Defined Storage for Multi-Tenant Object Stores · FAST 2017
Storage systems › storage architecture
storage controller
0.112012
Adding advanced storage controller functionality via low-overhead virtualization · FAST 2012
Coding theory › error-correcting codes › graph-based codes › sparse-graph codes
expander codes
0.112006
Improving the Alphabet-Size in Expander-Based Code Constructions · IEEE Trans. Inf. Theory 2006
Storage systems
storage virtualization
0.012012
Adding advanced storage controller functionality via low-overhead virtualization · FAST 2012
Cloud and datacenter computing
virtualization
0.012012
Adding advanced storage controller functionality via low-overhead virtualization · FAST 2012
Coding theory › error-correcting codes
code construction
0.012006
Improving the Alphabet-Size in Expander-Based Code Constructions · IEEE Trans. Inf. Theory 2006
Coding theory
error-correcting codes
0.012006
Improving the Alphabet-Size in Expander-Based Code Constructions · IEEE Trans. Inf. Theory 2006

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

active object storage layer · 0.6ETL-type actions · 0.6expander graphs · 0.1dispersers · 0.1
YearPublicationVenuePosition
2017 Crystal: Software-Defined Storage for Multi-Tenant Object Stores
Raúl Gracia Tinedo, Josep Sampé, Edgar Zamora-Gómez, Marc Sánchez Artigas, Pedro García López, Yosef Moatti, Eran Rom
FAST7
2017 Too Big to Eat: Boosting Analytics Data Ingestion from Object Stores with Scoop
abstract
Extracting value from data stored in object stores,such as OpenStack Swift and Amazon S3, can be problematicin common scenarios where analytics frameworks and objectstores run in physically disaggregated clusters. One of the mainproblems is that analytics frameworks must ingest large amountsof data from the object store prior to the actual computation;this incurs a significant resources and performance overhead. Toovercome this problem, we present Scoop. Scoop enables analyticsframeworks to benefit from the computational resources of objectstores to optimize the execution of analytics jobs. Scoop achievesthis by enabling the addition of ETL-type actions to the dataupload path and by offloading querying functions to the objectstore through a rich and extensible active object storage layer. Asa proof-of-concept, Scoop enables Apache Spark SQL selectionsand projections to be executed close to the data in OpenStackSwift for accelerating analytics workloads of a smart energy gridcompany (GridPocket). Our experiments in a 63-machine clusterwith real IoT data and SQL queries from GridPocket show thatScoop exhibits query execution times up to 30x faster than thetraditional “ingest-then-compute” approach.
Yosef Moatti, Eran Rom, Raúl Gracia Tinedo, Dalit Naor, Doron Chen, Josep Sampé, Marc Sánchez Artigas, Pedro García López, Filip Gluszak, Eric Deschdt, Francesco Pace, Daniele Venzano, Pietro Michiardi
ICDE2
2012 Adding advanced storage controller functionality via low-overhead virtualization
Muli Ben-Yehuda, Michael Factor, Eran Rom, Avishay Traeger, Eran Borovik, Ben-Ami Yassour
FAST3
2007 Capability based Secure Access Control to Networked Storage Devices
Michael Factor, Dalit Naor, Eran Rom, Julian Satran, Sivan Tal
MSST3
2006 Improving the Alphabet-Size in Expander-Based Code Constructions
abstract
Various code constructions use expander graphs to improve the error resilience. Often the use of expanding graphs comes at the expense of the alphabet size. In this correspondence, we show that by replacing the balanced expanding graphs used in the above constructions with unbalanced dispersers the alphabet size can be dramatically improved.
Eran Rom, Amnon Ta-Shma
IEEE Trans. Inf. Theory1
2005 Improving the Alphabet-Size in High Noise, Almost Optimal Rate List Decodable Codes
Eran Rom, Amnon Ta-Shma
STACS1