Sciweavers

ICDT
2016
ACM
56views Database» more  ICDT 2016»
8 years 8 months ago
Streaming Partitioning of Sequences and Trees
We study streaming algorithms for partitioning integer sequences and trees. In the case of trees, we suppose that the input tree is provided by a stream consisting of a depth-fir...
Christian Konrad
ICDT
2016
ACM
53views Database» more  ICDT 2016»
8 years 8 months ago
The ICDT 2016 Test of Time Award Announcement
Foto N. Afrati, Claire David, Georg Gottlob
ESE
2016
66views Database» more  ESE 2016»
8 years 8 months ago
Empirical assessment of machine learning-based malware detectors for Android - Measuring the gap between in-the-lab and in-the-w
To address the issue of malware detection through large sets of applications, researchers have recently started to investigate the capabilities of machine-learning techniques for p...
Kevin Allix, Tegawendé F. Bissyandé,...
ESE
2016
62views Database» more  ESE 2016»
8 years 8 months ago
An empirical study of the textual similarity between source code and source code summaries
Source code documentation often contains summaries of source code written by authors. Recently, automatic source code summarization tools have emerged that generate summaries witho...
Paul W. McBurney, Collin McMillan
ESE
2016
75views Database» more  ESE 2016»
8 years 8 months ago
Linguistic antipatterns: what they are and how developers perceive them
Venera Arnaoudova, Massimiliano Di Penta, Giuliano...
EDBT
2016
ACM
33views Database» more  EDBT 2016»
8 years 8 months ago
Double Chain-Star: an RDF indexing scheme for fast processing of SPARQL joins
State of the art RDF stores often rely on exhaustive indexing and sequential (self-)joins for SPARQL query processing. However, query execution is dependent on, and often limited ...
EDBT
2016
ACM
41views Database» more  EDBT 2016»
8 years 8 months ago
Providing Serializability for Pregel-like Graph Processing Systems
There is considerable interest in the design and development of distributed systems that can execute algorithms to process large graphs. Serializability guarantees that parallel e...
EDBT
2016
ACM
106views Database» more  EDBT 2016»
8 years 8 months ago
Data Wrangling for Big Data: Challenges and Opportunities
Data wrangling is the process by which the data required by an application is identified, extracted, cleaned and integrated, to yield a data set that is suitable for exploration ...
Tim Furche, Georg Gottlob, Leonid Libkin, Giorgio ...
EDBT
2016
ACM
64views Database» more  EDBT 2016»
8 years 8 months ago
Summarizing Linked Data RDF Graphs Using Approximate Graph Pattern Mining
The Linked Open Data (LOD) cloud brings together information described in RDF and stored on the web in (possibly distributed) RDF Knowledge Bases (KBs). The data in these KBs are ...