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

Yuchuan Huang

dblp:266/6138 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
3since 2021 · last 2025
—ORCID · unresolved

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

Databases, data management, data science and information retrieval · 4 · 3 first-author · 3 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.

Databases, data mining, and information retrieval
4 papers
Query processing and optimization · 51% Spatial and temporal data management · 32% Data integration and cleaning · 11%

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

TopicWeightPapersLastEvidence papers
Query processing and optimization › precomputation
aggregate precomputation
1.722025
A Demonstration of POLARIS: An Interactive and Scalable Data Infrastructure for Polar Science · Proc. VLDB Endow. 2025
POLARIS: An Interactive and Scalable Data Infrastructure for Polar Science · Proc. VLDB Endow. 2025
Query processing and optimization
interactive query processing
1.722025
A Demonstration of POLARIS: An Interactive and Scalable Data Infrastructure for Polar Science · Proc. VLDB Endow. 2025
POLARIS: An Interactive and Scalable Data Infrastructure for Polar Science · Proc. VLDB Endow. 2025
Spatial and temporal data management
spatio-temporal indexing
1.722025
A Demonstration of POLARIS: An Interactive and Scalable Data Infrastructure for Polar Science · Proc. VLDB Endow. 2025
POLARIS: An Interactive and Scalable Data Infrastructure for Polar Science · Proc. VLDB Endow. 2025

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

hierarchical spatio-temporal index · 1.7spatial neighborhood · 0.8functional dependencies · 0.8distance weighting · 0.8z2t indexing · 0.4compression · 0.4XZ2T indexing · 0.4
YearPublicationVenuePosition
2025 POLARIS: An Interactive and Scalable Data Infrastructure for Polar Science
abstract
Though polar scientists entertain having huge amounts of publicly available datasets, they face the challenge that working with such data is a cumbersome process that requires downloading tons of unnecessary data and writing various scripts on top of it. This hinders their ability to perform any kind of interactive analysis. This paper presents Polaris; a novel open-source system infrastructure for Polar science that is highly Interactive and Scalable. Polaris is designed based on three observations that distinguish the query workload of polar scientists, namely, all queries are spatio-temporal, not all data are equal, and the large majority of queries are aggregates. Polaris is equipped with a hierarchical spatio-temporal index structure that stores precomputed aggregates for data of interest. Experimental results with a real Polaris prototype and real scientific data show that it achieves highly interactive and scalable data access, enabling interactive analysis of polar science data.
Yuchuan Huang, Ana Elena Uribe, Kareem Eldahshoury, Youssef Hussein, Grant Ogren, Mohamed F. Mokbel
Proc. VLDB Endow.1
2025 A Demonstration of POLARIS: An Interactive and Scalable Data Infrastructure for Polar Science
abstract
This demonstration presents Polaris; a novel open-source system infrastructure for Polar science that is highly Interactive and Scalable. Polaris is designed based on three observations that distinguish the query workload of polar scientists, namely, all queries are spatio-temporal, not all data are equal, and the large majority of queries are aggregates. With this, Polaris is equipped with a hierarchical spatio-temporal index structure that stores precomputed aggregates for data of interest. Audience will be able to experience Polaris through various scenarios that show the interactivity and scalability as well as Polaris optimized query processes.
Yuchuan Huang, Ana Elena Uribe, Grant Ogren, Youssef Hussein, Kareem Eldahshoury, Mohamed F. Mokbel
Proc. VLDB Endow.1
2024 Sparcle: Boosting the Accuracy of Data Cleaning Systems through Spatial Awareness
abstract
Though data cleaning systems have earned great success and wide spread in both academia and industry, they fall short when trying to clean spatial data. The main reason is that state-of-the-art data cleaning systems mainly rely on functional dependency rules where there is sufficient co-occurrence of value pairs to learn that a certain value of an attribute leads to a corresponding value of another attribute. However, for spatial attributes that represent locations, there is very little chance that two records would have the same exact coordinates, and hence co-occurrence is unlikely to exist. This paper presents Sparcle (SPatially-AwaRe CLEaning); a novel framework that injects spatial awareness into the core engine of rule-based data cleaning systems through two main concepts: (1) Spatial Neighborhood , where co-occurrence is relaxed to be within a certain spatial proximity rather than same exact value, and (2) Distance Weighting , where records are given different weights of whether they satisfy a dependency rule, based on their relative distance. Experimental results using a real deployment of Sparcle inside a state-of-the-art data cleaning system, and real and synthetic datasets, show that Sparcle significantly boosts the accuracy of data cleaning systems when dealing with spatial data.
Yuchuan Huang, Mohamed F. Mokbel
Proc. VLDB Endow.1
2020 JUST: JD Urban Spatio-Temporal Data Engine
abstract
With the prevalence of positioning techniques, a prodigious number of spatio-temporal data is generated constantly. To effectively support sophisticated urban applications, e.g., location-based services, based on spatio-temporal data, it is desirable for an efficient, scalable, update-enabled, and easy-to-use spatio-temporal data management system.This paper presents JUST, i.e., JD Urban Spatio-Temporal data engine, which can efficiently manage big spatio-temporal data in a convenient way. JUST incorporates the distributed NoSQL data store, i.e., Apache HBase, as the underlying storage, GeoMesa as the spatio-temporal data indexing tool, and Apache Spark as the execution engine. We creatively design two indexing techniques, i.e., Z2T and XZ2T, which accelerates spatio-temporal queries tremendously. Furthermore, we introduce a compression mechanism, which not only greatly reduces the storage cost, but also improves the query efficiency. To make JUST easy-to-use, we design and implement a complete SQL engine, with which all operations can be performed through a SQL-like query language, i.e., JustQL. JUST also supports inherently new data insertions and historical data updates without index reconstruction. JUST is deployed as a PaaS in JD with multi-users support. Many applications have been developed based on the SDKs provided by JUST. Extensive experiments are carried out with six state-of-the-art distributed spatio-temporal data management systems based on two real datasets and one synthetic dataset. The results show that JUST has a competitive query performance and is much more scalable than them.
Huajun He, Rubin Wang, Yuchuan Huang, Junwen Liu, Sijie Ruan, Tianfu He, Jie Bao 0003, Yu Zheng 0004
ICDE4