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

Wanhong Wang

dblp:308/2586 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
3since 2021 · last 2023
0000-0001-5778-6778ORCID · corroborated

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

Computer networks · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 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.

Computer networks
1 paper
Routing and switching · 61% Internet architecture and protocols · 30% Content delivery and video streaming · 9%
Databases, data mining, and information retrieval
1 paper
Distributed and cloud data management · 100%

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

TopicWeightPapersLastEvidence papers
Distributed and cloud data management
distributed database architecture
0.712023
OceanBase Paetica: A Hybrid Shared-nothing/Shared-everything Database for Supporting Single Machine and Distributed Cluster · Proc. VLDB Endow. 2023
Internet architecture and protocols
multicast
0.512021
Towards highly scalable multicast via explicit path definition · CoNEXT 2021
Routing and switching
multicast routing
0.512021
Towards highly scalable multicast via explicit path definition · CoNEXT 2021
Routing and switching › multicast routing
multicast scaling
0.512021
Towards highly scalable multicast via explicit path definition · CoNEXT 2021
Content delivery and video streaming › video broadcasting
IPTV
0.112021
Towards highly scalable multicast via explicit path definition · CoNEXT 2021

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

parallel execution · 0.7adaptive configuration · 0.7in-packet bitmap encoding · 0.5
YearPublicationVenuePosition
2023 OceanBase Paetica: A Hybrid Shared-nothing/Shared-everything Database for Supporting Single Machine and Distributed Cluster
abstract
In the ongoing evolution of the OceanBase database system, it is essential to enhance its adaptability to small-scale enterprises. The OceanBase database system has demonstrated its stability and effectiveness within the Ant Group and other commercial organizations, besides through the TPC-C and TPC-H tests. In this paper, we have designed a stand-alone and distributed integrated architecture named Paetica to address the overhead caused by the distributed components in the stand-alone mode, with respect to the OceanBase system. Paetica enables adaptive configuration of the database that allows OceanBase to support both serial and parallel executions in stand-alone and distributed scenarios, thus providing efficiency and economy. This design has been implemented in version 4.0 of the OceanBase system, and the experiments show that Paetica exhibits notable scalability and outperforms alternative stand-alone or distributed databases. Furthermore, it enables the transition of OceanBase from primarily serving large enterprises to truly catering to small and medium enterprises, by employing a single OceanBase database for the successive stages of enterprise or business development, without the requirement for migration. Our experiments confirm that Paetica has achieved linear scalability with the increasing CPU core number within the stand-alone mode. It also outperforms MySQL and Greenplum in the Sysbench and TPC-H evaluations.
Zhifeng Yang, Quanqing Xu, Shanyan Gao, Chuanhui Yang, Yuzhong Zhao, Fanyu Kong 0004, Wanhong Wang, Jinliang Xiao
Proc. VLDB Endow.9
2022 CGM2: Carrier-Grade Minimalism Multicast with Stateless Explicit Path
abstract
Group communication is a one-to-many communication pattern that distributes data from one sender to multiple receivers. Multicast as a group communication method is extensively employed in content distribution scenarios, such as IP-based cable TV, live streaming, video conference, data delivery, etc. Since application-layer multicast cannot touch network elements, it suffers from inefficient network utilization. Some existing network-assisted multicast are limited by scalability issues caused by the inability to maintain a sharply increased per-flow state in individual network elements. Moreover, existing network-assisted multicast is unable to meet the newly emerging need, such as load balancing and traffic engineering. This paper presents a novel multicast technique called Carrier-Grade Minimalism Multicast (CGM2). Through a string of bits, the bitmap, nodes are instructed to locally replicate packets and forward them over several interfaces without maintaining a per-flow state. Bitmaps of nodes along the multicast path are encapsulated in the recursive format as a binary in-packet tree for explicit forwarding path.
Junjie Wan, Fengkai Li, Wanhong Wang
HPSR5
2021 Towards highly scalable multicast via explicit path definition
abstract
Group communication is a communication pattern where data is distributed from one sender to many receivers. It is widely applied in content distribution scenarios, such as IPTV, live streaming, video conference, data delivery, and others. Multicast is an efficient one-to-many data distribution method. However, application-layer multicast still has problems of inefficient network utilization as it is not allowed to control network elements. Existing network assisted multicast is unable to meet the newly emerging demand, such as multicast traffic engineering and load balancing. Some implementations of network assisted multicast are also limited to scalability issues caused by limitations of per-flow state maintained in network elements. In this paper, we introduce a novel multicast technology called Carrier-Grade Minimalism Multicast (CGMM) which leverages a string of bits, the bitmap, to instruct node to locally duplicate packets and forward them over several links without per-flow state and encapsulates bitmaps as binary in-packet tree for explicit forwarding path.
Junjie Wan, Wanhong Wang
CoNEXT4