Searching and mining large graphs today is critical to a variety of application domains, ranging from personalized recommendation in social networks, to searches for functional ass...
-- In this paper, we put forward our approach for answering aggregated queries over imprecise data using domain specific taxonomies. A new concept we call the weighted hierarchical...
We describe an approach to create a synthetic workload for large scale extensional query answering experiments. The workload comprises multiple interrelated domain ontologies, data...
Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) with only...
Alin Dobra, Minos N. Garofalakis, Johannes Gehrke,...
Strict consistency of replicated data is infeasible or not required by many distributed applications, so current systems often permit stale replication, in which cached copies of ...