Exploració per autor "Farré Tost, Carles"
Ara es mostren els items 34-38 de 38
-
Testing Termination of Query Satisfiability Checking on Expressive Database Schemas
Rull Fort, Guillem; Farré Tost, Carles; Teniente López, Ernest; Urpí Tubella, Antoni (2010-03-19)
Report de recerca
Accés obertA query is satisfiable if there is at least one consistent instance of the database in which it has a non-empty answer. Defining queries on a database schema and checking their satisfiability can help the database designer ... -
The Constructive method for query containment checking (extended version)
Farré Tost, Carles; Teniente López, Ernest; Urpí Tubella, Antoni (1999-07)
Report de recerca
Accés obertWe present a new method that checks Query Containment for queries with negated derived atoms and/or integrity constraints. Existing methods for Query Containment checking that deal with these cases do not check actually ... -
Towards continuous software release planning
Ameller, David; Farré Tost, Carles; Franch Gutiérrez, Javier; Valerio, Danilo; Cassarino, Antonino (Institute of Electrical and Electronics Engineers (IEEE), 2017)
Text en actes de congrés
Accés obertContinuous software engineering is a new trend that is gaining increasing attention of the research community in the last years. The main idea behind this trend is to tighten the connection between the software engineering ... -
Validation of mappings between schemas
Rull, Guillem; Farré Tost, Carles; Teniente López, Ernest; Urpí Tubella, Antoni (2007-06)
Report de recerca
Accés obertMappings between schemas are key elements in several contexts such as data exchange, data integration, peer data management systems, etc. In all these contexts, the process of designing a mapping requires the participation ... -
Validation of schema mappings with nested queries
Rull Fort, Guillem; Farré Tost, Carles; Teniente López, Ernest; Urpí Tubella, Antoni (2012-10-11)
Report de recerca
Accés obertWith the emergence of the Web and the wide use of XML for representing data, the ability to map not only flat relational but also nested data has become crucial. The design of schema mappings is a semi-automatic process. ...