Sciweavers

PODS
2015
ACM
18views Database» more  PODS 2015»
8 years 8 months ago
On Top-k Range Reporting in 2D Space
Saladi Rahul, Yufei Tao
PODS
2015
ACM
28views Database» more  PODS 2015»
8 years 8 months ago
High-Level Why-Not Explanations using Ontologies
Balder ten Cate, Cristina Civili, Evgeny Sherkhono...
PODS
2015
ACM
24views Database» more  PODS 2015»
8 years 8 months ago
Chase Termination for Guarded Existential Rules
Abstract. The chase procedure is considered as one of the most fundamental algorithmic tools in database theory. It has been successfully applied to different database problems suc...
Marco Calautti, Georg Gottlob, Andreas Pieris
PODS
2015
ACM
31views Database» more  PODS 2015»
8 years 8 months ago
The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints
A relational database is said to be uncertain if primary key constraints can possibly be violated. A repair (or possible world) of an uncertain database is obtained by selecting a...
Paraschos Koutris, Jef Wijsen
PODS
2015
ACM
11views Database» more  PODS 2015»
8 years 8 months ago
Join Dependency Testing, Loomis-Whitney Join, and Triangle Enumeration
In this paper, we revisit two fundamental problems in database theory. The first one is called join dependency (JD) testing, where we are given a relation r and a JD, and need to...
Xiaocheng Hu, Miao Qiao, Yufei Tao
PODS
2015
ACM
11views Database» more  PODS 2015»
8 years 8 months ago
Symmetric Weighted First-Order Model Counting
Paul Beame, Guy Van den Broeck, Eric Gribkoff, Dan...
PODS
2015
ACM
13views Database» more  PODS 2015»
8 years 8 months ago
Smooth Tradeoffs between Insert and Query Complexity in Nearest Neighbor Search
Locality Sensitive Hashing (LSH) has emerged as the method of choice for high dimensional similarity search, a classical problem of interest in numerous applications. LSH-based so...
Michael Kapralov
PODS
2015
ACM
18views Database» more  PODS 2015»
8 years 8 months ago
Querying Big Data by Accessing Small Data
This paper investigates the feasibility of querying big data by accessing a bounded amount of the data. We study boundedly evaluable queries under a form of access constraints, wh...
Wenfei Fan, Floris Geerts, Yang Cao, Ting Deng, Pi...
PODS
2015
ACM
14views Database» more  PODS 2015»
8 years 8 months ago
Recovering Exchanged Data
The inversion of data exchange mappings is one of the thorniest issues in data exchange. In this paper we study inverse data exchange from a novel perspective. Previous work has d...
Gösta Grahne, Ali Moallemi, Adrian Onet