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 2
Why Tabular Foundation Models Excel on Relational Data They Have Never Seen
Given a relational database (RDB) storing heterogeneous tabular information, how can we predict missing (or future) values in some target column of interest?SQLoom: Set-Contrastive Learning of Syntactic, Semantic, and Logical Dependencies for Text-to-SQL
Text-to-SQL translates natural language questions into SQL queries, enabling database access without writing SQL.From FAIR to AI-FAIR Metadata-First Infrastructure for AI-Enabled Science
Artificial intelligence (AI) technologies and their capabilities have advanced rapidly over the past few years, leading to widespread interest and adoption in the biological and ecological sciences.A GPU Engine for Sparse Matrix-Vector Products on $k^2$-Tree-Compressed Graphs
The $k^2$-tree is a compact representation of Boolean matrices: it stores the recursive hierarchy of their non-empty submatrices, with neither values nor coordinates, and serves rows and columns…Modular and Efficient Approximate Nearest Neighbors Search with Vectorium and kANNolo
Approximate Nearest Neighbors (ANN) search over neural embeddings powers modern retrieval systems such as Retrieval-Augmented Generation.Federated Vector Retrieval across Heterogeneous VectorDBs
Vector databases are now core infrastructure for AI retrieval systems, yet many real deployments must serve queries over multiple independently constructed vectorDBs built with different embedding…Graphs Have Structure: Declarative Manifolds, 3D Z-Order Monoid Roll-ups, and Zero-Simulation Visual Analytics in a Graph DBMS
Every real-world graph is embedded in an ambient structural manifold: proteins fold in Euclidean space ($R^3$), telecom networks sit on a planetary surface ($S^2 \times R$), and ontologies and…TSSDA: An Autonomous Agent for Constructing a Time-Series Text-to-SQL Benchmark
As agents increasingly undertake data querying, Text-to-SQL serves as a foundational capability for database access.SSPE: Robust Sequential Staypoint Extraction in Degraded Trajectory Data
Extracting semantically meaningful staypoints from raw trajectory streams is a foundational prerequisite for mobility analytics.ElectroChemLLM: A Multimodal LLM Pipeline for High-Fidelity Electrochemical Informatics
Electrochemistry is central to solving many modern-day challenges, including energy storage systems for a sustainable future, and its advancement relies heavily on the data from past findings.Self-Refining Prompt Induction for Streaming Text-to-SQL
Text-to-SQL assistants for streaming engines must handle dialect-specific types, windowing rules, and temporal semantics, including constructs poorly handled by generic prompts.Fidelity Synopses: Pre-Execution Plan Selection for Approximate Vector Search
Vector search has become a database operator with many physical implementations: different index families, build-time and search-time parameters, and compressed or disk-resident variants.A Multimodal Type 2 Diabetes Registry on DHIS2: A Design and Feasibility Study with the AI-READI Dataset
Care for type 2 diabetes increasingly draws on continuous glucose monitors, wearable devices, home sensors, clinical records and retinal images, yet few open platforms have been shown to hold all of…SpBench: An Agent-Native Framework for Cross-Engine Lakehouse Benchmarking
SpBench is an agent-native framework for cross-engine lakehouse benchmarking, in production use for benchmarking Snowpark, Snowpark Connect for Apache Spark, and other execution environments across…Rebuilding a Field's Open-Problem Catalog from the Literature: A Two-Layer Knowledge Graph, and Why Status Must Stay Proposed
A research field records its open problems in surveys, keynotes and community reports.When Imputation Changes the Nearest Neighbor: Exact Certification of Similarity Retrieval for Incomplete Sensor Time Series
Sensor time series routinely reach similarity search with missing values, and the retrieved neighbours then depend on how the gaps were filled.SPARQLcirc: Probabilistic Query Evaluation with Provenance Circuits
Probabilistic query evaluation (PQE) computes the probability of every answer of a query over a tuple-independent probabilistic knowledge graph.LASSO: An LLM-Agent Synthesized System for SQL Validation
The rise of Large Language Models (LLMs) has significantly advanced text-to-SQL capabilities, but generated queries may have errors.Manifest-Assisted Retrieval in Artificial Intelligence Search: Evidence Gaps and a Security Evaluation
The external sources retained in our non-systematic audit did not isolate the incremental security or utility effect of consuming /llms.txt while ordinary retrieval remained fixed.CoWalk: Cooperative Walks for Agentic Batch Queries on Disk-Resident Graphs
Workloads such as query rewriting, deep research and group-relative policy optimization (GRPO) issue batches of semantically related vector queries.