—Computing interesting measures for data cubes and subsequent mining of interesting cube groups over massive datasets are critical for many important analyses done in the real wo...
Arnab Nandi, Cong Yu, Philip Bohannon, Raghu Ramak...
We address the problem of scalable distributed reasoning, proposing a technique for materialising the closure of an RDF graph based on MapReduce. We have implemented our approach o...
Jacopo Urbani, Spyros Kotoulas, Eyal Oren, Frank v...
Complex networks capture interactions among entities in various application areas in a graph representation. Analyzing large scale complex networks often answers important question...
This paper presents a MapReduce algorithm for computing pairwise document similarity in large document collections. MapReduce is an attractive framework because it allows us to de...
We present PRISM, a privacy-preserving scheme for word search in cloud computing. In the face of a curious cloud provider, the main challenge is to design a scheme that achieves pr...
Erik-Oliver Blass, Roberto Di Pietro, Refik Molva,...