메뉴 건너뛰기




Volumn , Issue , 2012, Pages 38-49

Efficient parallel kNN joins for large data in MapReduce

Author keywords

Algorithms; H.2.4 Information Systems : Database Management Systems; Subject: Query processing

Indexed keywords

DATA MINING APPLICATIONS; DATA SETS; H.2.4 [INFORMATION SYSTEMS]: DATABASE MANAGEMENT-SYSTEMS; K-NEAREST NEIGHBORS; LARGE DATA; MAP-REDUCE; MULTIMEDIA DATABASE; SHARED NOTHING; SYNTHETIC DATASETS;

EID: 84863510705     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2247596.2247602     Document Type: Conference Paper
Times cited : (203)

References (26)
  • 2
    • 31644437209 scopus 로고    scopus 로고
    • The k-nearest neighbor join: Turbo charging the kdd process
    • C. Böhm and F. Krebs. The k-nearest neighbor join: Turbo charging the kdd process. KAIS, 6:728-749, 2004.
    • (2004) KAIS , vol.6 , pp. 728-749
    • Böhm, C.1    Krebs, F.2
  • 3
    • 0029752712 scopus 로고    scopus 로고
    • Parallel processing of spatial joins using R-trees
    • T. Brinkhoff, H.-P. Kriegel, and B. Seeger. Parallel processing of spatial joins using R-trees. In ICDE, 1996.
    • (1996) ICDE
    • Brinkhoff, T.1    Kriegel, H.-P.2    Seeger, B.3
  • 4
    • 84863509078 scopus 로고    scopus 로고
    • RanKloud: A scalable ranked query processing framework on hadoop
    • K. S. Candan, P. Nagarkar, M. Nagendra, and R. Yu. RanKloud: a scalable ranked query processing framework on hadoop. In EDBT, 2011.
    • (2011) EDBT
    • Candan, K.S.1    Nagarkar, P.2    Nagendra, M.3    Yu, R.4
  • 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
    • 0141599220 scopus 로고
    • Data-parallel spatial join algorithms
    • E. Hoel and H. Samet. Data-parallel spatial join algorithms. In ICPP, 1994.
    • (1994) ICPP
    • Hoel, E.1    Samet, H.2
  • 8
    • 0001793230 scopus 로고
    • Bucket spreading parallel hash: A new, robust, parallel hash join method for data skew in the super database computer
    • M. Kitsuregawa and Y. Ogawa. Bucket spreading parallel hash: A new, robust, parallel hash join method for data skew in the super database computer. In VLDB, 1990.
    • (1990) VLDB
    • Kitsuregawa, M.1    Ogawa, Y.2
  • 9
    • 79959945877 scopus 로고    scopus 로고
    • Llama: Leveraging columnar storage for scalable join processing in the mapreduce framework
    • Y. Lin, D. Agrawal, C. Chen, B. C. Ooi, and S. Wu. Llama: leveraging columnar storage for scalable join processing in the mapreduce framework. In SIGMOD, 2011.
    • (2011) SIGMOD
    • Lin, Y.1    Agrawal, D.2    Chen, C.3    Ooi, B.C.4    Wu, S.5
  • 10
    • 0036203052 scopus 로고    scopus 로고
    • A non-blocking parallel spatial join algorithm
    • G. Luo, J. Naughton, and C. Ellmann. A non-blocking parallel spatial join algorithm. In ICDE, 2002.
    • (2002) ICDE
    • Luo, G.1    Naughton, J.2    Ellmann, C.3
  • 11
    • 33847092356 scopus 로고    scopus 로고
    • Parallel R-tree spatial join for a shared-nothing architecture
    • L. Mutenda and M. Kitsuregawa. Parallel R-tree spatial join for a shared-nothing architecture. In DANTE, 1999.
    • (1999) DANTE
    • Mutenda, L.1    Kitsuregawa, M.2
  • 12
    • 79960020260 scopus 로고    scopus 로고
    • Processing theta-joins using mapreduce
    • A. Okcan and M. Riedewald. Processing theta-joins using mapreduce. In SIGMOD, 2011.
    • (2011) SIGMOD
    • Okcan, A.1    Riedewald, M.2
  • 13
    • 0034449228 scopus 로고    scopus 로고
    • Clone join and shadow join: Two parallel spatial join algorithms
    • J. M. Patel and D. J. DeWitt. Clone join and shadow join: two parallel spatial join algorithms. In ACM GIS, 2000.
    • (2000) ACM GIS
    • Patel, J.M.1    DeWitt, D.J.2
  • 14
    • 33846464687 scopus 로고    scopus 로고
    • Distributed computation of the kNN graph for large high-dimensional point sets
    • E. Plaku and L. E. Kavraki. Distributed computation of the kNN graph for large high-dimensional point sets. J. Parallel Distrib. Comput., 67(3):346-359, 2007.
    • (2007) J. Parallel Distrib. Comput. , vol.67 , Issue.3 , pp. 346-359
    • Plaku, E.1    Kavraki, L.E.2
  • 15
    • 84976736061 scopus 로고
    • A performance evaluation of four parallel join algorithms in a shared-nothing multiprocessor environment
    • D. Schneider and D. DeWitt. A performance evaluation of four parallel join algorithms in a shared-nothing multiprocessor environment. In SIGMOD, 1989.
    • (1989) SIGMOD
    • Schneider, D.1    DeWitt, D.2
  • 16
    • 84863509080 scopus 로고    scopus 로고
    • RankReduce - Processing K-Nearest Neighbor queries on top of MapReduce
    • A. Stupar, S. Michel, and R. Schenkel. RankReduce - processing K-Nearest Neighbor queries on top of MapReduce. In LSDS-IR, 2010.
    • (2010) LSDS-IR
    • Stupar, A.1    Michel, S.2    Schenkel, R.3
  • 17
    • 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, 2010.
    • (2010) SIGMOD
    • Vernica, R.1    Carey, M.J.2    Li, C.3
  • 18
    • 77954746347 scopus 로고    scopus 로고
    • Indexing multi-dimensional data in a cloud system
    • J. Wang, S. Wu, H. Gao, J. Li, and B. C. Ooi. Indexing multi-dimensional data in a cloud system. In SIGMOD, 2010.
    • (2010) SIGMOD
    • Wang, J.1    Wu, S.2    Gao, H.3    Li, J.4    Ooi, B.C.5
  • 19
    • 78751491852 scopus 로고    scopus 로고
    • Efficient b-tree based indexing for cloud data processing
    • S. Wu, D. Jiang, B. C. Ooi, and K.-L. Wu. Efficient b-tree based indexing for cloud data processing. PVLDB, 3(1):1207-1218, 2010.
    • (2010) PVLDB , vol.3 , Issue.1 , pp. 1207-1218
    • Wu, S.1    Jiang, D.2    Ooi, B.C.3    Wu, K.-L.4
  • 20
    • 28444451609 scopus 로고    scopus 로고
    • Gorder: An efficient method for knn join processing
    • C. Xia, H. Lu, B. C. Ooi, and J. Hu. Gorder: an efficient method for knn join processing. In VLDB, 2004.
    • (2004) VLDB
    • Xia, C.1    Lu, H.2    Ooi, B.C.3    Hu, J.4
  • 21
    • 77952749478 scopus 로고    scopus 로고
    • K nearest neighbor queries and knn-joins in large relational databases (almost) for free
    • B. Yao, F. Li, and P. Kumar. K nearest neighbor queries and knn-joins in large relational databases (almost) for free. In ICDE, 2010.
    • (2010) ICDE
    • Yao, B.1    Li, F.2    Kumar, P.3
  • 22
    • 33846555533 scopus 로고    scopus 로고
    • Efficient index-based knn join processing for high-dimensional data
    • C. Yu, B. Cui, S. Wang, and J. Su. Efficient index-based knn join processing for high-dimensional data. Inf. Softw. Technol., 49(4):332-344, 2007.
    • (2007) Inf. Softw. Technol. , vol.49 , Issue.4 , pp. 332-344
    • Yu, C.1    Cui, B.2    Wang, S.3    Su, J.4
  • 23
    • 74349115534 scopus 로고    scopus 로고
    • High-dimensional knn joins with incremental updates
    • C. Yu, R. Zhang, Y. Huang, and H. Xiong. High-dimensional knn joins with incremental updates. Geoinformatica, 14(1):55-82, 2010.
    • (2010) Geoinformatica , vol.14 , Issue.1 , pp. 55-82
    • Yu, C.1    Zhang, R.2    Huang, Y.3    Xiong, H.4
  • 24
    • 72349098496 scopus 로고    scopus 로고
    • Spatial queries evaluation with mapreduce
    • S. Zhang, J. Han, Z. Liu, K. Wang, and S. Feng. Spatial queries evaluation with mapreduce. In GCC, 2009.
    • (2009) GCC
    • Zhang, S.1    Han, J.2    Liu, Z.3    Wang, K.4    Feng, S.5
  • 25
    • 72049084511 scopus 로고    scopus 로고
    • SJMR: Parallelizing spatial join with MapReduce on clusters
    • S. Zhang, J. Han, Z. Liu, K. Wang, and Z. Xu. SJMR: Parallelizing spatial join with MapReduce on clusters. In CLUSTER, 2009.
    • (2009) CLUSTER
    • Zhang, S.1    Han, J.2    Liu, Z.3    Wang, K.4    Xu, Z.5
  • 26
    • 0032412608 scopus 로고    scopus 로고
    • Data partitioning for parallel spatial join processing
    • X. Zhou, D. Abel, and D. Truffet. Data partitioning for parallel spatial join processing. Geoinformatica, 2:175-204, 1998.
    • (1998) Geoinformatica , vol.2 , pp. 175-204
    • Zhou, X.1    Abel, D.2    Truffet, D.3


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