arXiv (All)
open access
Supervised and LLM-Augmented Cardinality Estimation for Similarity Queries on Knowledge Graphs
Over the past decades, query cardinality estimation on relational databases has been proven crucial, enabling the result size estimation of all sub-plans of each query. This allowed query optimizers to design efficient query plans, towards minimizing the query response time. Lately, knowledge graphs
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- TraHist: Fast and Accurate Cardinality Estimation for Trajectory Data (Extended Version)#1357965
- TraHist: Fast and Accurate Cardinality Estimation for Trajectory Data (Extended Version)#1348929
- Calibrated Bayesian Selection of Schema Subgraphs for Database Question Answering#1361491
- A SURVEY OF QUERY OPTIMIZATION IN CENTRALIZED DATABASE SYSTEMS#933704
- Fuzzy Networks for Modeling Shared Semantic Knowledge#94136
Record · ID 1534838
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive