Computational Complexity of Sorting and Joining Relations with Duplicates.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/tkde/AbdelguerfiS91
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/tkde/AbdelguerfiS91
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Arun_K._Sood
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Mahdi_Abdelguerfi
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1109%2F69.109110
>
foaf:
homepage
<
https://doi.org/10.1109/69.109110
>
dc:
identifier
DBLP journals/tkde/AbdelguerfiS91
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1109%2F69.109110
(xsd:string)
dcterms:
issued
1991
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/tkde
>
rdfs:
label
Computational Complexity of Sorting and Joining Relations with Duplicates.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Arun_K._Sood
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Mahdi_Abdelguerfi
>
swrc:
number
4
(xsd:string)
swrc:
pages
496-503
(xsd:string)
dcterms:
references
<
https://dblp.l3s.de/d2r/resource/publications/books/aw/Knuth73
>
dcterms:
references
<
https://dblp.l3s.de/d2r/resource/publications/conf/icde/LaiL87
>
dcterms:
references
<
https://dblp.l3s.de/d2r/resource/publications/conf/iwdm/Abdelguerfi89
>
dcterms:
references
<
https://dblp.l3s.de/d2r/resource/publications/conf/iwdm/AbdelguerfiS87
>
dcterms:
references
<
https://dblp.l3s.de/d2r/resource/publications/conf/iwdm/Eich89
>
dcterms:
references
<
https://dblp.l3s.de/d2r/resource/publications/conf/sigmod/KungL80
>
dcterms:
references
<
https://dblp.l3s.de/d2r/resource/publications/conf/sigmod/LehmanC86
>
dcterms:
references
<
https://dblp.l3s.de/d2r/resource/publications/journals/cacm/Codd70
>
dcterms:
references
<
https://dblp.l3s.de/d2r/resource/publications/journals/is/AstrahanSW87
>
dcterms:
references
<
https://dblp.l3s.de/d2r/resource/publications/journals/jcss/FlajoletM85
>
dcterms:
references
<
https://dblp.l3s.de/d2r/resource/publications/journals/siamcomp/Noshita82
>
dcterms:
references
<
https://dblp.l3s.de/d2r/resource/publications/journals/siamcomp/StockmeyerW79
>
dcterms:
references
<
https://dblp.l3s.de/d2r/resource/publications/journals/tcs/DobkinM80
>
dcterms:
references
<
https://dblp.l3s.de/d2r/resource/publications/journals/tods/AstrahanBCEGGKLMMPTWW76
>
dcterms:
references
<
https://dblp.l3s.de/d2r/resource/publications/journals/tods/BittonD83
>
dcterms:
references
<
https://dblp.l3s.de/d2r/resource/publications/journals/tse/LeeL88
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/tkde/AbdelguerfiS91/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/tkde/AbdelguerfiS91
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/tkde/tkde3.html#AbdelguerfiS91
>
rdfs:
seeAlso
<
https://doi.org/10.1109/69.109110
>
dc:
subject
upper bounds; sorting; joining; relations; duplicate values; attribute columns; computational complexity; distinct tuple values; multirelation; cardinality; distinct elements; worst time complexity; binary comparisons; lower bounds; three-branch comparisons; natural join operation; computational complexity; database theory; relational databases; sorting
(xsd:string)
dc:
title
Computational Complexity of Sorting and Joining Relations with Duplicates.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
3
(xsd:string)