activity
20022016
most citedOn the Computational Complexity of Consistent Query Answers

20 citations · 46 across the 13 of their papers we have counts for

collaborators
Showing cs.DBShow all

13 papers · 1 filter

cs.DB2016

Temporal Data Exchange

Ladan Golshanara, Jan Chomicki

Data exchange is the problem of transforming data that is structured under a source schema into data structured under another schema, called the target schema, so that both the sou…

cs.DB2009★ 1 cited

Prioritized Repairing and Consistent Query Answering in Relational Databases

Slawomir Staworko, Jan Chomicki, Jerzy Marcinkowski

A consistent query answer in an inconsistent database is an answer obtained in every (minimal) repair. The repairs are obtained by resolving all conflicts in all possible ways. Oft…

cs.DB2008

Semantics and Evaluation of Top-k Queries in Probabilistic Databases

Xi Zhang, Jan Chomicki

We study here fundamental issues involved in top-k query evaluation in probabilistic databases. We consider simple probabilistic databases in which probabilities are associated wit…

cs.DB2008★ 2 cited

Consistent Query Answers in the Presence of Universal Constraints

Slawomir Staworko, Jan Chomicki

The framework of consistent query answers and repairs has been introduced to alleviate the impact of inconsistent data on the answers to a query. A repair is a minimally different…

cs.DB2006

Database Querying under Changing Preferences

Jan Chomicki

We present here a formal foundation for an iterative and incremental approach to constructing and evaluating preference queries. Our main focus is on query modification: a query tr…

cs.DB2005

Semantic Optimization Techniques for Preference Queries

Jan Chomicki

Preference queries are relational algebra or SQL queries that contain occurrences of the winnow operator ("find the most preferred tuples in a given relation"). Such queries are pa…