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

Ashwini Raina

dblp:46/6924 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
3since 2021 · last 2025
0000-0002-3367-009XORCID · corroborated

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

Systems, architecture and hardware · 3 · 1 first-author · 3 since 2021Software engineering, systems software and programming languages · 2 · 1 first-author · 2 since 2021Artificial intelligence and machine learning · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 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 · 84% Distributed systems · 11% Memory systems · 5%
Databases, data mining, and information retrieval
1 paper
Query processing and optimization · 100%

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

TopicWeightPapersLastEvidence papers
Query processing and optimization › query optimization › transformation-based optimization
query pushdown
0.912025
Fusion: An Analytics Object Store Optimized for Query Pushdown · ASPLOS (1) 2025
Storage systems
erasure-coded storage
0.912025
Fusion: An Analytics Object Store Optimized for Query Pushdown · ASPLOS (1) 2025
Storage systems › key-value storage
compaction
0.712023
Efficient Compactions between Storage Tiers with PrismDB · ASPLOS (3) 2023
Storage systems › data redundancy
replicated storage
0.712023
RubbleDB: CPU-Efficient Replication with NVMe-oF · USENIX ATC 2023
Storage systems › storage hierarchy
tiered storage
0.712023
Efficient Compactions between Storage Tiers with PrismDB · ASPLOS (3) 2023
Storage systems › distributed storage
disaggregated storage
0.312025
Fusion: An Analytics Object Store Optimized for Query Pushdown · ASPLOS (1) 2025
Distributed systems
fault tolerance
0.212023
RubbleDB: CPU-Efficient Replication with NVMe-oF · USENIX ATC 2023
Memory systems
non-volatile memory
0.212023
Efficient Compactions between Storage Tiers with PrismDB · ASPLOS (3) 2023
Distributed systems
replication
0.212023
RubbleDB: CPU-Efficient Replication with NVMe-oF · USENIX ATC 2023

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

CPU-efficient replication · 0.7
YearPublicationVenuePosition
2025 Fusion: An Analytics Object Store Optimized for Query Pushdown
abstract
The prevalence of disaggregated storage in public clouds has led to increased latency in modern OLAP cloud databases, particularly when handling ad-hoc and highly-selective queries on large objects. To address this, cloud databases have adopted computation pushdown, executing query predicates closer to the storage layer. However, existing pushdown solutions are inefficient in erasure-coded storage. Cloud storage employs erasure coding that partitions analytics file objects into fixed-sized blocks and distributes them across storage nodes. Consequently, when a specific part of the object is queried, the storage system must reassemble the object across nodes, incurring significant network latency.
Jianan Lu, Ashwini Raina, Asaf Cidon, Michael J. Freedman
ASPLOS (1)2
2023 Efficient Compactions between Storage Tiers with PrismDB
abstract
In recent years, emerging storage hardware technologies have focused on divergent goals: better performance or lower cost-per-bit. Correspondingly, data systems that employ these technologies are typically optimized either to be fast (but expensive) or cheap (but slow). We take a different approach: by architecting a storage engine to natively utilize two tiers of fast and low-cost storage technologies, we can achieve a Pareto efficient balance between performance and cost-per-bit.
Ashwini Raina, Jianan Lu, Asaf Cidon, Michael J. Freedman
ASPLOS (3)1
2023 RubbleDB: CPU-Efficient Replication with NVMe-oF
Ashwini Raina, Xingyu Zhu 0015, Changxu Luo, Asaf Cidon
USENIX ATC4
2005 HAUNT-24: 24-bit Hierarchical, Application-Confined Unique Naming Technique
abstract
The advent of tiny, inexpensive, low-power, autonomously functioning wireless sensors, has paved a way for high quality research, by posing unique challenges to researchers. Energy, cost and size of such sensors limit their communication and computation capabilities and thus robust and highly energy efficient algorithms need to be incorporated at every layer of the network model, along with an efficient network aware addressing scheme. This paper proposes a 24-bit hierarchical, application-confined unique naming technique (HAUNT-24), which ensures mutual distinctiveness of addresses within an application, with the primary focus on in-network data aggregation. Various issues relating to the proposed addressing scheme are analyzed and its future scope is discussed. The simple aggregate queries such as MIN/MAX and AVG are applied over the proposed HAUNT-24 addressed network and it's shown how it helps in achieving in-network data aggregation.
Ashwini Raina, Shruti Patil, Venkatesan Muthukumar, Ajith Abraham
ISDA1