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

Huan Shen

dblp:88/7483 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
1since 2021 · last 2026
—ORCID · conflict

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

Computer networks · 1 · 1 since 2021Security and privacy · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 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
1 paper
Query processing and optimization · 50% Database system architecture and tuning · 50%

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

TopicWeightPapersLastEvidence papers
Query processing and optimization
query result caching
0.412020
Maxson: Reduce Duplicate Parsing Overhead on Raw Data · ICDE 2020

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

conditional random field · 0.4LSTM · 0.4
YearPublicationVenuePosition
2026 Towards Efficient Verification of Distributed In-Network Computing Programs
Mingyuan Song, Huan Shen, Jinghui Jiang, Qingyu Song 0002, Yuchao Zhang 0004, Wanjian Feng, Fei Yuan 0001, Yitao Xing, Wenjia Wei, Qiao Xiang, Jiwu Shu
SIGCOMM2
2020 Maxson: Reduce Duplicate Parsing Overhead on Raw Data
abstract
JSON is a very popular data format in many applications in Web and enterprise. Recently, many data analytical systems support the loading and querying JSON data. However, JSON parsing can be costly, which dominates the execution time of querying JSON data. Many previous studies focus on building efficient parsers to reduce this parsing cost, and little work has been done on how to reduce the occurrences of parsing. In this paper, we start with a study with a real production workload in Alibaba, which consists of over 3 million queries on JSON. Our study reveals significant temporal and spatial correlations among those queries, which result in massive redundant parsing operations among queries. Instead of repetitively parsing the JSON data, we propose to develop a cache system named Maxson for caching the JSON query results (the values evaluated from JSONPath) for reuse. Specifically, we develop effective machine learning-based predictor with combining LSTM (long shortterm memory) and CRF (conditional random field) to determine the JSONPaths to cache given the space budget. We have implemented Maxson on top of SparkSQL. We experimentally evaluate Maxson and show that 1) Maxson is able to eliminate the most of duplicate JSON parsing overhead, 2) Maxson improves end-to-end workload performance by 1.5-6.5×.
Xuanhua Shi, Hong Huang 0001, Hai Jin 0001, Huan Shen, Yongluan Zhou, Bingsheng He, Ruibo Li, Keyong Zhou
ICDE6
2009 A Robust Vehicle Tracking Approach Using Mean Shift Procedure
abstract
Object tracking using vision technology is one of the key but complex functions in navigation system of Intelligent Vehicles; it became more difficult in case of there are partial occlusions and significant clutter. A mean shift embedded approach is presents for vehicle tracking under real road scenes. The HSI model and orientation histogram are used to represent the object feature; the mean shift is employed to fast searching the mode of the potential object in a neighborhood of current frame. Experimental results demonstrate that the proposed approach is robust and validate in complicated real scenes.
Huan Shen, Shun Ming Li, Jian Guo Mao, Fang Chao Bo, Fang Pei Li, Hua Peng Zhou
IAS1