activity
20162026
most citedSpitz: A Verifiable Database System

32 citations · 81 across the 13 of their papers we have counts for

collaborators

14 papers

cs.CV2026

AnesTRACE: Benchmarking Intraoperative Anesthesia from Multimodal Perception to Multi-step Decision-Making

Ziwei Huang, Qi Gao, Zhe Ji +5

Intraoperative anesthesia requires systems to interpret evolving multimodal evidence, recommend timely management, and revise decisions as patient states change, yet existing bench…

cs.DB2026

From Schema to Signal: Retrieval-Augmented Modeling for Relational Data Analytics

Lingze Zeng, Shaofeng Cai, Changshuo Liu +3

Relational data stored in RDBMS is foundational to many real-world applications across domains such as e-commerce, finance, and sociality. While deep neural networks (DNNs) have ac…

cs.IR2026

FAVOR: Efficient Filter-Agnostic Vector ANNS Based on Selectivity-Aware Exclusion Distances

Junjie Song, Yu Liu, Guoyu Hu +4

Modern retrieval systems increasingly require integrating approximate nearest neighbor search (ANNS) with complex attribute filtering to handle hybrid queries in applications such…

cs.DB2026

Towards Effective Orchestration of AI x DB Workloads

Naili Xing, Haotian Gao, Zhanhao Zhao +6

AI-driven analytics are increasingly crucial to data-centric decision-making. Executing relational and AI operators in separate runtimes prevents the database optimizer and runtime…

cs.DB2025★ 5 cited

HAKES: Scalable Vector Database for Embedding Search Service

Guoyu Hu, Shaofeng Cai, Tien Tuan Anh Dinh +4

Modern deep learning models capture the semantics of complex data by transforming them into high-dimensional embedding vectors. Emerging applications, such as retrieval-augmented g…

cs.DB2024★ 3 cited

A Comprehensive Study of Shapley Value in Data Analytics

Hong Lin, Shixin Wan, Zhongle Xie +4

Over the recent years, Shapley value (SV), a solution concept from cooperative game theory, has found numerous applications in data analytics (DA). This paper presents the first co…

cs.DB2022★ 2 cited

GlassDB: An Efficient Verifiable Ledger Database System Through Transparency

Cong Yue, Tien Tuan Anh Dinh, Zhongle Xie +4

Verifiable ledger databases protect data history against malicious tampering. Existing systems, such as blockchains and certificate transparency, are based on transparency logs --…

cs.LG2021

A Survey on Deep Reinforcement Learning for Data Processing and Analytics

Qingpeng Cai, Can Cui, Yiyuan Xiong +3

Data processing and analytics are fundamental and pervasive. Algorithms play a vital role in data processing and analytics where many algorithm designs have incorporated heuristics…

cs.DB2020★ 32 cited

Spitz: A Verifiable Database System

Meihui Zhang, Zhongle Xie, Cong Yue +1

Databases in the past have helped businesses maintain and extract insights from their data. Today, it is common for a business to involve multiple independent, distrustful parties.…

cs.DB2020

ForkBase: Immutable, Tamper-evident Storage Substrate for Branchable Applications

Qian Lin, Kaiyuan Yang, Tien Tuan Anh Dinh +8

Data collaboration activities typically require systematic or protocol-based coordination to be scalable. Git, an effective enabler for collaborative coding, has been attested for…

cs.DB2020

Analysis of Indexing Structures for Immutable Data

Cong Yue, Zhongle Xie, Meihui Zhang +4

In emerging applications such as blockchains and collaborative data analytics, there are strong demands for data immutability, multi-version accesses, and tamper-evident controls.…

cs.DB2018★ 24 cited

ForkBase: An Efficient Storage Engine for Blockchain and Forkable Applications

Sheng Wang, Tien Tuan Anh Dinh, Qian Lin +7

Existing data storage systems offer a wide range of functionalities to accommodate an equally diverse range of applications. However, new classes of applications have emerged, e.g.…

cs.DB2017★ 11 cited

UStore: A Distributed Storage With Rich Semantics

Anh Dinh, Ji Wang, Sheng Wang +9

Today's storage systems expose abstractions which are either too low-level (e.g., key-value store, raw-block store) that they require developers to re-invent the wheels, or too hig…

cs.DB2016★ 4 cited

PI : a Parallel in-memory skip list based Index

Zhongle Xie, Qingchao Cai, H. V. Jagadish +2

Due to the coarse granularity of data accesses and the heavy use of latches, indices in the B-tree family are not efficient for in-memory databases, especially in the context of to…