Journals
-
Prioritized Repairing and Consistent Query Answering in Relational Databases,
To appear in the special SUM'08 issue of Annals of
Mathematics and Artificial Intelligence,
(with J. Chomicki and J. Marcinkowski)
[bibtex]
-
Consistent Query Answers in the Presence of Universal Constraints,
Information Systems, Volume 35(1), 2010, pp. 1-22
(with J. Chomicki)
[bibtex]
Conferences and Workshops
-
Deterministic Regular Expressions in Linear Time,
ACM Symposium on Principles of Database Systems (PODS)
May 2012, Scottsdale, Arizona, USA (with B. Groz and S. Maneth)
[bibtex]
-
Learning Twig and Path Queries,
International Conference on Database Theory (ICDT),
March 2012, Berlin, Germany
(with P. Wieczorek)
[slides,
bibtex]
-
Bounded Reparability for Regular Tree Languages,
International Conference on Database Theory (ICDT),
March 2012, Berlin, Germany
(with G. Puppis and C. Riveros)
[bibtex]
-
Normalization of Sequential Top-Down Tree-to-Word Transducers,
Language and Automata Theory and Applications (LATA),
March 2011, Tarragona, Spain
(with G. Laurence, A. Lemay, J. Niechren, and M. Tommasi)
[bibtex]
-
View Update Translation for XML,
International Conference on Database Theory (ICDT),
March 2011, Uppsala, Sweden
(with I. Boneva, B. Groz, A.-C. Caron, Y. Roos, and S. Tison)
[bibtex]
-
The View Update Problem for XML,
EDBT/ICDT Workshops (Updates in XML),
March 2010, Lausanne, Switzerland
(with I. Boneva, B. Groz)
[bibtex]
-
XML Security Views Revisited,
Database Programming Languages (DBPL),
August 2009, Lyon, France
(with B. Groz, A.-C. Caron, Y. Roos, and S. Tison)
[slides,
bibtex]
-
Equivalence of Deterministic Nested Word to Word Transducers,
Fundamentals of Computation Theory (FCT),
September 2009, Wroclaw, Poland
(with G. Laurence, A. Lemay, and J. Niechren)
[slides,
bibtex]
-
Querying Regular Sets of XML Documents,
LiD Workshop, May 2008, Rome.
(with E. Filiot and J. Chomicki)
[bibtex]
-
Validity Sensitive Querying of XML Databases,
EDBT Workshops (dataX), March 2006, Munich, Germany.
(with J. Chomicki)
[slides,
bibtex]
-
Preference-Driven Querying of Inconsistent Relational Databases,
EDBT Workshops (IIDB),
March 2006, Munich, Germany.
(with J. Chomicki and J. Marcinkowski)
[slides,
bibtex]
-
Computing Consistent Query Answers using Conflict Hypergraphs,
Information and Knowledge Management (CIKM),
November 2004, Washington, D.C.
(with J. Chomicki and J. Marcinkowski)
[bibtex]
-
Hippo: a System for Computing
Consistent Query Answers to a Class of SQL Queries,
International Conference on Extending Database Technology (EDBT),
March 2004, Heraklion, Greece.
System demo.
(with J. Chomicki and J. Marcinkowski)
[bibtex]
Manuscripts
-
Priority-Based Conflict Resolution in Inconsistent Relational Databases,
arXiv.org e-Print archive, cs/0506063, June 2005 (with J. Chomicki)
[bibtex]
-
Declarative Inconsistency Handling in Relational and Semi-structured Databases,
Ph.D. thesis dissertation,
University at Buffalo, May 2007.
[slides,
bibtex]
Talks
-
Consistent Query Answering,
Advanced School on Data Exchange, Integration, and Streams (DEIS),
GI-Dagstuhl Seminar, November 2010.
-
Rewriting of Queries and Updates across XML Security Views,
Dagstuhl Seminar: Security and Rewriting,
August 2011.
Copyright Notice
This material is presented to ensure timely dissemination of
scholarly and technical work. Copyrights and all rights
therein are retained by authors or by other copyright
holders. All persons copying this material are expected to
adhere to the terms and constraints invoked by each author's
copyright. In most cases, these works cannot be reposted or
commercially distributed without the explicit permission of
the copyright holder.
ACM Copyright Notice
Copyright © 199x by the Association for Computing Machinery,
Inc. Permission to make digital or hard copies of part or all
of this work for personal or classroom use is granted without
fee provided that copies are not made or distributed for
profit or commercial advantage and that new copies bear this
notice and the full citation on the first page. Copyrights for
components of this work owned by others than ACM must be
honored. Abstracting with credit is permitted.