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.

Jihong Ma

dblp:27/3290 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
1since 2021 · last 2021
0000-0001-9142-8528ORCID · corroborated

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

Databases, data management, data science and information retrieval · 3 · 1 since 2021Systems, architecture and hardware · 1

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
3 papers
Query processing and optimization · 48% Indexing and storage engines · 36% Database system architecture and tuning · 16%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Cloud and datacenter computing · 74% Storage systems · 26%

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

TopicWeightPapersLastEvidence papers
Indexing and storage engines
columnar storage
0.512021
Good to the Last Bit: Data-Driven Encoding with CodecDB · SIGMOD Conference 2021
Query processing and optimization
compressed data processing
0.512021
Good to the Last Bit: Data-Driven Encoding with CodecDB · SIGMOD Conference 2021
Query processing and optimization
parallel query processing
0.412020
Alibaba Hologres: A Cloud-Native Service for Hybrid Serving/Analytical Processing · Proc. VLDB Endow. 2020
Indexing and storage engines › data compression
dictionary compression
0.412019
Mostly Order Preserving Dictionaries · ICDE 2019
Query processing and optimization
range query
0.412019
Mostly Order Preserving Dictionaries · ICDE 2019
Storage systems
data compression
0.112021
Good to the Last Bit: Data-Driven Encoding with CodecDB · SIGMOD Conference 2021
Indexing and storage engines
data compression
0.112019
Mostly Order Preserving Dictionaries · ICDE 2019

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

data-driven encoding selection · 1.0hybrid row/column storage · 0.9execution context scheduling · 0.9sampling-based dictionary generation · 0.4best-effort ordering · 0.4
YearPublicationVenuePosition
2021 Good to the Last Bit: Data-Driven Encoding with CodecDB
abstract
Columnar databases rely on specialized encoding schemes to reduce storage requirements. These encodings also enable efficient in-situ data processing. Nevertheless, many existing columnar databases are encoding-oblivious. When storing the data, these systems rely on a global understanding of the dataset or the data types to derive simple rules for encoding selection. Such rule-based selection leads to unsatisfactory performance. Specifically, when performing queries, the systems always decode data into memory, ignoring the possibility of optimizing access to encoded data. We develop CodecDB, an encoding-aware columnar database, to demonstrate the benefit of tightly-coupling the database design with the data encoding schemes. CodecDB chooses in a principled manner the most efficient encoding for a given data column and relies on encoding-aware query operators to optimize access to encoded data. Storage-wise, CodecDB achieves on average 90% accuracy for selecting the best encoding and improves the compression ratio by up to 40% compared to the state-of-the-art encoding selection solution. Query-wise, CodecDB is on average one order of magnitude faster than the latest open-source and commercial columnar databases on the TPC-H benchmark, and on average 3x faster than a recent research project on the Star-Schema Benchmark (SSB).
Hao Jiang 0021, Chunwei Liu, John Paparrizos, Andrew A. Chien, Jihong Ma, Aaron J. Elmore
SIGMOD Conference5
2020 Alibaba Hologres: A Cloud-Native Service for Hybrid Serving/Analytical Processing
abstract
In existing big data stacks, the processes of analytical processing and knowledge serving are usually separated in different systems. In Alibaba, we observed a new trend where these two processes are fused: knowledge serving incurs generation of new data, and these data are fed into the process of analytical processing which further fine tunes the knowledge base used in the serving process. Splitting this fused processing paradigm into separate systems incurs overhead such as extra data duplication, discrepant application development and expensive system maintenance. In this work, we propose Hologres, which is a cloud native service for hybrid serving and analytical processing (HSAP). Hologres decouples the computation and storage layers, allowing flexible scaling in each layer. Tables are partitioned into self-managed shards. Each shard processes its read and write requests concurrently independent of each other. Hologres leverages hybrid row/column storage to optimize operations such as point lookup, column scan and data ingestion used in HSAP. We propose Execution Context as a resource abstraction between system threads and user tasks. Execution contexts can be cooperatively scheduled with little context switching overhead. Queries are parallelized and mapped to execution contexts for concurrent execution. The scheduling framework enforces resource isolation among different queries and supports customizable schedule policy. We conducted experiments comparing Hologres with existing systems specifically designed for analytical processing and serving workloads. The results show that Hologres consistently outperforms other systems in both system throughput and end-to-end query latency.
Xiaowei Jiang, Yuejun Hu, Guangran Jiang, Chen Xia, Weihua Jiang, Jihong Ma, Li Su 0005, Kai Zeng 0002
Proc. VLDB Endow.11
2019 Mostly Order Preserving Dictionaries
abstract
Dictionary encoding, or domain encoding, is an important form of compression that uses a bijective mapping to replace attributes from a large domain (i.e. strings) with a finite domain (i.e. 32 bit integers). This encoding both reduces data storage and allows for more efficient query execution. Traditional dictionary encoding only supports efficient equality queries, while range queries require that encoded values are decoded for evaluating the predicates. An order preserving dictionary allows for range queries without decoding by ensuring that encoded keys follow the same order as the values in the dictionary. While this approach enables efficient queries it requires that the full set of values is known to create the mappings. In this work we bridge this gap by introducing mostly ordered dictionaries that use a best effort dictionary generation based on sampling the input dataset. Query evaluation on a mostly ordered dictionary avoids decoding when possible and gracefully degrades performance as the ratio of ordered values decreases.
Chunwei Liu, McKade Umbenhower, Hao Jiang 0021, Pranav Subramaniam, Jihong Ma, Aaron J. Elmore
ICDE5
2014 BIDS: Bridgehead-Employed Image Distribution System for Cloud Data Centers
Zhongzhao Wang, Yuebin Bai, Jihong Ma, Duo Lv, Yuanfeng Peng
NPC4