Many problems require working with data that varies in its structure and content. Current
approaches, such as schema evolution or data integration tools, are highly tailored to …

Incremental satisfiability (SAT) solving is an extension of classic SAT solving that allows
users to efficiently solve a set of related SAT problems by identifying and exploiting shared …

Variation occurs in databases in many different forms and contexts. For example, a single
database schema evolves over time, data from different sources may be combined, and the …

Incremental satisfiability (SAT) solving is an extension of classic SAT solving that enables
solving a set of related SAT problems by identifying and exploiting shared terms. However …

Variability inherently exists in databases in various contexts which creates database
variants. For example, variants of a database could have different schemas/content …

Variation in data is abundant and ubiquitous in real-world applications. Managing variation
in databases is, however, difficult and has been extensively studied by the database …

In this thesis, I present the variational database management system, a formal framework
and its implementation for representing variation in relational databases and managing …

Incremental satisfiability (SAT) solving is an extension of classic SAT solving that enables
solving a set of related SAT problems by identifying and exploiting shared terms. However …

As a general solution to the problem of managing structural and content variability in
relational databases, in previous work we have introduced the Variational Database …

Variation is a commonly encountered element of modern software systems. Recent research
into variation has led to increasing interest in the development of variational programming …