Generalized Schema Mapping: From Termination To Tractability

Generalized Schema Mapping: From Termination To Tractability

Bibliographic Details
Main Author:	Marnette, B
Format:	Journal article
Published:	2009

Similar Items

Static Analysis of Schema−Mappings ensuring Oblivious Termination
by: Marnette, B, et al.
Published: (2010)

The order encoding: From tractable CSP to tractable SAT
by: Petke, J, et al.
Published: (2011)

The order encoding: from tractable CSP to tractable SAT
by: Petke, J, et al.
Published: (2011)

Generalized Majority-Minority Operations are Tractable
by: Victor Dalmau
Published: (2006-09-01)

The Directed Steiner Network problem is tractable for a constant number of terminals
by: Feldman, Jon, 1975-
Published: (2014)

The order encoding: from tractable CSP to tractable SAT (extended abstract)
by: Petke, J, et al.
Published: (2011)

Generalized hypertree decompositions: np-hardness and tractable variants.
by: Gottlob, G, et al.
Published: (2007)

Hybrid tractable CSPs which generalize tree structure
by: Cooper, M, et al.
Published: (2008)

Generalized hypertree decompositions: np−hardness and tractable variants
by: Gottlob, G, et al.
Published: (2007)

Tractable triangles
by: Cooper, M, et al.
Published: (2011)

Generalizing the Schema Calculus: Database Schemas and Beyond
by: Martin, A, et al.
Published: (2003)

Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination
by: Cooper, M, et al.
Published: (2010)

Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination
by: Cooper, M, et al.
Published: (2010)

Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination
by: Cooper, M, et al.
Published: (2010)

Generalizing the Z Schema Calculus: Database Schemas and Beyond
by: Martin, A, et al.
Published: (2003)

Limits of schema mappings
by: Kolaitis, P, et al.
Published: (2017)

Limits of Schema Mappings
by: Kolaitis, P, et al.
Published: (2016)

Schema matching and mapping /
by: Bellahsn̈e, Zohra, 1954-, et al.
Published: (2011)

Perfect Constraints Are Tractable
by: Salamon, A, et al.
Published: (2008)

Characterising Tractable Constraints
by: M.C.Cooper, et al.
Published: (1994)

Tractable valued constraints
by: Jeavons, P, et al.
Published: (2012)

Tractable Disjunctive Constraints
by: D.A.Cohen, et al.
Published: (1997)

A Test for Tractability
by: P.G.Jeavons, et al.
Published: (1996)

Perfect Constraints Are Tractable
by: Salamon, A, et al.
Published: (2008)

On Tractable Queries and Constraints
by: Gottlob, G, et al.
Published: (1999)

Tractable Valued Constraints
by: Jeavons, P, et al.
Published: (2013)

On tractability and congruence distributivity
by: Emil Kiss, et al.
Published: (2007-06-01)

Tractable Inference Relations
by: Givan, Robert, et al.
Published: (2004)

Tractable uncertainty for structure learning
by: Wang, B, et al.
Published: (2022)

New tractable classes from old
by: Cohen, D, et al.
Published: (2003)

New Tractable Classes From Old
by: Cohen, D, et al.
Published: (2003)

Composition and Inversion of Schema Mappings
by: Reutter, M, et al.
Published: (2009)

Normalization and optimization of schema mappings.
by: Gottlob, G, et al.
Published: (2011)

Foundations of Schema Mapping Management
by: Reutter, M, et al.
Published: (2010)

Schema mapping discovery from data instances.
by: Gottlob, G, et al.
Published: (2010)

Tractable Benchmarks For Constraint Programming
by: Petke, J, et al.
Published: (2009)

Hypertree Decompositions and Tractable Queries
by: Gottlob, G, et al.
Published: (1999)

Hypertree Decompositions and Tractable Queries
by: Gottlob, G, et al.
Published: (1999)

On computational tractability for rational verification
by: Gutierrez, J, et al.
Published: (2019)

Building tractable disjunctive constraints
by: Cohen, D, et al.
Published: (2000)