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

Mingchuan Su

dblp:131/2908 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2016
—ORCID · none

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

Databases, data management, data science and information retrieval · 3

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
2 papers
Database system architecture and tuning · 57% Query processing and optimization · 38% Information retrieval · 6%

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

TopicWeightPapersLastEvidence papers
Database system architecture and tuning
main-memory database
0.522016
Virtual Denormalization via Array Index Reference for Main Memory OLAP · IEEE Trans. Knowl. Data Eng. 2016
Virtual denormalization via array index reference for main memory OLAP · ICDE 2016
Database system architecture and tuning › database design › physical database design
denormalization
0.212016
Virtual Denormalization via Array Index Reference for Main Memory OLAP · IEEE Trans. Knowl. Data Eng. 2016
Query processing and optimization
OLAP
0.212016
Virtual denormalization via array index reference for main memory OLAP · ICDE 2016
Query processing and optimization › OLAP
OLAP query processing
0.212016
Virtual Denormalization via Array Index Reference for Main Memory OLAP · IEEE Trans. Knowl. Data Eng. 2016
Information retrieval
query processing
0.112016
Virtual denormalization via array index reference for main memory OLAP · ICDE 2016

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

virtual denormalization · 0.2vectorized scan · 0.2vectorized aggregation · 0.2array index reference · 0.2
YearPublicationVenuePosition
2016 Virtual denormalization via array index reference for main memory OLAP
abstract
Denormalization is a common tactic for enhancing performance of data warehouses. However, it is rarely used in main memory databases, which regards storage space as scarce resource. In this paper, we demonstrate that MMDB can actually benefit from the strategy of denormalization. We have created A-Store, a prototypical main-memory database system customized for star and snowflake schemas, which applies the strategy of denormalization to achieve highly efficient OLAP. Instead of resorting to fully materialized denormalization, A-Store applies a method called virtual denomalization, which allows query processing to be performed in a denormalized way, while without incurring additional space consumption.
Xuan Zhou 0001, Yu Zhang 0183, Mingchuan Su, Shan Wang 0001
ICDE5
2016 Virtual Denormalization via Array Index Reference for Main Memory OLAP
abstract
Denormalization is a common tactic for enhancing performance of data warehouses, though its side-effect is quite obvious. Besides being confronted with update abnormality, denormalization has to consume additional storage space. As a result, this tactic is rarely used in main memory databases, which regards storage space, i.e., RAM, as scarce resource. Nevertheless, our research reveals that main memory database can benefit enormously from denormalization, as it is able to remarkably simplify the query processing plans and reduce the computation cost. In this paper, we present A-Store, a main memory OLAP engine customized for star/snowflake schemas. Instead of generating fully materialized denormalization, A-Store resorts to virtual denormalization by treating array indexes as primary keys. This design allows us to harvest the benefit of denormalization without sacrificing additional RAM space. A-Store uses a generic query processing model for all SPJGA queries. It applies a number of state-of-the-art optimization methods, such as vectorized scan and aggregation, to achieve superior performance. Our experiments show that A-Store outperforms the most prestigious MMDB systems significantly in star/snowflake schema based query processing.
Xuan Zhou 0001, Yu Zhang 0183, Mingchuan Su, Shan Wang 0001
IEEE Trans. Knowl. Data Eng.5
2013 Keyword Oriented Bitmap Join Index for In-Memory Analytical Processing
Mingchuan Su, Xuan Zhou 0001, Shan Wang 0001
WAIM2