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

Hua Luan

dblp:79/6917 · DBLP profile ↗
← Back
7ranked-venue papers
4as first author
0since 2021 · last 2020
—ORCID · none

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

Databases, data management, data science and information retrieval · 3 · 1 first-authorArtificial intelligence and machine learning · 2Systems, architecture and hardware · 2 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 2 · 2 first-author

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
Data mining · 60% Data stream processing · 40%

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

TopicWeightPapersLastEvidence papers
Data mining › pattern mining › sequential pattern mining
closed sequential pattern mining
0.112008
SeqStream: Mining Closed Sequential Patterns over Stream Sliding Windows · ICDM 2008
Data mining
pattern mining
0.112008
SeqStream: Mining Closed Sequential Patterns over Stream Sliding Windows · ICDM 2008
Data mining › pattern mining
sequential pattern mining
0.112008
SeqStream: Mining Closed Sequential Patterns over Stream Sliding Windows · ICDM 2008
Data stream processing › continuous query processing
sliding window
0.112008
SeqStream: Mining Closed Sequential Patterns over Stream Sliding Windows · ICDM 2008
Data stream processing
stream mining
0.112008
SeqStream: Mining Closed Sequential Patterns over Stream Sliding Windows · ICDM 2008
YearPublicationVenuePosition
2020 Optimizing B+-Tree Searches on Coupled CPU-GPU Architectures
Hua Luan
ICA3PP (1)2
2017 An evaluation of analytical queries on CPUs and coupled GPUs
abstract
Summary Recently, the mainstream hardware vendors such as Intel and AMD have made significant efforts to integrate the central processing unit (CPU) and the graphics processing unit (GPU) into a single chip, which forms a coupled CPU‐GPU architecture. Data transfer between the CPU and the GPU through a Peripheral Component Interconnect Express bus is eliminated on this architecture, which provides new opportunities for database community to optimize query processing. Because of the lack of comprehensive evaluation of database systems on coupled CPU‐GPU platforms, it is difficult for academic and industry researchers to make appropriate decisions on improvement and optimization directions. In this paper, we conduct an extensive experimental study to evaluate an online analytical processing system on Intel and AMD machines. The performance difference is measured and analyzed when executing queries on integrated GPUs and multicore CPUs. The impacts of various parameters, data sizes, and optimization techniques on performance are also investigated. The results provide preliminary insights into database query and operator behaviors on state‐of‐the‐art coupled CPU‐GPU architectures.
Hua Luan, Lei Chang
Concurr. Comput. Pract. Exp.1
2009 Efficient algorithms for incremental maintenance of closed sequential patterns in large databases
Lei Chang, Tengjiao Wang 0003, Dongqing Yang, Hua Luan, Shiwei Tang
Data Knowl. Eng.4
2009 Prefetching J+-Tree: A Cache-Optimized Main Memory Database Index Structure
Hua Luan, Xiaoyong Du 0001, Shan Wang 0001
J. Comput. Sci. Technol.1
2009 Cache-Conscious Data Cube Computation on a Modern Processor
Hua Luan, Xiaoyong Du 0001, Shan Wang 0001
J. Comput. Sci. Technol.1
2008 SeqStream: Mining Closed Sequential Patterns over Stream Sliding Windows
abstract
Previous studies have shown mining closed patterns provides more benefits than mining the complete set of frequent patterns, since closed pattern mining leads to more compact results and more efficient algorithms. It is quite useful in a data stream environment where memory and computation power are major concerns. This paper studies the problem of mining closed sequential patterns over data stream sliding windows. A synopsis structure IST (Inverse Closed Sequence Tree) is designed to keep inverse closed sequential patterns in current window. An efficient algorithm SeqStream is developed to mine closed sequential patterns in stream windows incrementally, and various novel strategies are adopted in SeqStream to prune search space aggressively. Extensive experiments on both real and synthetic data sets show that SeqStream outperforms PrefixSpan, CloSpan and BIDE by a factor of about one to two orders of magnitude.
Lei Chang, Tengjiao Wang 0003, Dongqing Yang, Hua Luan
ICDM4
2007 J+-Tree: A New Index Structure in Main Memory
Hua Luan, Xiaoyong Du 0001, Shan Wang 0001, Yongzhi Ni
DASFAA1