Qi Zhang

Qi Zhang

Auto-generated profile, based on publicly available information

Qi Zhang

Hong Kong Baptist University Kowloon Tong Hong Kong

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
15 January 2020 in IEEE Transactions on Services Computing
Verified
Journal Article
Closed access
Abbas YazdinejadAbbas Yazdinejad
Abbas Yazdinejad
RPReza Parizi
Reza Parizi
ATAli Dehghan Tanha
Ali Dehghan Tanha
QZQi Zhang
Qi Zhang
KCKim-Kwang Raymond Choo
Kim-Kwang Raymond Choo

1 March 2019 in IBM Journal of Research and Development
Verified
Journal Article
Closed access
DDD. N. Dillenberger
D. N. Dillenberger
PNP. Novotny
P. Novotny
QZQ. Zhang
Q. Zhang
PJP. Jayachandran
P. Jayachandran
HGH. Gupta
H. Gupta
KSK. Sarpatwar
K. Sarpatwar

20 July 2020 in IEEE Transactions on Emerging Topics in Computing
Verified
Journal Article
Closed access
WWWenqi Wei
Wenqi Wei
QZQi Zhang
Qi Zhang
LLLing Liu
Ling Liu
Bitcoin and its decentralized computing paradigm for digital currency trading are one of the most disruptive technology in the 21st century. This paper presents a novel approach to developing a Bitcoin transaction forecast model, DLForecast, by leveraging deep neural networks for learning Bitcoin transaction network representations. DLForecast makes three original contributions. First, we explore three interesting properties between Bitcoin transaction accounts: topological connectivity pattern of Bitcoin accounts, transaction amount pattern, and transaction dynamics. Second, we construct a time-decaying reachability graph and a time-decaying transaction pattern graph, aiming at capturing different types of spatial-temporal Bitcoin transaction patterns. Third, we employ node embedding on both graphs and develop a Bitcoin transaction forecasting system between user accounts based on historical transactions with built-in time-decaying factor. To maintain an effective transaction forecasting performance, we leverage the multiplicative model update (MMU) ensemble to combine prediction models built on different transaction features extracted from each corresponding Bitcoin transaction graph. Evaluated on real-world Bitcoin transaction data, we show that our spatial-temporal forecasting model is efficient with fast runtime and effective with forecasting accuracy over 60% and improves the prediction performance by 50% when compared to forecasting model built on the static graph baseline.

22 June 2018
Verified
Book Chapter
Closed access
PDF file
QZQi Zhang
Qi Zhang
PNPetr Novotny
Petr Novotny
SBSalman Baset
Salman Baset
DDDonna Dillenberger
Donna Dillenberger
ABArtem Barger
Artem Barger
YMYacov Manevich
Yacov Manevich

28 April 2020 in GeoInformatica
Verified
Journal Article
Closed access
PDF file
PZPeng Zhao
Peng Zhao
WRWeixiong Rao
Weixiong Rao
CZChengxi Zhang
Chengxi Zhang
GSGong Su
Gong Su
QZQi Zhang
Qi Zhang

7 November 2019 in arXiv
Verified
Preprint
Open access
PDF file
YTYuzhe Tang
Yuzhe Tang
JCJu Chen
Ju Chen
KLKai Li
Kai Li
JXJianliang Xu
Jianliang Xu
QZQi Zhang
Qi Zhang
Authenticated data storage on an untrusted platform is an important computing paradigm for cloud applications ranging from big-data outsourcing, to cryptocurrency and certificate transparency log. These modern applications increasingly feature update-intensive workloads, whereas existing authenticated data structures (ADSs) designed with in-place updates are inefficient to handle such workloads. In this paper, we address this issue and propose a novel authenticated log-structured merge tree (eLSM) based key-value store by leveraging Intel SGX enclaves. We present a system design that runs the code of eLSM store inside enclave. To circumvent the limited enclave memory (128 MB with the latest Intel CPUs), we propose to place the memory buffer of the eLSM store outside the enclave and protect the buffer using a new authenticated data structure by digesting individual LSM-tree levels. We design protocols to support query authentication in data integrity, completeness (under range queries), and freshness. The proof in our protocol is made small by including only the Merkle proofs at selective levels. We implement eLSM on top of Google LevelDB and Facebook RocksDB with minimal code change and performance interference. We evaluate the performance of eLSM under the YCSB workload benchmark and show a performance advantage of up to 4.5X speedup.