P
Phokion G. Kolaitis
Researcher at University of California, Santa Cruz
Publications - 240
Citations - 10403
Phokion G. Kolaitis is an academic researcher from University of California, Santa Cruz. The author has contributed to research in topics: Data exchange & Conjunctive query. The author has an hindex of 52, co-authored 232 publications receiving 9956 citations. Previous affiliations of Phokion G. Kolaitis include Occidental College & University of Chicago.
Papers
More filters
Proceedings ArticleDOI
Schema mappings, data exchange, and metadata management
TL;DR: The main aim in this paper is to present an overview of recent advances in data exchange and metadata management, where the schema mappings are between relational schemas.
Proceedings ArticleDOI
Composing schema mappings: second-order dependencies to the rescue
TL;DR: It is shown that the composition of finite sets of source-to-target tgds is always definable by a second-order tgd, and that second-orders possess good properties for data exchange, and introduces a class of existential second- order formulas with function symbols, which are made a case that they are the "right" language for composing schema mappings.
Book
Finite Model Theory and Its Applications
Erich Grädel,Phokion G. Kolaitis,Leonid Libkin,Maarten Marx,Joel Spencer,Moshe Y. Vardi,Yde Venema,S. Weinstein +7 more
TL;DR: Themes in Finite Model Theory and Descriptive Complexity, Logic and Random Structures, Embedded Finite Models and Constraint Databases, and Local Variations on a Loose Theme.
Book ChapterDOI
Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics
TL;DR: This work shows that constraint satisfaction problems on inputs of treewidth less than k are definable using Datalog programs with at most k variables; this provides a new explanation for the tractability of these classes of problems.
Proceedings ArticleDOI
On the expressive power of datalog: tools and a case study
TL;DR: It is shown here that the two dichotomies are indeed proper in terms of expressibility in Datalog(≠), and the expressibility of fixed subgraph homeomorphism queries on directed graphs is classified.