The Complexity of Acyclic Conjunctive Queries.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/focs/GottlobLS98
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/focs/GottlobLS98
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Francesco_Scarcello
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Georg_Gottlob
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Nicola_Leone
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1109%2FSFCS.1998.743521
>
foaf:
homepage
<
https://doi.org/10.1109/SFCS.1998.743521
>
dc:
identifier
DBLP conf/focs/GottlobLS98
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1109%2FSFCS.1998.743521
(xsd:string)
dcterms:
issued
1998
(xsd:gYear)
rdfs:
label
The Complexity of Acyclic Conjunctive Queries.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Francesco_Scarcello
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Georg_Gottlob
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Nicola_Leone
>
swrc:
pages
706-715
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/focs/1998
>
is
dcterms:
references
of
<
https://dblp.l3s.de/d2r/resource/publications/conf/icdt/FlumFG01
>
is
dcterms:
references
of
<
https://dblp.l3s.de/d2r/resource/publications/conf/icdt/MeussSB01
>
is
dcterms:
references
of
<
https://dblp.l3s.de/d2r/resource/publications/conf/pods/AngiulliBIP00
>
is
dcterms:
references
of
<
https://dblp.l3s.de/d2r/resource/publications/conf/pods/GottlobLS99
>
is
dcterms:
references
of
<
https://dblp.l3s.de/d2r/resource/publications/conf/pods/Vardi00
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/focs/GottlobLS98/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/focs/GottlobLS98
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/focs/focs98.html#GottlobLS98
>
rdfs:
seeAlso
<
https://doi.org/10.1109/SFCS.1998.743521
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/focs
>
dc:
subject
database theory, conjunctive query, acyclic hypergraph, join tree, tree query, computational complexity, LOGCFL, constraint satisfaction problem, query containment, subsumption, parallel algorithms.
(xsd:string)
dc:
title
The Complexity of Acyclic Conjunctive Queries.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document