File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: RPJ: Producing fast join results on streams through rate-based optimization

TitleRPJ: Producing fast join results on streams through rate-based optimization
Authors
Issue Date2005
PublisherAssociation for Computing Machinery, Inc. The Journal's web site is located at http://www.acm.org/sigmod
Citation
Proceedings Of The Acm Sigmod International Conference On Management Of Data, 2005, p. 371-382 How to Cite?
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.
Persistent Identifierhttp://hdl.handle.net/10722/93267
ISSN
References

 

DC FieldValueLanguage
dc.contributor.authorTao, Yen_HK
dc.contributor.authorYiu, MLen_HK
dc.contributor.authorPapadias, Den_HK
dc.contributor.authorHadjieleftheriou, Men_HK
dc.contributor.authorMamoulis, Nen_HK
dc.date.accessioned2010-09-25T14:55:56Z-
dc.date.available2010-09-25T14:55:56Z-
dc.date.issued2005en_HK
dc.identifier.citationProceedings Of The Acm Sigmod International Conference On Management Of Data, 2005, p. 371-382en_HK
dc.identifier.issn0730-8078en_HK
dc.identifier.urihttp://hdl.handle.net/10722/93267-
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.en_HK
dc.languageengen_HK
dc.publisherAssociation for Computing Machinery, Inc. The Journal's web site is located at http://www.acm.org/sigmoden_HK
dc.relation.ispartofProceedings of the ACM SIGMOD International Conference on Management of Dataen_HK
dc.titleRPJ: Producing fast join results on streams through rate-based optimizationen_HK
dc.typeConference_Paperen_HK
dc.identifier.emailMamoulis, N:nikos@cs.hku.hken_HK
dc.identifier.authorityMamoulis, N=rp00155en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1145/1066157.1066200en_HK
dc.identifier.scopuseid_2-s2.0-29844439309en_HK
dc.identifier.hkuros103357en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-29844439309&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.spage371en_HK
dc.identifier.epage382en_HK
dc.publisher.placeUnited Statesen_HK
dc.identifier.scopusauthoridTao, Y=7402420191en_HK
dc.identifier.scopusauthoridYiu, ML=8589889600en_HK
dc.identifier.scopusauthoridPapadias, D=7005757795en_HK
dc.identifier.scopusauthoridHadjieleftheriou, M=6506875114en_HK
dc.identifier.scopusauthoridMamoulis, N=6701782749en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats