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.

Haoming Xian

dblp:400/5660 · 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.

Theoretical computer science
1 paper
Computational complexity · 100%
Databases, data mining, and information retrieval
1 paper
Data stream processing · 100%

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

TopicWeightPapersLastEvidence papers
Data stream processing › continuous query processing
sliding window
0.912025
Optimal Approximate Matrix Multiplication over Sliding Windows · Proc. VLDB Endow. 2025
Computational complexity › algebraic complexity › matrix multiplication
approximate matrix multiplication
0.912025
Optimal Approximate Matrix Multiplication over Sliding Windows · Proc. VLDB Endow. 2025
Computational complexity › algebraic complexity
matrix multiplication
0.912025
Optimal Approximate Matrix Multiplication over Sliding Windows · Proc. VLDB Endow. 2025
YearPublicationVenuePosition
2025 Optimal Approximate Matrix Multiplication over Sliding Windows
Haoming Xian, Qintian Guo, Sibo Wang 0001
Proc. VLDB Endow.1