activity
20192026
most citedAn Empirical Analysis of Just-in-Time Compilation in Modern Databases

7 citations · 10 across the 8 of their papers we have counts for

collaborators

8 papers

cs.DB2026

Efficient -core Computation and On-the-fly Query at Billion Scale with GPUs

Qingshuai Feng, Shunyang Li, Kai Wang +3

In bipartite graphs, -core is a widely used model for cohesive subgraph mining. Specifically, an -core is a maximal subgraph in which each vertex in the upper layer h…

cs.DC2025

Learning from the Past: Adaptive Parallelism Tuning for Stream Processing Systems

Yuxing Han, Lixiang Chen, Haoyu Wang +5

Distributed stream processing systems rely on the dataflow model to define and execute streaming jobs, organizing computations as Directed Acyclic Graphs (DAGs) of operators. Adjus…

cs.DB2024

Batch Hop-Constrained s-t Simple Path Query Processing in Large Graphs

Long Yuan, Kongzhang Hao, Xuemin Lin +1

Hop-constrained s-t simple path (HC-s-t path) enumeration is a fundamental problem in graph analysis. Existing solutions for this problem focus on optimizing the processing perform…

cs.DB2023★ 7 cited

An Empirical Analysis of Just-in-Time Compilation in Modern Databases

Miao Ma, Zhengyi Yang, Kongzhang Hao +3

JIT (Just-in-Time) technology has garnered significant attention for improving the efficiency of database execution. It offers higher performance by eliminating interpretation over…

cs.CL2023

Weighted Sampling for Masked Language Modeling

Linhan Zhang, Qian Chen, Wen Wang +5

Masked Language Modeling (MLM) is widely used to pretrain language models. The standard random masking strategy in MLM causes the pre-trained language models (PLMs) to be biased to…

cs.DB2021★ 3 cited

HUGE: An Efficient and Scalable Subgraph Enumeration System

Zhengyi Yang, Longbin Lai, Xuemin Lin +2

Subgraph enumeration is a fundamental problem in graph analytics, which aims to find all instances of a given query graph on a large data graph. In this paper, we propose a system…

cs.CL2020

Taming the Expressiveness and Programmability of Graph Analytical Queries

Lu Qin, Longbin Lai, Kongzhang Hao +6

Graph database has enjoyed a boom in the last decade, and graph queries accordingly gain a lot of attentions from both the academia and industry. We focus on analytical queries in…

cs.DB2019

A Survey and Experimental Analysis of Distributed Subgraph Matching

Longbin Lai, Zhu Qing, Zhengyi Yang +10

Recently there emerge many distributed algorithms that aim at solving subgraph matching at scale. Existing algorithm-level comparisons failed to provide a systematic view to the pr…