DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Conjunctive query
Conjunctive query
Optimizing Select-Project-Join Expressions
Download
Conjunctive Queries
Conjunctive Queries
Conjunctive Queries Complexity & Decomposition Techniques
Certain Conjunctive Query Answering in SQL
Queries with Guarded Negation
4Conjunctive Queries
Constraint Satisfaction Complexity and Logic Phokion G. Kolaitis IBM Almaden Research Center & UC Santa Cruz
Block-Sorted Quantified Conjunctive Queries
Relational Databases, Logic, and Complexity
Conjunctive Query Answering Under Existential Rules - Decidability, Complexity, and Algorithms Michaël Thomazo
Answering Conjunctive Queries with Inequalities∗
Query Answering in Databases and Ontologies
A General Procedure to Test Conjunctive Query Containment
A Negative Conjunctive Query Is Easy If and Only If It Is Beta-Acyclic
Additive First-Order Queries
The Complexity of Relational Queries: a Personal Perspective
Top View
Background Knowledge • Conjunctive Queries: the Basis for Data Integration/Exchange, Metadata Management, Ontology-Based Data
Conjunctive Query Containment Revisited (
Conjunctive Query Containment and Answering Under Description Logic Constraints
Logic and Databases II
Constraint Satisfaction, Databases, and Logic
The Dichotomy of Conjunctive Queries on Probabilistic Structures∗
Lecture 1: Conjunctive Queries 1.1 Basics of Conjunctive Queries
The Complexity of Acyclic Conjunctive Queries
Database Theory
The Complexity of Causality and Responsibility for Query Answers and Non-Answers∗
Answering Conjunctive Queries with Inequalities
Conjunctive Queries
Containment of Conjunctive Queries with Negation: Algorithms and Experiments
Conjunctive-Query Containment and Constraint Satisfaction
First-Order Queries Chapter I First-Order Logic Outline
A the Fine Classification of Conjunctive Queries And
Constraint Satisfaction and Logic Phokion G. Kolaitis IBM Almaden Research Center and UC Santa Cruz
Conjunctive Query Answering for Directional Rules Technical Report 3026 AIFB, Kalrsruhe Institute of Technology
The Complexity of Acyclic Conjunctive Queries Revisited Arnaud Durand, Etienne Grandjean
T2: Complexity of Query Evaluation L8: Query Containment & Homomorphisms
On the Equivalence of Recursive and Nonrecursive Datalog Programs
Processing Unions of Conjunctive Queries with Negation Under Limited Access Patterns
Boolean Tensor Decomposition for Conjunctive Queries with Negation
Queries with Negation and Inequalities Over Lightweight Ontologies
DATABASE and QUERY ANALYSIS TOOLS for MYSQL: EXPLOITING HYPERTREE and HYPERGRAPH DECOMPOSITIONS a Thesis Presented to the Facult
TREE-WIDTH for FIRST ORDER FORMULAE 1. Introduction Model Checking Is an Important Problem in Complexity Theory. It Asks For
Logic and Databases
Logic and Complexity
Rewriting Ontological Queries Into Small Nonrecursive Datalog Programs?
Database Theory
Conjunctive Query Answering in the Description Logic EL Using a Relational Database System
Query Answering Exploiting Structural Properties∗
TREE-WIDTH for FIRST ORDER FORMULAE 1. Introduction Model Checking Is an Important Problem in Complexity Theory. It Asks For
Database Theory
Conjunctive Queries
Logic and Constraint Satisfaction an Introduction
Conjunctive Query Answering for the Description Logic SHIQ
Lecture 1: Conjunctive Queries 1.1 Basics of Conjunctive Queries
Techniques for Query Rewriting Based on Interpolation
Complexity of Constraints, 06401 01/10/06-06/10/06
Learnability of Solutions to Conjunctive Queries
Conjunctive Query Answering with OWL 2 QL
Foundations of Databases