22 citations · 34 across the 6 of their papers we have counts for
Showing cs.DBShow all
3 papers · 1 filter
cs.DB2019
Subsumption of Weakly Well-Designed SPARQL Patterns is Undecidable
Mark Kaminski, Egor V. Kostylev
Weakly well-designed SPARQL patterns is a recent generalisation of well-designed patterns, which preserve good computational properties but also capture almost all patterns that ap…
cs.DB2018
A Note on the Hardness of the Critical Tuple Problem
Egor V. Kostylev, Dan Suciu
The notion of critical tuple was introduced by Miklau and Suciu (Gerome Miklau and Dan Suciu. A formal analysis of information disclosure in data exchange. J. Comput. Syst. Sci., 7…
cs.DB2018
Estimating the Cardinality of Conjunctive Queries over RDF Data Using Graph Summarisation
Giorgio Stefanoni, Boris Motik, Egor V. Kostylev
Estimating the cardinality (i.e., the number of answers) of conjunctive queries is particularly difficult in RDF systems: queries over RDF data are navigational and thus tend to in…