Scalable analysis on large data sets has been core to the functions of a number of teams at Facebook - both engineering and nonengineering. Apart from ad hoc analysis of data and ...
This demonstration presents Crescando, an implementation of a distributed relational table that guarantees predictable response time on unpredictable workloads. In Crescando, data...
Georgios Giannikis, Philipp Unterbrunner, Jeremy M...
In-memory tree structured index search is a fundamental database operation. Modern processors provide tremendous computing power by integrating multiple cores, each with wide vect...
Changkyu Kim, Jatin Chhugani, Nadathur Satish, Eri...
Query suggestion is well-known to enhance the user's search for relevant documents. In this work, we propose a novel technique that emulates a human skill when searching or e...
Carlos Garcia-Alvarado, Carlos Ordonez, Zhibo Chen...
More and more important data is accumulated inside social networks. Limiting the flow of private information across a social network is very important, and most social networks pr...
We consider fast two-sided error-tolerant search that is robust against errors both on the query side (type alogrithm, find documents with algorithm) as well as on the document si...
Given the continuous growth of databases and the abundance of diverse files in modern IT environments, there is a pressing need to integrate keyword search on heterogeneous inform...
Effective keyword search on image databases is a major open problem, due to the inherent imprecision of keywords (tags) used to describe images' content. In this paper we pre...
Continuous SPARQL (C-SPARQL) is a new language for continuous queries over streams of RDF data. CSPARQL queries consider windows, i.e., the most recent triples of such streams, ob...
Davide Francesco Barbieri, Daniele Braga, Stefano ...