Jin Pu

dblp:372/2731 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
4since 2021 · last 2026
0009-0006-5152-5773ORCID · reported

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 · 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.

Databases, data mining, and information retrieval
1 paper
Graph data management · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Memory systems · 100%

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

TopicWeightPapersLastEvidence papers
Graph data management
graph query processing
0.812024
Accelerating Regular Path Queries over Graph Database with Processing-in-Memory · DAC 2024
Graph data management › path query
regular path query
0.812024
Accelerating Regular Path Queries over Graph Database with Processing-in-Memory · DAC 2024
Memory systems › processing-in-memory
PIM-based graph processing
0.812024
Accelerating Regular Path Queries over Graph Database with Processing-in-Memory · DAC 2024
Memory systems
processing-in-memory
0.812024
Accelerating Regular Path Queries over Graph Database with Processing-in-Memory · DAC 2024
Graph data management
graph database
0.212024
Accelerating Regular Path Queries over Graph Database with Processing-in-Memory · DAC 2024

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

dynamic graph partitioning · 1.5PIM offloading · 1.5
YearPublicationVenuePosition
2026 Kirin: Efficient In-Storage Learned Compaction for LSM-Trees via System-Algorithm Co-Design
Shengan Zheng, Penghao Sun, Jin Pu, Kaijiang Deng, Bowen Zhang 0012, Weihan Kong, Yifan Hua, Linpeng Huang
Proc. VLDB Endow.4
2025 TxISC: Transactional File Processing in Computational SSDs
abstract
Computational SSDs implement the in-storage computing (ISC) paradigm and benefit applications by taking over I/O-intensive tasks from the host. Existing works have proposed various frameworks aiming at easy access to ISC functionalities, and among them generic frameworks with file-based abstractions offer better usability. However, since intermediate output by ISC tasks may leave files in a dirty state, concurrent access to and the integrity of file data should be properly managed, which has not been fully addressed. In this paper, we present TxISC, a generic ISC framework that coordinates the host kernel and device firmware to offer a versatile file-based programming model. Under the hood, TxISC turns each invocation of an ISC task into a transaction with full ACID guarantee, fully covering concurrency control and data protection. TxISC implements transactions at low cost by leveraging the out-of-place write characteristic of NAND flash. Evaluation on full-stack hardware shows that transactions incur almost no runtime performance penalty compared with existing ISC architectures. Application case studies demonstrate that the programming model of TxISC can be used to offload complex logic and deliver significant speedup over host-only solutions.
Penghao Sun, Shengan Zheng, Kaijiang Deng, Jin Pu, Maojun Yuan, Feng Zhu 0024, Linpeng Huang
DATE5
2025 CSGC: Collaborative File System Garbage Collection with Computational Storage
Jin Pu, Shengan Zheng, Penghao Sun, Linpeng Huang
Euro-Par (2)1
2024 Accelerating Regular Path Queries over Graph Database with Processing-in-Memory
abstract
Regular path queries (RPQs) in graph databases are bottlenecked by the memory wall. Emerging processing-in-memory (PIM) technologies offer a promising solution to dispatch and execute path matching tasks in parallel within PIM modules. We present Moctopus, a PIM-based data management system for graph databases that supports efficient batch RPQs and graph updates. Moctopus employs a PIM-friendly dynamic graph partitioning algorithm, which tackles graph skewness and preserves graph locality with low overhead for RPQ processing. Moctopus enables efficient graph update by amortizing the host CPU's update overhead to PIM modules. Evaluation of Moctopus demonstrates superiority over the state-of-the-art traditional graph database.
Ruoyan Ma, Shengan Zheng, Jin Pu, Yifan Hua, Linpeng Huang
DAC4