A Graph Theoretical Approach to Determine a Join Reducer Sequence in Distributed Query Processing.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/tkde/ChenY94
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/tkde/ChenY94
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Ming-Syan_Chen
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Philip_S._Yu
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1109%2F69.273034
>
foaf:
homepage
<
https://doi.org/10.1109/69.273034
>
dc:
identifier
DBLP journals/tkde/ChenY94
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1109%2F69.273034
(xsd:string)
dcterms:
issued
1994
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/tkde
>
rdfs:
label
A Graph Theoretical Approach to Determine a Join Reducer Sequence in Distributed Query Processing.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Ming-Syan_Chen
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Philip_S._Yu
>
swrc:
number
1
(xsd:string)
swrc:
pages
152-165
(xsd:string)
is
dcterms:
references
of
<
https://dblp.l3s.de/d2r/resource/publications/journals/tkde/WangC96
>
dcterms:
references
<
https://dblp.l3s.de/d2r/resource/publications/books/fm/GareyJ79
>
dcterms:
references
<
https://dblp.l3s.de/d2r/resource/publications/books/mg/CeriP84
>
dcterms:
references
<
https://dblp.l3s.de/d2r/resource/publications/books/sp/kimrb85/LohmanMHDLSW85
>
dcterms:
references
<
https://dblp.l3s.de/d2r/resource/publications/conf/dpds/LakshmiY88
>
dcterms:
references
<
https://dblp.l3s.de/d2r/resource/publications/conf/icde/ChenYW92
>
dcterms:
references
<
https://dblp.l3s.de/d2r/resource/publications/conf/icod/SelingerA80
>
dcterms:
references
<
https://dblp.l3s.de/d2r/resource/publications/conf/pods/GoodmanS82
>
dcterms:
references
<
https://dblp.l3s.de/d2r/resource/publications/conf/sigmod/IoannidisC91
>
dcterms:
references
<
https://dblp.l3s.de/d2r/resource/publications/conf/sigmod/KambayashiYY82
>
dcterms:
references
<
https://dblp.l3s.de/d2r/resource/publications/conf/vldb/ChenL84
>
dcterms:
references
<
https://dblp.l3s.de/d2r/resource/publications/journals/csur/YuC84
>
dcterms:
references
<
https://dblp.l3s.de/d2r/resource/publications/journals/jacm/BernsteinC81
>
dcterms:
references
<
https://dblp.l3s.de/d2r/resource/publications/journals/jcss/YuOL84
>
dcterms:
references
<
https://dblp.l3s.de/d2r/resource/publications/journals/siamcomp/ChiuBH84
>
dcterms:
references
<
https://dblp.l3s.de/d2r/resource/publications/journals/tc/ChenL84
>
dcterms:
references
<
https://dblp.l3s.de/d2r/resource/publications/journals/tkde/ChenY93
>
dcterms:
references
<
https://dblp.l3s.de/d2r/resource/publications/journals/tkde/YooL89
>
dcterms:
references
<
https://dblp.l3s.de/d2r/resource/publications/journals/tods/BernsteinGWRR81
>
dcterms:
references
<
https://dblp.l3s.de/d2r/resource/publications/journals/tods/GardyP89
>
dcterms:
references
<
https://dblp.l3s.de/d2r/resource/publications/journals/tods/LafortuneW86
>
dcterms:
references
<
https://dblp.l3s.de/d2r/resource/publications/journals/tpds/ChenY92
>
dcterms:
references
<
https://dblp.l3s.de/d2r/resource/publications/journals/tse/ApersHY83
>
dcterms:
references
<
https://dblp.l3s.de/d2r/resource/publications/journals/tse/HevnerY79
>
dcterms:
references
<
https://dblp.l3s.de/d2r/resource/publications/journals/tse/PramanikV88
>
dcterms:
references
<
https://dblp.l3s.de/d2r/resource/publications/journals/tse/YuCHL92
>
dcterms:
references
<
https://dblp.l3s.de/d2r/resource/publications/phd/Graefe87
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/tkde/ChenY94/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/tkde/ChenY94
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/tkde/tkde6.html#ChenY94
>
rdfs:
seeAlso
<
https://doi.org/10.1109/69.273034
>
dc:
subject
distributed databases; query processing; graph theory; database theory; computational complexity; graph theoretical approach; join reducer sequence; distributed query processing; semijoin; data transmission; join operations; query graph; optimal sequence; exponential complexity; heuristic approaches; heuristic algorithms; polynomial time complexity
(xsd:string)
dc:
title
A Graph Theoretical Approach to Determine a Join Reducer Sequence in Distributed Query Processing.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
6
(xsd:string)