The paper introduces triplestore schemas for RDF graphs and demonstrates a query-rewriting technique that determines rule applicability and produces output schemas more efficiently than canonical-instance computation.
In: Proceedings of the 36th ACM SIGMOD- SIGACT-SIGAI Symposium on Principles of Database Systems
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DB 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Rule Applicability on RDF Triplestore Schemas
The paper introduces triplestore schemas for RDF graphs and demonstrates a query-rewriting technique that determines rule applicability and produces output schemas more efficiently than canonical-instance computation.