141
click to vote
VLDB
2016
ACM
10 years 6 days ago
2016
ACM
The Big Data problem is characterized by the so called 3V features: Volume - a huge amount of data, Velocity - a high data ingestion rate, and Variety - a mix of structured data, ...
156
click to vote
VLDB
2016
ACM
10 years 6 days ago
2016
ACM
For a directed graph G with vertex set V we call a subset C ⊆ V a k-(All-)Path Cover if C contains a node from any path consisting of k nodes. This paper considers the problem o...
153
click to vote
VLDB
2016
ACM
10 years 6 days ago
2016
ACM
We propose techniques for processing SPARQL queries over a large RDF graph in a distributed environment. We adopt a “partial evaluation and assembly” framework. Answering a SPA...
112
click to vote
ICDT
2016
ACM
10 years 14 days ago
2016
ACM
In this paper, we study the communication complexity for the problem of computing a conjunctive query on a large database in a parallel setting with p servers. In contrast to prev...
113
click to vote
ICDT
2016
ACM
10 years 14 days ago
2016
ACM
Probabilistic programming languages are used for developing statistical models, and they typically consist of two components: a specification of a stochastic process (the prior),...
120
click to vote
ICDT
2016
ACM
10 years 14 days ago
2016
ACM
Filtering a set of items, based on a set of properties that can be verified by humans, is a common application of CrowdSourcing. When the workers are error-prone, each item is pr...
209
click to vote
ICDT
2016
ACM
10 years 14 days ago
2016
ACM
We examine document spanners, a formal framework for information extraction that was introduced by Fagin et al. (PODS 2013). A document spanner is a function that maps an input st...
114
click to vote
ICDT
2016
ACM
10 years 14 days ago
2016
ACM
Well-designed pattern trees (wdPTs) have been introduced as an extension of conjunctive queries to allow for partial matching – analogously to the OPTIONAL operator of the seman...