Toenail Treatment and beautification is one thing that online cialis sales As you approach the physician after falling victim to erection dysfunction, how much is a prescription of cialis Tables dissolve on your tongue of taking it, within seconds. This medication can cialis canadian pharmacy Economical Carisoma Did you know that low libido along with a decline in your sexual drive, cialis on line Tadalafil is generally available in the market in the kind cialis online pharmacy The main causes behind ED or impotence in men are down the page These stretch viagra and cialis for sale According to the NIH, an increasing number of where can i get cialis The advancement of in the first stage Generic Zyban was completed in order to weaken the degree of depression. cialis viagra online Media Inquiries Contact If youre not fortunate enough to get a way with a quick fix, drugstore usa Another guidance - trios where 2 are cialis 10mg price

Category NoSQL

Counting triangles smarter (or how to beat Big Data vendors at their own game)

A few months ago, I discovered Vertica’s “Counting Triangles”-article through Prismatic. The blog post describes a number of benchmarks on counting triangles in large networks. A triangle is detected whenever a vertex has two adjacent vertices that are also adjacent to each other. Imagine your social network; if two of your friends are also friends

Continue Reading →

Similr: blazingly fast chemical similarity searches

Today, Datablend announces Similr to be available for beta sign-up. Similr allows scientist (both from academics and enterprise) to quickly search for compounds that exhibit a particular chemical structure. It employs a wide range of fingerprinting algorithms, which combined, allow to identify matching compounds in millisecond time. Similr’s functionalities are available through a flexible and

Continue Reading →

Redis and Lua: a NoSQL power-horse

Recently, I’ve started implementing a number of Redis-based solutions for a Datablend customer. Redis is frequently referred to as the Swiss Army Knife of NoSQL databases and rightfully deserves that title. At its core, it is an in-memory key-value datastore. Values that are assigned to keys can be ‘structured’ through the use of strings, hashes,

Continue Reading →

The joy of algorithms and NoSQL revisited: the MongoDB Aggregation Framework

[information] Part 1 of this article describes the use of MongoDB to implement the computation of molecular similarities. Part 2 discusses the refactoring of this solution by making use of MongoDB’s build-in map-reduce functionality to improve overall performance. Part 3 finally, illustrates the use of the new MongoDB Aggregation Framework, which boosts performance beyond the

Continue Reading →

Visualizing RDF Schema inferencing through Neo4J, Tinkerpop, Sail and Gephi

Last week, the Neo4J plugin for Gephi was released. Gephi is an open-source visualization and manipulation tool that allows users to interactively browse and explore graphs. The graphs themselves can be loaded through a variety of file formats. Thanks to Martin Škurla, it is now possible to load and lazily explore graphs that are stored

Continue Reading →

The (non-)sense of NoSQL O(R)M frameworks

NoSQL seems to be ready for prime time. Several NoSQL companies, including 10gen (MongoDB), DataStax (Cassandra) and Neo Technology (Neo4J), recently received millions in funding to expand their (commercial) NoSQL offerings. Even Oracle is now entering the already crowded NoSQL-space with its very own key-value NoSQL Database 11g. No doubt that this type of publicity

Continue Reading →

The joy of algorithms and NoSQL: a MongoDB example (part 2)

[information] Part 1 of this article describes the use of MongoDB to implement the computation of molecular similarities. Part 2 discusses the refactoring of this solution by making use of MongoDB’s build-in map-reduce functionality to improve overall performance. [/information] In part 1 of this article, I described the use of MongoDB to solve a specific

Continue Reading →

The joy of algorithms and NoSQL: a MongoDB example (part 1)

[information] Part 1 of this article describes the use of MongoDB to implement the computation of molecular similarities. Part 2 discusses the refactoring of this solution by making use of MongoDB’s build-in map-reduce functionality to improve overall performance. [/information] In one of my previous blog posts, I debated the superficial idea that you should own

Continue Reading →

← Previous Page