arXiv (All)
open access
K-Join: Combining Vertex Covers for Parallel Joins
Significant research effort has been devoted to improving the performance of join processing in the massively parallel computation model, where the goal is to evaluate a query with the minimum possible data transfer between machines. However, it is still an open question to determine the best possib
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
- GRBench: A Comprehensive Benchmark Evaluation for Graph-relational Data Management#622635
- MaDI-Bench: An End-to-End Data Integration Benchmark#324980
- OmniTQA: A Cost-Aware System for Hybrid Query Processing over Semi-Structured Data#2772
- Kalypso: Relational LLM Serving#411157
- Samyama: A Unified Graph-Vector Database with In-Database Optimization, Agentic Enrichment, and Hardware Acceleration#1050831
Record · ID 1232674
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