7 papers
Tracing Agentic Failure from the Flow of Success
Samuel Yeh, Yiwen Zhu, Shaleen Deep +1
The paper introduces OAT, a lightweight unsupervised method that learns from successful LLM agent trajectories and detects error steps in failed runs by scoring deviations using ne…
Fast Join Project Query Evaluation using Matrix Multiplication
Shaleen Deep, Xiao Hu, Paraschos Koutris
In the last few years, much effort has been devoted to developing join algorithms in order to achieve worst-case optimality for join queries over relational databases. Towards this…
Nexus: Inferring Join Graphs from Metadata Alone via Iterative Low-Rank Matrix Completion
Tianji Cong, Yuanyuan Tian, Andreas Mueller +5
Automatically inferring join relationships is a critical task for effective data discovery, integration, querying and reuse. However, accurately and efficiently identifying these r…
Regular Expression Indexing for Log Analysis. Extended Version
Ling Zhang, Shaleen Deep, Jignesh M. Patel +1
In this paper, we present the design and architecture of REI, a novel system for indexing log data for regular expression queries. Our main contribution is an -gram-based indexi…
Enumeration Algorithms for Conjunctive Queries with Projection
Shaleen Deep, Xiao Hu, Paraschos Koutris
We investigate the enumeration of query results for an important subset of CQs with projections, namely star and path queries. The task is to design data structures and algorithms…
An Evaluation of N-Gram Selection Strategies for Regular Expression Indexing in Contemporary Text Analysis Tasks. Extended Version
Ling Zhang, Shaleen Deep, Jignesh M. Patel +1
Efficient evaluation of regular expressions (regex, for short) is crucial for text analysis, and n-gram indexes are fundamental to achieving fast regex evaluation performance. Howe…