File Download
 
Links for fulltext
(May Require Subscription)
 
Supplementary

Conference Paper: RPJ: Producing fast join results on streams through rate-based optimization
  • Basic View
  • Metadata View
  • XML View
TitleRPJ: Producing fast join results on streams through rate-based optimization
 
AuthorsTao, Y3
Yiu, ML1
Papadias, D4
Hadjieleftheriou, M2
Mamoulis, N1
 
Issue Date2005
 
PublisherAssociation for Computing Machinery, Inc. The Journal's web site is located at http://www.acm.org/sigmod
 
CitationProceedings Of The Acm Sigmod International Conference On Management Of Data, 2005, p. 371-382 [How to Cite?]
DOI: http://dx.doi.org/10.1145/1066157.1066200
 
AbstractWe consider the problem of "progressively" joining relations whose records are continuously retrieved from remote sources through an unstable network that may incur temporary failures. The objectives are to (i) start reporting the first output tuples as soon as possible (before the participating relations are completely received), and (ii) produce the remaining results at a fast rate. We develop a new algorithm RPJ (Rate-based Progressive Join) based on solid theoretical analysis. RPJ maximizes the output rate by optimizing its execution according to the characteristics of the join relations (e.g., data distribution, tuple arrival pattern, etc.). Extensive experiments prove that our technique delivers results significantly faster than the previous methods. Copyright 2005 ACM.
 
ISSN0730-8078
 
DOIhttp://dx.doi.org/10.1145/1066157.1066200
 
ReferencesReferences in Scopus
 
DC FieldValue
dc.contributor.authorTao, Y
 
dc.contributor.authorYiu, ML
 
dc.contributor.authorPapadias, D
 
dc.contributor.authorHadjieleftheriou, M
 
dc.contributor.authorMamoulis, N
 
dc.date.accessioned2010-09-25T14:55:56Z
 
dc.date.available2010-09-25T14:55:56Z
 
dc.date.issued2005
 
dc.description.abstractWe consider the problem of "progressively" joining relations whose records are continuously retrieved from remote sources through an unstable network that may incur temporary failures. The objectives are to (i) start reporting the first output tuples as soon as possible (before the participating relations are completely received), and (ii) produce the remaining results at a fast rate. We develop a new algorithm RPJ (Rate-based Progressive Join) based on solid theoretical analysis. RPJ maximizes the output rate by optimizing its execution according to the characteristics of the join relations (e.g., data distribution, tuple arrival pattern, etc.). Extensive experiments prove that our technique delivers results significantly faster than the previous methods. Copyright 2005 ACM.
 
dc.description.naturelink_to_subscribed_fulltext
 
dc.identifier.citationProceedings Of The Acm Sigmod International Conference On Management Of Data, 2005, p. 371-382 [How to Cite?]
DOI: http://dx.doi.org/10.1145/1066157.1066200
 
dc.identifier.doihttp://dx.doi.org/10.1145/1066157.1066200
 
dc.identifier.epage382
 
dc.identifier.hkuros103357
 
dc.identifier.issn0730-8078
 
dc.identifier.scopuseid_2-s2.0-29844439309
 
dc.identifier.spage371
 
dc.identifier.urihttp://hdl.handle.net/10722/93267
 
dc.languageeng
 
dc.publisherAssociation for Computing Machinery, Inc. The Journal's web site is located at http://www.acm.org/sigmod
 
dc.publisher.placeUnited States
 
dc.relation.ispartofProceedings of the ACM SIGMOD International Conference on Management of Data
 
dc.relation.referencesReferences in Scopus
 
dc.titleRPJ: Producing fast join results on streams through rate-based optimization
 
dc.typeConference_Paper
 
<?xml encoding="utf-8" version="1.0"?>
<item><contributor.author>Tao, Y</contributor.author>
<contributor.author>Yiu, ML</contributor.author>
<contributor.author>Papadias, D</contributor.author>
<contributor.author>Hadjieleftheriou, M</contributor.author>
<contributor.author>Mamoulis, N</contributor.author>
<date.accessioned>2010-09-25T14:55:56Z</date.accessioned>
<date.available>2010-09-25T14:55:56Z</date.available>
<date.issued>2005</date.issued>
<identifier.citation>Proceedings Of The Acm Sigmod International Conference On Management Of Data, 2005, p. 371-382</identifier.citation>
<identifier.issn>0730-8078</identifier.issn>
<identifier.uri>http://hdl.handle.net/10722/93267</identifier.uri>
<description.abstract>We consider the problem of &quot;progressively&quot; joining relations whose records are continuously retrieved from remote sources through an unstable network that may incur temporary failures. The objectives are to (i) start reporting the first output tuples as soon as possible (before the participating relations are completely received), and (ii) produce the remaining results at a fast rate. We develop a new algorithm RPJ (Rate-based Progressive Join) based on solid theoretical analysis. RPJ maximizes the output rate by optimizing its execution according to the characteristics of the join relations (e.g., data distribution, tuple arrival pattern, etc.). Extensive experiments prove that our technique delivers results significantly faster than the previous methods. Copyright 2005 ACM.</description.abstract>
<language>eng</language>
<publisher>Association for Computing Machinery, Inc. The Journal&apos;s web site is located at http://www.acm.org/sigmod</publisher>
<relation.ispartof>Proceedings of the ACM SIGMOD International Conference on Management of Data</relation.ispartof>
<title>RPJ: Producing fast join results on streams through rate-based optimization</title>
<type>Conference_Paper</type>
<description.nature>link_to_subscribed_fulltext</description.nature>
<identifier.doi>10.1145/1066157.1066200</identifier.doi>
<identifier.scopus>eid_2-s2.0-29844439309</identifier.scopus>
<identifier.hkuros>103357</identifier.hkuros>
<relation.references>http://www.scopus.com/mlt/select.url?eid=2-s2.0-29844439309&amp;selection=ref&amp;src=s&amp;origin=recordpage</relation.references>
<identifier.spage>371</identifier.spage>
<identifier.epage>382</identifier.epage>
<publisher.place>United States</publisher.place>
</item>
Author Affiliations
  1. The University of Hong Kong
  2. University of California, Riverside
  3. City University of Hong Kong
  4. Hong Kong University of Science and Technology