• Home
  • News
  • Tutorials
  • Analysis
  • About
  • Contact

TechEnablement

Education, Planning, Analysis, Code

  • CUDA
    • News
    • Tutorials
    • CUDA Study Guide
  • OpenACC
    • News
    • Tutorials
    • OpenACC Study Guide
  • Xeon Phi
    • News
    • Tutorials
    • Intel Xeon Phi Study Guide
  • OpenCL
    • News
    • Tutorials
    • OpenCL Study Guide
  • Web/Cloud
    • News
    • Tutorials
You are here: Home / News / GPUdb Filters And Displays Billions Of Tweets In Seconds On Parallel Devices

GPUdb Filters And Displays Billions Of Tweets In Seconds On Parallel Devices

September 17, 2014 by Rob Farber Leave a Comment

Twitter is a fantastic news source and provider of billions of noisy, needle-in-the-haystack tweets to confound data-scientists and delight analysts plus commercial marketing efforts. Interactivity with billions of data items is key to developing, understanding, and validating analysis. (Validation is emphasized as Google was recently fingered by IEEE Spectrum for biased testing of self-driving cars.) Visualizing twitter data is challenging in the geographic sense because billions of tweets simply wipe out the background map. Even more challenging is the tagline I use for graph analysis that, “A laptop can represent a billion node graph. People don’t understand billion node graphs, or million, or thousand, or hundred, or even graphs many more than ten nodes.” For these reasons, the interactivity and display capability of the distributed GPUdb database is interesting and potentially a “deal-maker” for social analytics types.

Following is an introductory video by GPUdb:

They have even made a web-enabled interactive demo available for evaluation.

Click to view demo

Click to view demo

While visualization is key, so is validation and the ability to distil information down to a simple set of metrics. See my GTC 2013 talk where the click-together framework processes a billion tweets in an interactive fashion on a commodity workstation. The ability to process a billion tweets quickly was key to development of the idea of “sociolects” to identify groups in social media purely by word usage (See here for to read the peer-reviewed, “Sociolect-based Community Detection“) to enable analysis and validation (via triangulation and numerical methods) for social media.

Start at 39 minutes into the video. The slides can be viewed here starting at slide 34.

http://on-demand.gputechconf.com/gtc/2013/video/S3443-GPUs-Portable-Persistent-Scalable-Massive-Data-Framework.mp4

Share this:

  • Twitter

Filed Under: News Tagged With: GPU, HPC, Intel, Intel Xeon Phi

Leave a Reply Cancel reply

Your email address will not be published. Required fields are marked *

Tell us you were here

Recent Posts

Farewell to a Familiar HPC Friend

May 27, 2020 By Rob Farber Leave a Comment

TechEnablement Blog Sunset or Sunrise?

February 12, 2020 By admin Leave a Comment

The cornerstone is laid – NVIDIA acquires ARM

September 13, 2020 By Rob Farber Leave a Comment

Third-Party Use Cases Illustrate the Success of CPU-based Visualization

April 14, 2018 By admin Leave a Comment

More Tutorials

Learn how to program IBM’s ‘Deep-Learning’ SyNAPSE chip

February 5, 2016 By Rob Farber Leave a Comment

Free Intermediate-Level Deep-Learning Course by Google

January 27, 2016 By Rob Farber Leave a Comment

Intel tutorial shows how to view OpenCL assembly code

January 25, 2016 By Rob Farber Leave a Comment

More Posts from this Category

Top Posts & Pages

  • Morton Order Improves Performance
  • HPC Balance and Common Sense
  • Feynman Lectures on Physics Now Free to Study Online
  • Scalable Out-Of-Core Solvers On A Cluster
  • Intel Xeon Phi for CUDA Programmers

Archives

© 2026 · techenablement.com