메뉴 건너뛰기




Volumn , Issue , 2010, Pages 99-110

Optimizing joins in a map-reduce environment

Author keywords

[No Author keywords available]

Indexed keywords

DIMENSION TABLES; FIXED NUMBERS; KEY ATTRIBUTES; MAP PROCESS; NEW APPROACHES; SOCIAL NETWORKS; STAR JOIN; VERY LARGE DATUM;

EID: 77952265514     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1739041.1739056     Document Type: Conference Paper
Times cited : (290)

References (23)
  • 2
    • 77952276758 scopus 로고    scopus 로고
    • Hadoop
    • Apache. Hadoop. http://hadoop.apache.org/, 2006.
    • (2006)
  • 3
    • 0039253775 scopus 로고    scopus 로고
    • Eddies: Continuously adaptive query processing
    • R. Avnur and J. M. Hellerstein. Eddies: Continuously adaptive query processing. In SIGMOD Conference, pages 261-272, 2000.
    • (2000) SIGMOD Conference , pp. 261-272
    • Avnur, R.1    Hellerstein, J.M.2
  • 4
    • 28444460209 scopus 로고    scopus 로고
    • Adaptive caching for continuous queries
    • S. Babu, K. Munagala, J. Widom, and R. Motwani. Adaptive caching for continuous queries. In ICDE, pages 118-129, 2005.
    • (2005) ICDE , pp. 118-129
    • Babu, S.1    Munagala, K.2    Widom, J.3    Motwani, R.4
  • 5
    • 3142727856 scopus 로고    scopus 로고
    • Streamon: An adaptive engine for stream query processing
    • New York, NY, USA, ACM
    • S. Babu and J. Widom. Streamon: an adaptive engine for stream query processing. In SIGMOD Conference, pages 931-932, New York, NY, USA, 2004. ACM.
    • (2004) SIGMOD Conference , pp. 931-932
    • Babu, S.1    Widom, J.2
  • 6
    • 0038589165 scopus 로고    scopus 로고
    • The anatomy of a large-scale hypertextual Web search engine 1
    • S. Brin and L. Page. The anatomy of a large-scale hypertextual web search engine. Computer Networks, 30(1-7):107-117, 1998. (Pubitemid 128666929)
    • (1998) Computer Networks , vol.30 , Issue.1-7 , pp. 107-117
    • Brin, S.1
  • 8
    • 35448944021 scopus 로고    scopus 로고
    • Map-reduce-merge: Simplified relational data processing on large clusters
    • New York, NY, USA, ACM
    • H. chih Yang, A. Dasdan, R.-L. Hsiao, and D. S. Parker. Map-reduce-merge: simplified relational data processing on large clusters. In SIGMOD Conference, pages 1029-1040, New York, NY, USA, 2007. ACM.
    • (2007) SIGMOD Conference , pp. 1029-1040
    • Chih Yang, H.1    Dasdan, A.2    Hsiao, R.-L.3    Parker, D.S.4
  • 10
    • 37549003336 scopus 로고    scopus 로고
    • Mapreduce: Simplified data processing on large clusters
    • J. Dean and S. Ghemawat. Mapreduce: simplified data processing on large clusters. Commun. ACM, 51(1):107-113, 2008.
    • (2008) Commun. ACM , vol.51 , Issue.1 , pp. 107-113
    • Dean, J.1    Ghemawat, S.2
  • 11
    • 52649111582 scopus 로고    scopus 로고
    • Flow algorithms for parallel query optimization
    • A. Deshpande and L. Hellerstein. Flow algorithms for parallel query optimization. In ICDE, pages 754-763, 2008.
    • (2008) ICDE , pp. 754-763
    • Deshpande, A.1    Hellerstein, L.2
  • 16
    • 77952246000 scopus 로고
    • Ph.D. thesis, Dept. of CS, Stanford Univ., Stanford CA USA, STAN-CS-93-1492
    • H. Jacobsson. Tree-based techniques for query evaluation. Ph.D. thesis, Dept. of CS, Stanford Univ., Stanford CA USA, STAN-CS-93-1492, 1993.
    • (1993) Tree-based Techniques for Query Evaluation
    • Jacobsson, H.1
  • 17
    • 4243148480 scopus 로고    scopus 로고
    • Authoritative sources in a hyperlinked environment
    • J. M. Kleinberg. Authoritative sources in a hyperlinked environment. Journal of the ACM, 46:668-677, 1999.
    • (1999) Journal of the ACM , vol.46 , pp. 668-677
    • Kleinberg, J.M.1
  • 20
    • 70349118210 scopus 로고    scopus 로고
    • Optimal splitters for database partitioning with size bounds
    • New York, NY, USA, ACM
    • K. A. Ross and J. Cieslewicz. Optimal splitters for database partitioning with size bounds. In ICDT, pages 98-110, New York, NY, USA, 2009. ACM.
    • (2009) ICDT , pp. 98-110
    • Ross, K.A.1    Cieslewicz, J.2
  • 22
    • 84976677205 scopus 로고
    • A note on the strategy space of multiway join query optimization problem in parallel systems
    • K.-L. Tan and H. Lu. A note on the strategy space of multiway join query optimization problem in parallel systems. SIGMOD Rec., 20(4):81-82, 1991.
    • (1991) SIGMOD Rec. , vol.20 , Issue.4 , pp. 81-82
    • Tan, K.-L.1    Lu, H.2
  • 23
    • 85012170387 scopus 로고    scopus 로고
    • Maximizing the output rate of multi-way join queries over streaming information sources
    • S. D. Viglas, J. F. Naughton, and J. Burger. Maximizing the output rate of multi-way join queries over streaming information sources. In VLDB, pages 285-296, 2003.
    • (2003) VLDB , pp. 285-296
    • Viglas, S.D.1    Naughton, J.F.2    Burger, J.3


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