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
Demo Data from EDBT 2026 / reviewers in the wild / expert

Jia Shi 0010

dblp:43/10099-10 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
1since 2021 · last 2022
0000-0002-9360-3454ORCID · verified

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

Security and privacy · 1 · 1 since 2021Databases, data management, data science and information retrieval · 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.

Databases, data mining, and information retrieval
1 paper
Indexing and storage engines · 61% Database system architecture and tuning · 30% Query processing and optimization · 9%
Network and information security
1 paper
Cryptographic primitives and cryptanalysis · 100%
Theoretical computer science
1 paper
Algorithms and data structures · 100%

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

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › public-key cryptography
elliptic curve cryptography		 0.612022
Accelerating the Delfs-Galbraith Algorithm with Fast Subfield Root Detection · CRYPTO (3) 2022
Algorithms and data structures
number-theoretic algorithms		 0.612022
Accelerating the Delfs-Galbraith Algorithm with Fast Subfield Root Detection · CRYPTO (3) 2022
Indexing and storage engines
columnar storage		 0.412020
Column Partition and Permutation for Run Length Encoding in Columnar Databases · SIGMOD Conference 2020
Indexing and storage engines › data compression
run-length encoding		 0.412020
Column Partition and Permutation for Run Length Encoding in Columnar Databases · SIGMOD Conference 2020
Query processing and optimization
compressed data processing		 0.112020
Column Partition and Permutation for Run Length Encoding in Columnar Databases · SIGMOD Conference 2020

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

incremental heuristic · 0.4NP-hardness analysis · 0.4
YearPublicationVenuePosition
2022 Accelerating the Delfs-Galbraith Algorithm with Fast Subfield Root Detection
Maria Corte-Real Santos, Craig Costello, Jia Shi 0010
 CRYPTO (3)3
2020 Column Partition and Permutation for Run Length Encoding in Columnar Databases
abstract
Effective compression is essential when databases are used in Big Data applications. For in-memory columnar databases, compression can help to load the columns faster and speed up query evaluation. In this paper, we consider compressing columns using the Run Length Encoding (RLE). This algorithm encodes each region with identical value using a single run. The question we study in this paper is 'how to rearrange table columns for better compression?' We observe that not every column of a table benefits from column compression in an ideal column arrangement. Because finding the optimal column arrangement is NP-hard, we propose an incremental heuristic that identifies the set of columns to be compressed and the order of rows that offer a better compression ratio. Our preliminary experiments confirm that our algorithm improves the compression rate by up to 25% on test data, compared with compressing all columns of a table.
Jia Shi 0010
 SIGMOD Conference1