3 results for "Scheidt, Benjamin"
Showing 1–3 · 0.25 seconds · RSS
-
Preprint Full text
Color Refinement for Relational Structures
Color Refinement, also known as Naive Vertex Classification, is a classical method to distinguish graphs by iteratively computing a coloring of their vertices. While it is mainly used as an imperfect way to test for isomorphism, the algorithm permeated many other, seemingly unrelated, areas of…
-
Preprint Full text
Using Color Refinement to Boost Enumeration and Counting for Acyclic CQs of Binary Schemas
We present an index structure, called the color-index, to boost the evaluation of acyclic conjunctive queries (ACQs) over binary schemas. The color-index is based on the color refinement algorithm, a widely used subroutine for graph isomorphism testing algorithms. Given a database $D$, we use a…
-
Preprint Full text
Structural Indexing of Relational Databases for the Evaluation of Free-Connex Acyclic Conjunctive Queries
…size of $D_{col}$ is related to the number of colors assigned to $D$ by Scheidt and Schweikardt's "relational color refinement" (2025). In the particular case of graphs, this coincides with the minimal size of an equitable partition of the graph. For example, the size of $D_{col}$ is logarithmic in…