Sciweavers

160 search results - page 5 / 32
» Definition and Complexity of Some Basic Metareasoning Proble...
Sort
View
PODS
2008
ACM
141views Database» more  PODS 2008»
14 years 7 months ago
On the complexity of deriving schema mappings from database instances
We introduce a theoretical framework for discovering relationships between two database instances over distinct and unknown schemata. This framework is grounded in the context of ...
Pierre Senellart, Georg Gottlob
LICS
2012
IEEE
11 years 10 months ago
Graph Logics with Rational Relations and the Generalized Intersection Problem
Abstract—We investigate some basic questions about the interaction of regular and rational relations on words. The primary motivation comes from the study of logics for querying ...
Pablo Barceló, Diego Figueira, Leonid Libki...
ESWS
2008
Springer
13 years 9 months ago
Foundations of RDF Databases
The goal of this paper is to give an overview of the basics of the theory of RDF databases. We provide a formal definition of RDF that includes the features that distinguish this m...
Claudio Gutierrez
ECCC
2011
185views ECommerce» more  ECCC 2011»
13 years 2 months ago
Property Testing Lower Bounds via Communication Complexity
We develop a new technique for proving lower bounds in property testing, by showing a strong connection between testing and communication complexity. We give a simple scheme for r...
Eric Blais, Joshua Brody, Kevin Matulef
SIGSOFT
2008
ACM
14 years 8 months ago
Experience in using a process language to define scientific workflow and generate dataset provenance
This paper describes our experiences in exploring the applicability of software engineering approaches to scientific data management problems. Specifically, this paper describes h...
Leon J. Osterweil, Lori A. Clarke, Aaron M. Elliso...