박사

고차원 빅데이터를 위한 GPU기반 범위 질의의 병렬화 및 최적화 = GPU based Parallelization and Optimization of Range Query for High-Dimensional Big Data

김민철 2020년
논문상세정보
' 고차원 빅데이터를 위한 GPU기반 범위 질의의 병렬화 및 최적화 = GPU based Parallelization and Optimization of Range Query for High-Dimensional Big Data' 의 주제별 논문영향력
논문영향력 선정 방법
논문영향력 요약
주제
  • Parallel Processing
  • gpu
  • indexing
동일주제 총논문수 논문피인용 총횟수 주제별 논문영향력의 평균
203 0

0.0%

' 고차원 빅데이터를 위한 GPU기반 범위 질의의 병렬화 및 최적화 = GPU based Parallelization and Optimization of Range Query for High-Dimensional Big Data' 의 참고문헌

  • “ MicrosoftCOCO :Common Objects in” inComputer Vision -ECCV 2014 : 13th EuropeanConference , Zurich , Switzerland , September 6-12 , 2014 , Proceedings , Part V , D. Fleet , T. Pajdla , B. Schiele , and T. Tuytelaars ,
    , pp . 740–755
  • [6] A. Blum, J. Hopcroft, and R. Kannan, “Foundations of Data Science *,” 2018.
    [2018]
  • [5] J. E. Gentle, Computational Statistics. Springer, 2009.
  • [33] G. Bradski, “The OpenCV Library.” [Online]. Available: https://opencv.org/. [Accessed: 06-Mar-2016].
  • [29] D. P. Doane and L. E. Seward, “Measuring Skewness: A Forgotten Statistic?,” J. Stat. Educ., vol. 19, no. 2, 2011.
  • [25] C. Faloutsos and S. Roseman, “Fractals for secondary key retrieval,” in Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems - PODS ’89, 1989, pp. 247–252.
  • [1] NVIDIA, CUDA C Programming Guide, no. September. 2017.
  • [15] I. Kamel andC. Faloutsos, “On Packing R-trees,” in Proceedings of the Second InternationalConference on Information and Knowledge Management, 1993, pp. 490–499.
    pp . 490–499 [1993]
  • X-tree source.
  • Ubiquitous B-Tree
    vol . 11 , no . 2 , pp . 121–137 , [1979]
  • The pyramid-technique : towards breaking the curse of dimensionality ,
    vol . 27 , no . 2 , pp . 142–153 . [1998]
  • The properties of high-dimensional data spaces : Implications for exploring gene and protein expression data
    vol . 8 , no . 1 , pp . 37–49 [2008]
  • The X-tree : An Index Structure for High-Dimensional Data
    pp . 28–39 . [1996]
  • The SR-tree : An Index Structure for Highdimensional Nearest Neighbor Queries
    pp . 369– 380 [1997]
  • The R+-Tree : A Dynamic Index for Multi-Dimensional Objects
    pp . 507–518 . [1987]
  • The R * -tree : an efficient and robust access method for points and rectangles
    90 , [1990]
  • The Open Images Dataset V4 : Unified image classification , object detection , and visual relationship detection at scale
    [2018]
  • The K-D-B-tree : A Search Structure for Large Multidimensional Dynamic Indexes
    pp . 10–18 . [1981]
  • Speeded-Up Robust Features ( SURF )
    vol . 110 , no . 3 , pp . 346–359 ,
  • Similarity indexing with the SS-tree
    pp . 516–523
  • Searching in High-dimensional Spaces : Index Structures for Improving the Performance of Multimedia Databases
    vol . 33 , no . 3 , pp . 322–373 [2001]
  • STR : A Simple and Efficient Algorithm for R-tree Packing
    [1997]
  • SR-Tree source.
  • Rodinia : A benchmark suite for heterogeneousComputing
  • R-trees : A Dynamic Index Structure for Spatial Searching ,
    pp . 47–57 . [1984]
  • Performance analysis of R * -trees with arbitrary node extents ,
    vol . 16 , no . 6 , pp . 653–668 , [2004]
  • Parallel implementation of R-trees on the GPU
    pp . 353–358 [2012]
  • Parallel Spatial Query Processing on GPUs Using R-trees
    pp . 23–31 . [2013]
  • Parallel Range Query Processing on RTree with Graphics Processing Unit
    pp . 1235–1242 . [2011]
  • Parallel Prefix Sum ( Scan ) with CUDA
    [2007]
  • Measuring Cache and TLB Performance and Their Effect on Benchmark Runtimes
    vol . 44 , no . 10 , pp . 1223–1235 [1995]
  • Making the pyramid technique robust to query types and workloads
    pp . 313–324
  • KPYR : An Efficient Indexing Method
    pp . 1448–1451
  • Impact of L2 cache locking on GPU performance
    vol . 2015-June , no . June , pp . 1–4 , [2015]
  • ImageNet : A largescale hierarchical image database
    no . June , pp . 248–255 [2010]
  • Direct Spatial Search on Pictorial Databases Using Packed R-trees
    pp . 17–31 . [1985]
  • Cache Performance Of The Spec92 Benchmark Suite
    vol . 13 , no . 4 , pp . 17–27 [1993]
  • An Effective GPU Implementation of Breadthfirst Search
    pp . 52–55 [2010]
  • Accelerating Range Query Processing on R-Tree Using Graphics Processing Units
    vol . E96.D , no . 12 , pp . 2776–2785 [2013]
  • A Performance Study of Traversing Spatial Indexing Structures in Parallel on GPU
    pp . 855–860 . [2012]