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.

Haogang Wang

dblp:189/3520 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2019
0000-0002-9956-8530ORCID · corroborated

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

Databases, data management, data science and information retrieval · 1Applied, interdisciplinary, general and emerging computing · 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 · 100%

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

TopicWeightPapersLastEvidence papers
Query processing and optimization › join processing
multi-way join
0.412019
HyMJ: A Hybrid Structure-Aware Approach to Distributed Multi-way Join Query · ICDE 2019
Query processing and optimization
query optimization
0.412019
HyMJ: A Hybrid Structure-Aware Approach to Distributed Multi-way Join Query · ICDE 2019

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

heuristic strategy selection · 0.4graph contraction · 0.4
YearPublicationVenuePosition
2019 HyMJ: A Hybrid Structure-Aware Approach to Distributed Multi-way Join Query
abstract
The multi-way join query plays a fundamental role in many big data analytic scenarios. Recently, the hybrid join query is becoming increasingly important. However, the existing one-round and multi-round algorithms have limitations in the process of the hybrid query. In this paper, we present a novel hybrid structure-aware multi-way join algorithm called HyMJ, which combines the one-round and multi-round algorithms to compute the hybrid query efficiently. First, we propose the query structure graph (QSG) to represent the internal query structure of a given join query and the query structure decomposition tree (QSDT) to represent the structure-aware query plan. Each internal node of the QSDT denotes a subquery with a cyclic or acyclic query structure. Then, we design a graph contraction based algorithm to construct QSDT from QSG. Furthermore, to select the optimal join strategy for each subquery in the QSDT, we introduce a heuristic strategy selection model. Experimental results on Apache Spark reveal that HyMJ outperforms both the one-round and multi-round algorithms for hybrid multi-way join queries on real-world datasets.
Xiaoqi Wu, Liangliang Yin, Haogang Wang, Rong Gu 0001, Chunfeng Yuan, Yihua Huang 0001
ICDE4
2016 Moisture retrieval based on an optimized Least Squares Support Vector Machine Model
abstract
Soil moisture retrieval is important in microwave remote sensing, but its high dimensional and non-linearity make it difficult to realize. In this paper, an improved Fruit Fly Optimization Algorithm (IFOA) to optimize the Least Squares Support Vector Machine (LSSVM) Model is used for soil moisture retrieval. The sampling data for training and test is generated by using Advanced Integral Equation Model (AIEM). To verify the performance of IFOA optimized LSSVM (IFOA-LSSVM), we apply it to the soil moisture retrieval in L and C bands and compare the results with those of FOA-LSSVM and LSSVM.
Xinying Shi, Youfei Zhang, Haogang Wang, Jiancheng Shi 0001
IGARSS3