Hash tables are a fundamental data structure for effectively storing and accessing sparse
data, with widespread usage in domains ranging from computer graphics to machine …

To-date, the application of high-performance computing resources to Semantic Web data
has largely focused on commodity hardware and distributed memory platforms. In this paper …

Hashing is essential for efficient searching, with Cuckoo Hashing being a prominent
technique since its inception. Based on the size of the hash tables, Cuckoo Hashing is …

Implementing parallel graph algorithms in large, shared memory machines, such as the
Cray XMT, can be challenging for programmers. Synchronization, deadlock, hot spotting …

Automotive Industry is a booming business which not only brings enormous benefits but
cause troubles to the environment. Developing this profitable industry without sacrificing the …

We present an RDFS closure algorithm, specifically designed and implemented on the Cray
XMT supercomputer, that obtains inference rates of 13 million inferences per second on the …

Hashing is a fundamental technique in computer science to allow O (1) insert and lookups of
items in an associative array. Here we present several thread coordination and hashing …

A recent trend in hardware development is producing computing systems that are stretching
the number of cores and size of shared-memory beyond where most fundamental serial …

As semantic graph database technology grows to address components ranging from extant
large triple stores to SPARQL endpoints over SQL-structured relational databases, it will …

A key challenge to automated clustering of documents in large text corpora is the high cost
of comparing documents in a multi-million dimensional document space. The Anchors …