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.

Alexander W. Lee

dblp:320/4218 · DBLP profile ↗
← Back
6ranked-venue papers
3as first author
6since 2021 · last 2026
—ORCID · conflict

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

Databases, data management, data science and information retrieval · 3 · 1 first-author · 3 since 2021Security and privacy · 2 · 1 first-author · 2 since 2021Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 1 since 2021

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
Query processing and optimization · 36% Database theory · 28% Machine learning and data management · 28%
Theoretical computer science
1 paper
Algorithms and data structures · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 100%

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

TopicWeightPapersLastEvidence papers
Database theory › integrity constraints
semantic integrity constraints
0.912025
Semantic Integrity Constraints: Declarative Guardrails for AI-Augmented Data Processing Systems · Proc. VLDB Endow. 2025
Query processing and optimization
semantic query processing
0.912025
Semantic Integrity Constraints: Declarative Guardrails for AI-Augmented Data Processing Systems · Proc. VLDB Endow. 2025
Parallel and multicore computing
parallel algorithms
0.612022
A Scalable Parallel Algorithm for Balanced Sampling (Student Abstract) · AAAI 2022
Algorithms and data structures
parallel algorithms
0.612022
A Scalable Parallel Algorithm for Balanced Sampling (Student Abstract) · AAAI 2022
Algorithms and data structures › randomized algorithms
sampling
0.612022
A Scalable Parallel Algorithm for Balanced Sampling (Student Abstract) · AAAI 2022
Transaction processing and concurrency control › data integrity
integrity constraint enforcement
0.312025
Semantic Integrity Constraints: Declarative Guardrails for AI-Augmented Data Processing Systems · Proc. VLDB Endow. 2025
Query processing and optimization
query planning
0.312025
Semantic Integrity Constraints: Declarative Guardrails for AI-Augmented Data Processing Systems · Proc. VLDB Endow. 2025

Methods — techniques the papers use, named apart from their topics

stratified sampling · 1.1cube method · 1.1large language model · 0.9
YearPublicationVenuePosition
2026 Making Prompts First-Class Citizens for Adaptive LLM Pipelines
Ugur Çetintemel, Alexander W. Lee, Deepti Raghavan, Duo Lu, Andrew Crotty
CIDR3
2025 Measuring Fall Risk Using the Internet-of-Things Chair
Alexander W. Lee, Melissa S. Lee, Chelsea Yeh, Kyle Yeh
IoTBDS1
2025 Semantic Integrity Constraints: Declarative Guardrails for AI-Augmented Data Processing Systems
abstract
AI-augmented data processing systems (DPSs) integrate large language models (LLMs) into query pipelines, allowing powerful semantic operations on structured and unstructured data. However, the reliability (a.k.a. trust) of these systems is fundamentally challenged by the potential for LLMs to produce errors, limiting their adoption in critical domains. To help address this reliability bottleneck, we introduce semantic integrity constraints (SICs) —a declarative abstraction for specifying and enforcing correctness conditions over LLM outputs in semantic queries. SICs generalize traditional database integrity constraints to semantic settings, supporting common types of constraints, such as grounding, soundness, and exclusion, with both reactive and proactive enforcement strategies. We argue that SICs provide a foundation for building reliable and auditable AI-augmented data systems. Specifically, we present a system design for integrating SICs into query planning and runtime execution and discuss its realization in AI-augmented DPSs. To guide and evaluate our vision, we outline several design goals—covering criteria around expressiveness, runtime semantics, integration, performance, and enterprise-scale applicability—and discuss how our framework addresses each, along with open research challenges.
Alexander W. Lee, Justin Chan, Nicolas Kim, Akshay Mehta, Deepti Raghavan, Ugur Çetintemel
Proc. VLDB Endow.1
2023 ROhAN: Row-order agnostic null models for statistically-sound knowledge discovery
Maryam Abuissa, Alexander W. Lee, Matteo Riondato
Data Min. Knowl. Discov.2
2022 A Scalable Parallel Algorithm for Balanced Sampling (Student Abstract)
abstract
We present a novel parallel algorithm for drawing balanced samples from large populations. When auxiliary variables about the population units are known, balanced sampling improves the quality of the estimations obtained from the sample. Available algorithms, e.g., the cube method, are inherently sequential, and do not scale to large populations. Our parallel algorithm is based on a variant of the cube method for stratified populations. It has the same sample quality as sequential algorithms, and almost ideal parallel speedup.
Alexander W. Lee, Stefan Walzer-Goldfeld, Shukry Zablah, Matteo Riondato
AAAI1
2022 Internet-of-Things Management of Medical Chairs and Wheelchairs
Chelsea Yeh, Alexander W. Lee, Hudson Kaleb Kalaw Dy, Karin C. Li
IoTBDS2