Systems & Networks · Computer Science & AI
Databases
The newest papers in Databases that ReadSearch has read, newest first. Each links to its own page, with its authors, date, where it was published and the original.
202 papers, from 31 August 2026 to 5 November 2026: 170 arXiv preprints and 32 OpenAlex records.
Get the few papers worth your time in Databases every morning.
Follow Databases and ReadSearch reads its new papers each day, then brings you the few worth reading, each with its key finding in a sentence.
Newest papers, page 5
Use Of Convolutional Neural Networks In Detection Of Branch Dieback Disease In Pequi Trees
This study evaluates and compares five convolutional neural network (CNN) architectures, AlexNet, Inception, LeNet, VGG16, and MobileNet, for diagnosing branch dieback (seca-dos-ponteiros) in pequi…Same Query, Different Answer: Run-to-Run Variance in Semantic Query Processing
Semantic query engines ask a large language model (LLM) to judge individual rows, and benchmarks compare these engines on the quality of a few executions at temperature 0.Evaluating Local Language Model Agents for Reproducible Data Engineering: An Empirical Software Engineering Study of Mobility Workflows
Large language model (LLM) agents are increasingly used as software and data-engineering assistants, yet evidence about locally deployable open-weight agents remains limited.Cost-Aware Mixture-of-Experts Coordination for Model Markets
Existing model marketplaces typically trade and select individual models as indivisible units, limiting their ability to exploit complementarities among heterogeneous experts.Compact and Efficient Indexes for Learned Sparse Retrieval
This paper investigates how to substantially reduce the memory footprint of learned sparse retrieval indexes without sacrificing the efficiency of state-of-the-art retrieval data structures.Semantic Views: Certified Reuse of LLM Labels Across Semantic Queries
Semantic query engines evaluate natural-language filters with a large language model, and every evaluation is a costly oracle call.Leakage-Resistant Evaluation of AI-Generated Database Specifications in Specification-Driven Migration
This paper presents a leakage-resistant framework and benchmark (LRFB) for measuring evaluators of AI-generated Oracle PL/SQL specifications.Vibe Coding with Google AI Studio Case Study
This paper presents a case study on using Google AI Studio (version Pro) to vibe code a medium-complexity software application by a non-programmer who, moreover, needs it in a language other than…Life after delisting: tracking the publication output and citation impact of Scopus-discontinued journals with OpenAlex
Selective databases such as Scopus periodically re-evaluate the titles they index and remove those that no longer meet their quality criteria.CATune: Structural Constraint-Aware Bayesian Optimization for DBMS Configuration Tuning
Modern DBMSs expose hundreds of configuration knobs, resulting in a high-dimensional and heterogeneous search space that makes automated tuning costly.Correspondences as Decisions: JevNexus for Decision-Centric Schema Matching
Schema matching increasingly uses generative language models to rerank retrieved column candidates, although the underlying task is a bounded correspondence decision.QCATS: Query Context-Aware Transformer Slicing for Efficient Predictive Query Processing
In-database predictive query processing increasingly applies Transformer-based models within relational pipelines.Truly Sub-$3^n$ Min-Sum Subset Convolution and Join Ordering
We present a deterministic reduction from min-sum subset convolution to min-plus matrix product.Implementation Guidelines for Data Quality Metrics
Despite decades of data quality (DQ) research, a gap remains between DQ dimensions, such as accuracy or completeness, which the literature defines in textual form, and DQ tools, which typically…When Plans Change Answers: Formalizing Cost-Accuracy Optimization for Semantic Queries
In semantic query engines, predicates are evaluated by machine-learned models, and the choice of a query plan affects not only the cost of a query but also its result.Building Navigable Graphs Without Search in Three Composable Stages
Navigable graphs can be built without searching for neighbors: partition the data, evaluate every pair inside each part, and select each point's edges from the candidates.Protocol-Sensitive Evaluation of Log Anomaly Detection: Component Costs and Target-Access Sensitivity on HDFS and BGL
Protocol choices can change the conclusions drawn from log anomaly detection benchmarks even when detector settings are fixed.ModelLakeFishing: Efficient Retrieval over Million-Scale Model Lakes
Open model lakes may contain millions of reusable models, making it costly to identify suitable models for a new dataset.Guanaco: A Global-Uniformity Algorithm for Near-Submodular-Width Conjunctive Query Evaluation
We present Guanaco, an algorithm for performing conjunctive query evaluation where, for each Boolean conjunctive query, and positive epsilon, the algorithm achieves polynomial time with exponent…SALUS: Automated Auditing of NL-to-SQL Benchmarks through Weak Supervision of Multi-Agent Output
Natural language to SQL (NL-to-SQL) benchmarks are foundational to progress in data analysis research, yet recent work has shown that widely-used benchmarks contain significant annotation errors.