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.

Kaisei Hishida

dblp:415/9986 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2025
—ORCID · none

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

Databases, data management, data science and information retrieval · 1 · 1 first-author · 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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Storage systems · 100%
Databases, data mining, and information retrieval
1 paper
Query processing and optimization · 50% Machine learning and data management · 50%

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

TopicWeightPapersLastEvidence papers
Storage systems
data compression
0.912025
Beyond Compression: A Comprehensive Evaluation of Lossless Floating-Point Compression · Proc. VLDB Endow. 2025
Storage systems › data compression
floating-point compression
0.912025
Beyond Compression: A Comprehensive Evaluation of Lossless Floating-Point Compression · Proc. VLDB Endow. 2025
Storage systems › data compression
lossless compression
0.912025
Beyond Compression: A Comprehensive Evaluation of Lossless Floating-Point Compression · Proc. VLDB Endow. 2025
Query processing and optimization › query execution
in-situ query processing
0.312025
Beyond Compression: A Comprehensive Evaluation of Lossless Floating-Point Compression · Proc. VLDB Endow. 2025

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

evaluation · 1.7benchmarking · 1.7
YearPublicationVenuePosition
2025 Beyond Compression: A Comprehensive Evaluation of Lossless Floating-Point Compression
abstract
Modern data-intensive applications generate vast amounts of floating-point data, essential for fields like databases and machine learning. While many compression techniques focus on space efficiency, there is a lack of benchmarks evaluating both compression and query performance, especially in areas like in-situ query execution on compressed data and machine learning tasks such as distance measurement and k-nearest neighbors (k-NN) in Retrieval-Augmented Generation (RAG) systems. This paper addresses this gap by evaluating popular lossless floating-point compression methods on three key factors: compression efficiency, database operations performance, and machine learning query performance. We implemented these techniques in Rust and integrated them into an open-source library for use with columnar engines. Our comparison highlights trade-offs between compression efficiency and query performance, showing that no single approach excels in all areas, and some methods trade off compression for slower performance.
Kaisei Hishida, Chunwei Liu, John Paparrizos, Aaron J. Elmore
Proc. VLDB Endow.1