arXiv (All)
open access
Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins
We study the problem of optimizing subgraph queries using the new worst-case optimal join plans. Worst-case optimal plans evaluate queries by matching one query vertex at a time using multiway intersections. The core problem in optimizing worst-case optimal plans is to pick an ordering of the query
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
- An Optimal Bound for Ramsey Goodness of Cycles#799017
- An Optimal Bound for Ramsey Goodness of Cycles#797602
- Massively parallel tandem traversal of bounding volume hierarchies for geometric queries on distributed meshes#8264
- Combinatorial optimization model, approximation and heuristic algorithms for identifying specific structures in networks#1066242
- Advancing Uncertain Combinatorics through Graphization, Hyperization, and Uncertainization: Fuzzy, Neutrosophic, Soft, Rough, and Beyond. Sixth volume: Various New Uncertain Concepts (Collected Papers)#110499
Record · ID 987334
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