pith. sign in

Title resolution pending

Katherine Thornton, Harold Solbrig, Gregory S · 2019 · DOI 10.1007/978-3-030-21348-0_39

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
open at publisher browse 1 citing papers

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

fields

cs.DB 1

years

2026 1

verdicts

UNVERDICTED 1

representative citing papers

Validation of graph databases against PG-Schema

cs.DB · 2026-06-04 · unverdicted · novelty 5.0

PG-Schema validation is NP-complete in combined complexity and PTIME in data complexity; combined complexity becomes PTIME under restricted alternation of type combinations and unions.

citing papers explorer

Showing 1 of 1 citing paper.

  • Validation of graph databases against PG-Schema cs.DB · 2026-06-04 · unverdicted · none · ref 5

    PG-Schema validation is NP-complete in combined complexity and PTIME in data complexity; combined complexity becomes PTIME under restricted alternation of type combinations and unions.