Dapeng Huang

dblp:09/8525 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
3since 2021 · last 2023
—ORCID · conflict

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

Databases, data management, data science and information retrieval · 2 · 2 since 2021Systems, architecture and hardware · 1Computer networks · 1 · 1 since 2021Security and privacy · 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
Database system architecture and tuning · 38% Distributed and cloud data management · 38% Transaction processing and concurrency control · 12%
Software engineering, system software, and programming languages
1 paper
Operating systems · 67% Compilers and program optimization · 33%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 50% Parallel and multicore computing · 50%

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

TopicWeightPapersLastEvidence papers
Distributed and cloud data management › cloud database
cloud-native database
0.712023
PolarDB-IMCI: A Cloud-Native HTAP Database System at Alibaba · Proc. ACM Manag. Data 2023
Database system architecture and tuning
hybrid transactional and analytical processing
0.712023
PolarDB-IMCI: A Cloud-Native HTAP Database System at Alibaba · Proc. ACM Manag. Data 2023
Query processing and optimization
OLAP
0.212023
PolarDB-IMCI: A Cloud-Native HTAP Database System at Alibaba · Proc. ACM Manag. Data 2023
Transaction processing and concurrency control
OLTP
0.212023
PolarDB-IMCI: A Cloud-Native HTAP Database System at Alibaba · Proc. ACM Manag. Data 2023
Operating systems › resource management › memory management › virtual memory
paging
0.112010
Improving host swapping using adaptive prefetching and paging notifier · HPDC 2010
Compilers and program optimization
prefetching
0.112010
Improving host swapping using adaptive prefetching and paging notifier · HPDC 2010
Operating systems › resource management › memory management
virtual memory
0.112010
Improving host swapping using adaptive prefetching and paging notifier · HPDC 2010
Parallel and multicore computing › concurrent data structures
memory reclamation
0.112010
Improving host swapping using adaptive prefetching and paging notifier · HPDC 2010
Cloud and datacenter computing
virtualization
0.112010
Improving host swapping using adaptive prefetching and paging notifier · HPDC 2010

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

paging notification · 0.2adaptive prefetching · 0.2
YearPublicationVenuePosition
2023 PolarDB-IMCI: A Cloud-Native HTAP Database System at Alibaba
abstract
Cloud-native databases have become the de-facto choice for mission-critical applications on the cloud due to the need for high availability, resource elasticity, and cost efficiency. Meanwhile, driven by the increasing connectivity between data generation and analysis, users prefer a single database to efficiently process both OLTP and OLAP workloads, which enhances data freshness and reduces the complexity of data synchronization and the overall business cost. In this paper, we summarize five crucial design goals for a cloud-native HTAP database based on our experience and customers' feedback, i.e., transparency, competitive OLAP performance, minimal perturbation on OLTP workloads, high data freshness, and excellent resource elasticity. As our solution to realize these goals, we present PolarDB-IMCI, a cloud-native HTAP database system designed and deployed at Alibaba Cloud. Our evaluation results show that PolarDB-IMCI is able to handle HTAP efficiently on both experimental and production workloads; notably, it speeds up analytical queries up to ×149 on TPC-H (100GB). PolarDB-IMCI introduces low visibility delay and little performance perturbation on OLTP workloads (<5%), and resource elasticity can be achieved by scaling out in tens of seconds.
Tongliang Li, Haoze Song, Xinjun Yang, Wenchao Zhou, Feifei Li 0001, Baoyue Yan, Qianqian Wu 0007, Yukun Liang, Chengjun Ying, Baokai Chen, Yubin Ruan, Xiaoyi Weng, Shibin Chen, Chengzhong Yang, Hongyan Xing, Nanlong Yu, Dapeng Huang, Jianling Sun
Proc. ACM Manag. Data23
2022 A Large-scale Empirical Analysis of Ransomware Activities in Bitcoin
abstract
Exploiting the anonymous mechanism of Bitcoin, ransomware activities demanding ransom in bitcoins have become rampant in recent years. Several existing studies quantify the impact of ransomware activities, mostly focusing on the amount of ransom. However, victims’ reactions in Bitcoin that can well reflect the impact of ransomware activities are somehow largely neglected. Besides, existing studies track ransom transfers at the Bitcoin address level, making it difficult for them to uncover the patterns of ransom transfers from a macro perspective beyond Bitcoin addresses. In this article, we conduct a large-scale analysis of ransom payments, ransom transfers, and victim migrations in Bitcoin from 2012 to 2021. First, we develop a fine-grained address clustering method to cluster Bitcoin addresses into users, which enables us to identify more addresses controlled by ransomware criminals. Second, motivated by the fact that Bitcoin activities and their participants already formed stable industries, such as Darknet and Miner , we train a multi-label classification model to identify the industry identifiers of users. Third, we identify ransom payment transactions and then quantify the amount of ransom and the number of victims in 63 ransomware activities. Finally, after we analyze the trajectories of ransom transferred across different industries and track victims’ migrations across industries, we find out that to obscure the purposes of their transfer trajectories, most ransomware criminals (e.g., operators of Locky and Wannacry) prefer to spread ransom into multiple industries instead of utilizing the services of Bitcoin mixers. Compared with other industries, Investment is highly resilient to ransomware activities in the sense that the number of users in Investment remains relatively stable. Moreover, we also observe that a few victims become active in the Darknet after paying ransom. Our findings in this work can help authorities deeply understand ransomware activities in Bitcoin. While our study focuses on ransomware, our methods are potentially applicable to other cybercriminal activities that have similarly adopted bitcoins as their payments.
Kai Wang 0062, Jun Pang 0001, Dingjie Chen, Dapeng Huang, Chen Chen 0112, Weili Han
ACM Trans. Web5
2021 Temporal Networks Based Industry Identification for Bitcoin Users
Weili Han, Dingjie Chen, Jun Pang 0001, Kai Wang 0062, Chen Chen 0112, Dapeng Huang, Zhijie Fan
WASA (1)6
2020 Automated Enforcement of the Principle of Least Privilege over Data Source Access
abstract
The state-of-the-art database-backed web applications usually assign full privileges to connections between applications and data sources. This phenomenon, which would enable a malicious attacker to easily compromise the applications through arbitrarily manipulating the data sources without the restriction of privileges, seriously breaks the principle of least privilege (PLP), a fundamental law of system security. Motivated to counter this problem, we propose a framework PDA (PLP over Data source Access) to automatically enforce this principle over data source access based on application-driven privilege separation. Our proposed PDA contributes from the following aspects: i) PDA achieves the privilege separation by intercepting database queries and enforcing privileged connections to database for each database query; ii) PDA can effectively defend against SQL-based vulnerabilities including buggy queries and SQL injection attacks. Lastly, we evaluate PDA on a widely used application platform, JForum, to demonstrate the effectiveness of PDA with a promising performance overhead of 8.13%.
Haoqi Wu, Zhengxuan Yu, Dapeng Huang, Weili Han
TrustCom3
2010 Improving host swapping using adaptive prefetching and paging notifier
abstract
In a virtualized system, the hypervisor may be forced to reclaim memory by swapping out pages of guest operating systems (OSes) when the regular memory balancing mechanisms, such as page sharing and ballooning, fail to revoke enough memory for reallocation purpose, which always leads to serious performance degradation. In this paper, we introduce Adaptive Swap Prefetcher (ASP) and Host Swapping Notifier (HSN), the effective and lightweight solutions to gracefully reduce the degradation in system performance when host swapping is triggered. ASP smartly prefetches more pages from the host swap file as long as the good spatial locality persists so as to reduce disk transfers. The guest OS will be notified by HSN when the hypervisor evicts pages, which then hides those pages from its memory reclamation routines to eliminate unnecessary guest swapping and to prevent the occurrence of double paging anomaly. Currently ASP and HSN are implemented in KVM, experimental results show that guest performance can be improved by a factory of 1.4x and 2x respectively using ASP and HSN.
Wenzhi Chen, Huijun Chen, Xiaoqin Chen, Dapeng Huang
HPDC5