Sciweavers

Share
EDBT
2016
ACM
33views Database» more  EDBT 2016»
3 years 1 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»
3 years 1 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»
3 years 1 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»
3 years 1 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 ...
EDBT
2016
ACM
43views Database» more  EDBT 2016»
3 years 1 months ago
Semi-automatic support for evolving functional dependencies
During the life of a database, systematic and frequent violations of a given constraint may suggest that the represented reality is changing and thus the constraint should evolve ...
EDBT
2016
ACM
40views Database» more  EDBT 2016»
3 years 1 months ago
Querying RDF Data Using A Multigraph-based Approach
RDF is a standard for the conceptual description of knowledge, and SPARQL is the query language conceived to query RDF data. The RDF data is cherished and exploited by various dom...
EDBT
2016
ACM
32views Database» more  EDBT 2016»
3 years 1 months ago
GSCALER: Synthetically Scaling A Given Graph
Enterprises and researchers often have datasets that can be represented as graphs (e.g. social networks). The owner of a large graph may want to scale it down to a smaller version...
EDBT
2016
ACM
53views Database» more  EDBT 2016»
3 years 1 months ago
Practical Query Answering in Data Exchange Under Inconsistency-Tolerant Semantics
Exchange-repair semantics (or, XR-Certain semantics) is a recently proposed inconsistency-tolerant semantics in the context of data exchange. This semantics makes it possible to p...
EDBT
2016
ACM
44views Database» more  EDBT 2016»
3 years 1 months ago
Reverse Engineering Top-k Database Queries with PALEO
Ranked lists are an essential methodology to succinctly summarize outstanding items, computed over database tables or crowdsourced in dedicated websites. In this work, we address ...
EDBT
2016
ACM
47views Database» more  EDBT 2016»
3 years 1 months ago
Maximum Coverage Representative Skyline
Skyline queries represent a dataset by the points on its pareto frontier, but can become very large. To alleviate this problem, representative skylines select exactly k skyline po...
books