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
Selective Retrieval Routing for Multi-Violation Knowledge Graph Repair
Knowledge graphs often contain missing or inconsistent facts that undermine the applications built on them.Typed Knowledge over Constructive Institutions
Type theories designed for mathematics or program verification need only that a proposition holds; proof irrelevance in conversion erases, at the kernel level, how a claim was established.ArcadeDB in Python: An In-Process Multi-Model Database
Some Python workflows need transactional reads and writes over documents, traversals over a graph, and similarity search over vector embeddings.BobFlow: Towards Human-Agent Collaborative Data Science Using Dataflows
Recent advances in large language models (LLMs) have established human-agent collaboration as a promising paradigm for data science.The Invocation Bottleneck in LLM-Based Lossless Compression: What Can Be Removed and What Must Be Traded
Large language models (LLMs) compress text far better than classical compressors, but LLM-based compressors are slow, particularly during decompression.When Is One Query per Template Enough? Adapting Learned Cost Models to New Hardware
A learned cost model that predicts query runtimes is trained on measurements from one machine.Autonomous ETL Pipelines for Salesforce M&A Consolidation: A Reference Framework, Jitterbit Mapping, and Reproducible Simulation Study
Merging companies that each run Salesforce must consolidate their customer data into a single organization while both source systems remain in use.A Comparative Study of Importance Attribution to Columns in Deep Learning over Relational Databases
Deep learning over relational databases has led to increasingly effective prediction models, motivating a growing need to explain their behavior.From Certified Pairs to a Certified Hub: Reasoner-Checked Crosswalks for the Information Exchange Standard
A national digital twin was conceived as an ecosystem of twins connected through mappings to a common foundation, but the roadmap that promises to confirm those mappings are valid never says what…Navigating Runtime Dynamism in Semantic Query Serving
LLM-powered semantic queries increasingly combine relational processing with multiple LLM-based operators over unstructured data.Text-to-SQL Models Make Choices Without Saying So
A text-to-SQL answer can run, return a plausible number and still compute something other than what the analyst meant.ZeroGR: Filtering-First Constrained Decoding for Generative Recommendation
Generative recommendation is gaining traction in production, retrieving items by generating their identifiers one token at a time.Where Is the Truth When AI Agents Disagree? Dependence-Aware Belief Propagation for Unsupervised Truth Discovery (Extended Version)
LLM agents often give conflicting answers to the same question, and many deployed agents are variants of one base model, so their errors are correlated.The Power of Bidegeneracy for Hypergraph Data Structures
A hypergraph $H = (V,E)$ describes a set system over a vertex universe $V$.Extending the MM-AR Metamodeling Platform with Process Mining Capabilities
Process mining derives process models from event data recorded by information systems, but its results are usually presented as two-dimensional visualizations that are separate from the environments…Whiel: A Neurosymbolic Platform for Certified Relational Program Verification
We present the Whiel (a contraction of Whi(le-R)el) system for Lean-certified reasoning about imperative relational programs.Turbocharging PiPNN for Proximity and $k$-NN Graph Building
Graph-based Approximate Nearest Neighbor Search (ANNS) indexes such as HNSW and Vamana deliver state-of-the-art query performance at the cost of large indexing times.Recursively Testing and Vibe Debugging a Google AI Studio Generated Vibe-Coded Database Software Application
This research paper proposes a broader definition of vibe coding, extending the original one with non-developers and natural languages other than English, and introduces the notion of vibe…3L-D: A Low-Light Level Dataset from a Sensor-Agnostic, Alignment-Preserving Acquisition Framework
Supervised low-light image and video enhancement has achieved remarkable progress, yet current models remain fundamentally constrained by the limitations of existing datasets.Stop Handcrafting Your Engine! GenDB-V: Towards AI-Generated and Formally Verified Database Systems
For over 50 years, the database community has developed a wide range of successful engines to answer two fundamental questions: how can database systems run faster, and how can we ensure their…