# Beginner question about CUDA

**URL:** <https://forums.developer.nvidia.com/t/beginner-question-about-cuda/42254>\
**Category:** CUDA Programming and Performance\
**Created:** [April 11, 2016, 5:37pm UTC](https://forums.developer.nvidia.com/t/beginner-question-about-cuda/42254 "2016-04-11T17:37:10Z")\
**Posts on this page:** 4\
**Page:** 1

<div class="post-metadata">

**Author:** ![diegobernardes](https://developer.download.nvidia.com/images/forums/profile-default-devtalk-84.png) [@diegobernardes](https://forums.developer.nvidia.com/u/diegobernardes)\
**Post date:** [April 11, 2016, 5:37pm UTC](https://forums.developer.nvidia.com/t/beginner-question-about-cuda/42254/1 "2016-04-11T17:37:10Z")

</div>

I’m learning more about gpgpu recently and found cuda amazing, but still have some doubts about how and when to use it.

I’ve made a toy project to create a full text search from scratch in c, so far, so good, works well and have very good precision. Now i want to handle a very large set of data and my system starts to get slow, there is some things that i can do to improve, but, don’t gonna solve the whole scenario.

GPGPU can be applied to full text search? Didn’t found anything solid about this.

---

<div class="post-metadata">

**Author:** ![njuffa](https://developer.download.nvidia.com/images/forums/profile-default-devtalk-84.png) [@njuffa](https://forums.developer.nvidia.com/u/njuffa)\
**Post date:** [April 11, 2016, 5:52pm UTC](https://forums.developer.nvidia.com/t/beginner-question-about-cuda/42254/2 "2016-04-11T17:52:11Z")

</div>

What kind of text search? Two random online examples:

[url][http://aser.ornl.gov/cui/personal/document/epham09.pdf[/url]](http://aser.ornl.gov/cui/personal/document/epham09.pdf%5B/url%5D)  
Zhang, Yongpeng, et al. “GPU-accelerated text mining.” Workshop on exploiting parallelism using GPUs and other hardware-assisted methods. 2009.

[url][http://www.gpucomputing.net/sites/default/files/papers/1221/pattmatch-report.pdf[/url]](http://www.gpucomputing.net/sites/default/files/papers/1221/pattmatch-report.pdf%5B/url%5D)  
Onsjo, Mikael, Yoshinori Aono, and O. Watanabe. “Online approximate string matching with CUDA.” 2009-12-18]. http: //pds13. egloos. com/pds/2009 07/26/57/pattmatch-report. pdf (2009).

---

<div class="post-metadata">

**Author:** ![diegobernardes](https://developer.download.nvidia.com/images/forums/profile-default-devtalk-84.png) [@diegobernardes](https://forums.developer.nvidia.com/u/diegobernardes)\
**Post date:** [April 11, 2016, 6:35pm UTC](https://forums.developer.nvidia.com/t/beginner-question-about-cuda/42254/3 "2016-04-11T18:35:10Z")

</div>

thanks njuffa, gonna read this papers.

My engine is a full text search but i don’t use tf-idf, it’s a simpler and more focused algorithm to work with structured data, something like Algolia ([Ranking Algorithm Unveiled: How Algolia Makes Search Better | Algolia Blog](https://blog.algolia.com/search-ranking-algorithm-unveiled/)).

---

<div class="post-metadata">

**Author:** ![njuffa](https://developer.download.nvidia.com/images/forums/profile-default-devtalk-84.png) [@njuffa](https://forums.developer.nvidia.com/u/njuffa)\
**Post date:** [April 11, 2016, 8:21pm UTC](https://forums.developer.nvidia.com/t/beginner-question-about-cuda/42254/4 "2016-04-11T20:21:49Z")

</div>

If you know what you are looking for, you can identify relevant literature with ease by using Google Scholar ([scholar.google.com](http://scholar.google.com)). Getting access to those papers may be a different story, as not everything is available online for free, and some good papers may be behind a paywall.