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

Liana Patel

dblp:284/0680 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
5since 2021 · last 2025
0000-0003-3464-9556ORCID · reported

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

Databases, data management, data science and information retrieval · 4 · 2 first-author · 4 since 2021Software engineering, systems software and programming languages · 1 · 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
3 papers
Information retrieval · 54% Query processing and optimization · 29% Indexing and storage engines · 13%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%
Network and information security
1 paper
Privacy and data protection · 100%

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

TopicWeightPapersLastEvidence papers
Information retrieval
retrieval models
0.912025
Compass: Encrypted Semantic Search with High Accuracy · OSDI 2025
Query processing and optimization › semantic query processing
semantic query optimization
0.912025
Semantic Operators and Their Optimization: Towards AI-Based Data Analytics with Accuracy Guarantees · Proc. VLDB Endow. 2025
Information retrieval › search engines
semantic search
0.912025
Compass: Encrypted Semantic Search with High Accuracy · OSDI 2025
Privacy and data protection › privacy-preserving search
encrypted search
0.912025
Compass: Encrypted Semantic Search with High Accuracy · OSDI 2025
Information retrieval › similarity search › nearest neighbor search
approximate nearest neighbor search
0.812024
ACORN: Performant and Predicate-Agnostic Search Over Vector Embeddings and Structured Data · Proc. ACM Manag. Data 2024
Information retrieval
hybrid search
0.812024
ACORN: Performant and Predicate-Agnostic Search Over Vector Embeddings and Structured Data · Proc. ACM Manag. Data 2024
Indexing and storage engines
vector index
0.812024
ACORN: Performant and Predicate-Agnostic Search Over Vector Embeddings and Structured Data · Proc. ACM Manag. Data 2024
Distributed systems › fault tolerance
byzantine fault tolerance
0.712023
Saguaro: An Edge Computing-Enabled Hierarchical Permissioned Blockchain · ICDE 2023
Distributed systems
fault tolerance
0.712023
Saguaro: An Edge Computing-Enabled Hierarchical Permissioned Blockchain · ICDE 2023
Distributed systems › blockchain
permissioned blockchain
0.712023
Saguaro: An Edge Computing-Enabled Hierarchical Permissioned Blockchain · ICDE 2023
Graph data management
graph indexing
0.212024
ACORN: Performant and Predicate-Agnostic Search Over Vector Embeddings and Structured Data · Proc. ACM Manag. Data 2024
Edge and fog computing
edge networks
0.212023
Saguaro: An Edge Computing-Enabled Hierarchical Permissioned Blockchain · ICDE 2023

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

statistical accuracy guarantees · 1.7large language model · 1.7predicate subgraph traversal · 0.8HNSW · 0.8
YearPublicationVenuePosition
2025 Text2SQL is Not Enough: Unifying AI and Databases with TAG
Asim Biswal, Siddharth Jha, Carlos Guestrin, Matei Zaharia, Joseph Gonzalez 0001, Amog Kamsetty, Liana Patel
CIDR8
2025 Compass: Encrypted Semantic Search with High Accuracy
Jinhao Zhu, Liana Patel, Matei Zaharia, Raluca A. Popa
OSDI2
2025 Semantic Operators and Their Optimization: Towards AI-Based Data Analytics with Accuracy Guarantees
abstract
The semantic capabilities of large language models (LLMs) have the potential to enable rich analytics and reasoning over vast knowledge corpora. Unfortunately, existing systems either empirically optimize expensive LLM-powered operations with no performance guarantees , or limit their support to simple batched-inference primitives. We introduce semantic operators , the first formalism with statistical accuracy guarantees for general-purpose AI-based operations with natural language parameters (e.g., filtering, sorting, joining or aggregating records using natural language criteria). Each operator can be implemented by multiple AI algorithms , which compose individual model invocations to orchestrate the model over the data. Our programming model specifies the expected behavior of each operator with a high-quality reference algorithm , and we develop an optimization framework that reduces cost, while providing accuracy guarantees for individual operators. Using this approach, we propose several novel optimizations to accelerate semantic filtering, joining, group-by and top-k operations by up to 1, 000×. We implement semantic operators in the LOTUS system and demonstrate LOTUS' effectiveness on real, bulk-semantic processing applications, including fact-checking, biomedical multi-label classification, search, and topic analysis. We show that the semantic operator model is expressive, capturing state-of-the-art AI pipelines in a few operator calls, and making it easy to express new pipelines that match or exceed quality of recent LLM-based analytic systems by up to 170%, while offering accuracy guarantees. Overall, LOTUS programs match or exceed the accuracy of state-of-the-art AI pipelines for each task while running up to 3.6× faster than the highest-quality baselines. LOTUS is publicly available at https://github.com/lotus-data/lotus.
Liana Patel, Siddharth Jha, Melissa Z. Pan, Parth Asawa, Carlos Guestrin, Matei Zaharia
Proc. VLDB Endow.1
2024 ACORN: Performant and Predicate-Agnostic Search Over Vector Embeddings and Structured Data
abstract
Applications increasingly leverage mixed-modality data, and must jointly search over vector data, such as embedded images, text and video, as well as structured data, such as attributes and keywords. Proposed methods for this hybrid search setting either suffer from poor performance or support a severely restricted set of search predicates (e.g., only small sets of equality predicates), making them impractical for many applications. To address this, we present ACORN, an approach for performant and predicate-agnostic hybrid search. ACORN builds on Hierarchical Navigable Small Worlds (HNSW), a state-of-the-art graph-based approximate nearest neighbor index, and can be implemented efficiently by extending existing HNSW libraries. ACORN introduces the idea of predicate subgraph traversal to emulate a theoretically ideal, but impractical, hybrid search strategy. ACORN's predicate-agnostic construction algorithm is designed to enable this effective search strategy, while supporting a wide array of predicate sets and query semantics. We systematically evaluate ACORN on both prior benchmark datasets, with simple, low-cardinality predicate sets, and complex multi-modal datasets not supported by prior methods. We show that ACORN achieves state-of-the-art performance on all datasets, outperforming prior methods with 2--1,000× higher throughput at a fixed recall. Our code is available at: https://github.com/stanford-futuredata/ACORN.
Liana Patel, Peter Kraft, Carlos Guestrin, Matei Zaharia
Proc. ACM Manag. Data1
2023 Saguaro: An Edge Computing-Enabled Hierarchical Permissioned Blockchain
abstract
We present Saguaro, a permissioned blockchain system designed specifically for edge computing networks. Saguaro leverages the hierarchical structure of edge computing networks to reduce the overhead of wide-area communication by presenting several techniques. First, Saguaro proposes coordinator-based and optimistic protocols to process cross-domain transactions with low latency where the lowest common ancestor of the involved domains coordinates the protocol or detects inconsistency. Second, data are collected over hierarchy enabling higher-level domains to aggregate their sub-domain data. Finally, transactions initiated by mobile edge devices are processed without relying on high-level fog and cloud servers. Our experimental results across a wide range of workloads demonstrate the scalability of Saguaro in supporting a range of cross-domain and mobile transactions.
Mohammad Javad Amiri, Ziliang Lai, Liana Patel, Boon Thau Loo, Eric Lo 0001, Wenchao Zhou
ICDE3