• français
    • English
  • English 
    • français
    • English
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
BIRD Home

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Statistics

View Usage Statistics

Reuse-based Optimization for Pig Latin

Thumbnail
View/Open
pigreuse-technical-report.pdf (799.2Kb)
Date
2016
Dewey
Programmation, logiciels, organisation des données
Sujet
MapReduce; Big Data; Pig Latin; Reuse-based Optimization; Linear Programming
DOI
http://dx.doi.org/10.1145/2983323.2983669
Conference name
25th ACM International on Conference on Information and Knowledge Management (CIKM'16)
Conference date
10-2016
Conference city
Indianapolis
Conference country
United States
Book title
Proceedings of the 25th ACM International on Conference on Information and Knowledge Management (CIKM'16)
Author
Mukhopadhyay, Snehasis; Zhai, ChengXiang
Publisher
ACM Press
Publisher city
New York
Year
2016
Pages number
2512
ISBN
978-1-4503-4073-1
URI
https://basepub.dauphine.fr/handle/123456789/16496
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
Camacho-Rodríguez, Jesús
status unknown
Colazzo, Dario
989 Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Herschel, Melanie
237218 Institut für Parallele und Verteilte Systeme [IPVS]
Manolescu, Ioana
status unknown
Chowdhury, Soudip Roy
status unknown
Type
Communication / Conférence
Item number of pages
2215-2220
Abstract (EN)
Pig Latin is a popular language which is widely used for parallel processing of massive data sets. Currently, subexpressions occurring repeatedly in Pig Latin scripts are executed as many times as they appear, and the current Pig Latin optimizer does not identify reuse opportunities. We present a novel optimization approach aiming at identifying and reusing repeated subexpressions in Pig Latin scripts. Our optimization algorithm, named PigReuse, identifies subexpression merging opportunities, selects the best ones to execute based on a cost function, and reuses their results as needed in order to compute exactly the same output as the original scripts. Our experiments demonstrate the effectiveness of our approach.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.