메뉴 건너뛰기




Volumn , Issue , 2011, Pages 949-960

Processing theta-joins using MapReduce

Author keywords

MapReduce; skew; theta join processing

Indexed keywords

DATA FLOW ANALYSIS;

EID: 79960020260     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1989323.1989423     Document Type: Conference Paper
Times cited : (217)

References (20)
  • 1
    • 79959955875 scopus 로고    scopus 로고
    • Apache hadoop. http://hadoop.apache.org.
  • 2
    • 79959934537 scopus 로고    scopus 로고
    • Apache hive. http://hadoop.apache.org/hive.
  • 3
    • 79959932066 scopus 로고    scopus 로고
    • Apache pig. http://pig.apache.org/.
  • 4
    • 77952265514 scopus 로고    scopus 로고
    • Optimizing joins in a map-reduce environment
    • F. N. Afrati and J. D. Ullman. Optimizing joins in a map-reduce environment. In EDBT, pages 99-110, 2010.
    • (2010) EDBT , pp. 99-110
    • Afrati, F.N.1    Ullman, J.D.2
  • 5
    • 77954700016 scopus 로고    scopus 로고
    • A comparison of join algorithms for log processing in mapreduce
    • S. Blanas, J. M. Patel, V. Ercegovac, J. Rao, E. J. Shekita, and Y. Tian. A comparison of join algorithms for log processing in mapreduce. In SIGMOD, pages 975-986, 2010.
    • (2010) SIGMOD , pp. 975-986
    • Blanas, S.1    Patel, J.M.2    Ercegovac, V.3    Rao, J.4    Shekita, E.J.5    Tian, Y.6
  • 6
    • 85030321143 scopus 로고    scopus 로고
    • Mapreduce: Simplified data processing on large clusters
    • J. Dean and S. Ghemawat. Mapreduce: Simplified data processing on large clusters. In OSDI, 2004.
    • (2004) OSDI
    • Dean, J.1    Ghemawat, S.2
  • 7
    • 0026870271 scopus 로고
    • Parallel database systems. The future of high performance database systems
    • DOI 10.1145/129888.129894
    • D. J. DeWitt and J. Gray. Parallel database systems: The future of high performance database systems. Commun. ACM, 35(6):85-98, 1992. (Pubitemid 23642225)
    • (1992) Communications of the ACM , vol.35 , Issue.6 , pp. 85-98
    • Dewitt, D.1    Gray, J.2
  • 8
    • 0002773778 scopus 로고
    • An evaluation of non-equijoin algorithms
    • D. J. DeWitt, J. F. Naughton, and D. A. Schneider. An evaluation of non-equijoin algorithms. In VLDB, pages 443-452, 1991.
    • (1991) VLDB , pp. 443-452
    • DeWitt, D.J.1    Naughton, J.F.2    Schneider, D.A.3
  • 10
    • 0027608375 scopus 로고
    • Query evaluation techniques for large databases
    • G. Graefe. Query evaluation techniques for large databases. ACM Comput. Surv., 25, 1993.
    • (1993) ACM Comput. Surv. , vol.25
    • Graefe, G.1
  • 12
    • 34548041192 scopus 로고    scopus 로고
    • Dryad: Distributed data-parallel programs from sequential building blocks
    • M. Isard, M. Budiu, Y. Yu, A. Birrell, and D. Fetterly. Dryad: Distributed data-parallel programs from sequential building blocks. In EuroSys, pages 59-72, 2007.
    • (2007) EuroSys , pp. 59-72
    • Isard, M.1    Budiu, M.2    Yu, Y.3    Birrell, A.4    Fetterly, D.5
  • 13
    • 77954913432 scopus 로고    scopus 로고
    • Skew-resistant parallel processing of feature-extracting scientific user-defined functions
    • Y. Kwon, M. Balazinska, B. Howe, and J. Rolia. Skew-resistant parallel processing of feature-extracting scientific user-defined functions. In SoCC, 2010.
    • (2010) SoCC
    • Kwon, Y.1    Balazinska, M.2    Howe, B.3    Rolia, J.4
  • 14
    • 70349547303 scopus 로고    scopus 로고
    • Automatic optimization of parallel dataflow programs
    • C. Olston, B. Reed, A. Silberstein, and U. Srivastava. Automatic optimization of parallel dataflow programs. In USENIX, pages 267-273, 2008.
    • (2008) USENIX , pp. 267-273
    • Olston, C.1    Reed, B.2    Silberstein, A.3    Srivastava, U.4
  • 15
    • 55349148888 scopus 로고    scopus 로고
    • Pig latin: A not-so-foreign language for data processing
    • C. Olston, B. Reed, U. Srivastava, R. Kumar, and A. Tomkins. Pig latin: A not-so-foreign language for data processing. In SIGMOD, pages 1099-1110, 2008.
    • (2008) SIGMOD , pp. 1099-1110
    • Olston, C.1    Reed, B.2    Srivastava, U.3    Kumar, R.4    Tomkins, A.5
  • 17
    • 30344452311 scopus 로고    scopus 로고
    • Interpreting the data: Parallel analysis with sawzall
    • R. Pike, S. Dorward, R. Griesemer, and S. Quinlan. Interpreting the data: Parallel analysis with sawzall. Sci. Program., 13(4):277-298, 2005.
    • (2005) Sci. Program. , vol.13 , Issue.4 , pp. 277-298
    • Pike, R.1    Dorward, S.2    Griesemer, R.3    Quinlan, S.4
  • 18
    • 0027841694 scopus 로고
    • A symmetric fragment and replicate algorithm for distributed joins
    • J. W. Stamos and H. C. Young. A symmetric fragment and replicate algorithm for distributed joins. IEEE Trans. Parallel Distrib. Syst., 4:1345-1354, 1993.
    • (1993) IEEE Trans. Parallel Distrib. Syst. , vol.4 , pp. 1345-1354
    • Stamos, J.W.1    Young, H.C.2
  • 19
    • 77954744650 scopus 로고    scopus 로고
    • Efficient parallel set-similarity joins using mapreduce
    • R. Vernica, M. J. Carey, and C. Li. Efficient parallel set-similarity joins using mapreduce. In SIGMOD, pages 495-506, 2010.
    • (2010) SIGMOD , pp. 495-506
    • Vernica, R.1    Carey, M.J.2    Li, C.3
  • 20
    • 35448944021 scopus 로고    scopus 로고
    • Map-reduce-merge: Simplified relational data processing on large clusters
    • H.-C. Yang, A. Dasdan, R.-L. Hsiao, and D. S. Parker. Map-reduce-merge: Simplified relational data processing on large clusters. In SIGMOD, pages 1029-1040, 2007.
    • (2007) SIGMOD , pp. 1029-1040
    • Yang, H.-C.1    Dasdan, A.2    Hsiao, R.-L.3    Parker, D.S.4


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.