2 citations · 2 across the 17 of their papers we have counts for
18 papers
Time-Decayed Vector Search in the Rhythm of TANGO: Jointly Modeling Semantic Similarity and Temporal Freshness
Jiuqi Wei, Qiyao Luo, Quanqing Xu +2
Vector search typically measures relevance through semantic similarity under a fixed scoring function. However, in a growing range of applications, relevance may evolve over time,…
DocMaster: A Hierarchical Structure-Aware System for Document Analysis
Ziqi Chen, Yingli Zhou, Fangyuan Zhang +3
Leveraging large language models (LLMs) to analyze complex documents -- such as academic papers, technical manuals, and financial reports -- has emerged as a mainstream and critica…
HETERQA: Benchmarking Record Retrieval over Multiple Heterogeneous Sources
Yaodong Su, Hanchang Li, Quanqing Xu +2
In emerging systems (e.g., social media and e-commerce platforms), data records are often drawn from heterogeneous sources, such as relational tables, text documents, image reposit…
CSAttention: Centroid-Scoring Attention for Accelerating LLM Inference
Chuxu Song, Zhencan Peng, Jiuqi Wei +1
Long-context LLMs increasingly rely on extended, reusable prefill prompts for agents and domain Q&A, pushing attention and KV-cache to become the dominant decode-time bottlenecks.…
PDET-LSH: Scalable In-Memory Indexing for High-Dimensional Approximate Nearest Neighbor Search with Quality Guarantees
Jiuqi Wei, Xiaodong Lee, Botao Peng +3
Locality-sensitive hashing (LSH) is a well-known solution for approximate nearest neighbor (ANN) search with theoretical guarantees. Traditional LSH-based methods mainly focus on i…
TaCo: Data-adaptive and Query-aware Subspace Collision for High-dimensional Approximate Nearest Neighbor Search
Jiuqi Wei, Zhenyu Liao, Ruoyu Han +3
Approximate Nearest Neighbor Search (ANNS) in high-dimensional Euclidean spaces is a fundamental problem with broad applications. Subspace Collision is a newly proposed ANNS framew…
MCI-SQL: Text-to-SQL with Metadata-Complete Context and Intermediate Correction
Qin Wang, Youhuan Li, Suixi Lin +5
Text-to-SQL aims to translate natural language queries into SQL statements. Existing methods typically follow a pipeline of pre-processing, schema linking, candidate SQL generation…
The Virtuous Cycle: AI-Powered Vector Search and Vector Search-Augmented AI
Jiuqi Wei, Quanqing Xu, Chuanhui Yang
Modern AI and vector search are rapidly converging, forming a promising research frontier in intelligent information systems. On one hand, advances in AI have substantially improve…
A Tree-Structured Two-Phase Commit Framework for OceanBase: Optimizing Scalability and Consistency
Quanqing Xu, Chen Qian, Chuanhui Yang +4
Modern distributed databases face challenges in achieving transactional consistency across distributed partitions. Traditional two-phase commit (2PC) protocols incur high coordinat…
OceanBase Bacchus: a High-Performance and Scalable Cloud-Native Shared Storage Architecture for Multi-Cloud
Quanqing Xu, Mingqiang Zhuang, Chuanhui Yang +6
Although an increasing number of databases now embrace shared-storage architectures, current storage-disaggregated systems have yet to strike an optimal balance between cost and pe…
Building an OceanBase-based Distributed Nearly Real-time Analytical Processing Database System
Quanqing Xu, Chuanhui Yang, Ruijie Li +11
The growing demand for database systems capable of efficiently managing massive datasets while delivering real-time transaction processing and advanced analytical capabilities has…
LakeHopper: Knowledge-Aware Adaptation of Column Type Annotators across Data Lakes
Yushi Sun, Xujia Li, Nan Tang +3
Column Type Annotation (CTA), which assigns a semantic type to a table column, underpins data integration, cleaning, and search over data lakes. State-of-the-art annotators are pre…
A High-Throughput GPU Framework for Adaptive Lossless Compression of Floating-Point Data
Zheng Li, Weiyan Wang, Ruiyuan Li +5
The torrential influx of floating-point data from domains like IoT and HPC necessitates high-performance lossless compression to mitigate storage costs while preserving absolute da…
Rethinking LSM-tree based Key-Value Stores: A Survey
Yina Lv, Qiao Li, Quanqing Xu +4
LSM-tree is a widely adopted data structure in modern key-value store systems that optimizes write performance in write-heavy applications by using append writes to achieve sequent…
Clue-RAG: Towards Accurate and Cost-Efficient Graph-based RAG via Multi-Partite Graph and Query-Driven Iterative Retrieval
Yaodong Su, Yixiang Fang, Yingli Zhou +2
Despite the remarkable progress of Large Language Models (LLMs), their performance in question answering (QA) remains limited by the lack of domain-specific and up-to-date knowledg…
FedAPM: Federated Learning via ADMM with Partial Model Personalization
Shengkun Zhu, Feiteng Nie, Jinshan Zeng +6
In federated learning (FL), the assumption that datasets from different devices are independent and identically distributed (i.i.d.) often does not hold due to user differences, an…
Hound: Hunting Supervision Signals for Few and Zero Shot Node Classification on Text-attributed Graph
Yuxiang Wang, Xiao Yan, Shiyu Jin +6
Text-attributed graph (TAG) is an important type of graph structured data with text descriptions for each node. Few- and zero-shot node classification on TAGs have many application…
Generative and Contrastive Paradigms Are Complementary for Graph Self-Supervised Learning
Yuxiang Wang, Xiao Yan, Chuang Hu +5
For graph self-supervised learning (GSSL), masked autoencoder (MAE) follows the generative paradigm and learns to reconstruct masked graph edges or node features. Contrastive Learn…