Feed Rss

ICDT 2017 – 1st Round Accepted Papers

08.25.2016, Comments Off on ICDT 2017 – 1st Round Accepted Papers, Conferences, by .

The series of ICDT conferences ( provides an international forum for the communication of research advances on the theoretical foundations of database systems.

The 20th edition of ICDT will take place in Venice, Italy between the 21st and the 24th of March 2017 (
ICDT has now two submission cycles with the next one closing on Sep. 11th, 2016 (abstract) and Sep. 18th, 2016 (full papers).

The first round of reviews has now been completed and the list of accepted research papers is:

Pablo Barcelò and Miguel Romero.
The Complexity of Reverse Engineering Problems for Conjunctive Queries.

Shaleen Deep and Paraschos Koutris.
The Design of Arbitrage-Free Data Pricing Schemes.

Dominik D. Freydenberger.
A Logic for Document Spanners.

Tomasz Gogacz and Szymon Toruńczyk.
Entropy bounds for conjunctive queries with functional dependencies.

Benny Kimelfeld, Ester Livshits, and Liat Peterfreund
Detecting Ambiguity in Prioritized Database Repairing.

These are very good papers!

DEOS 2014

04.23.2014, Comments Off on DEOS 2014, Conferences, by .

I am pleased to announce that the slides of all talks held at the 4th International Workshop on Data Extraction and Object Search (DEOS) in Seoul (Korea) are now available for download.

Also this year the workshop has been a success with two great keynote speakers: Xin Luna Dong from Google presenting her work on SONYA, and Kevin Chang from the University of Illinois at Urbana-Champaign and co-founder of Cazoodle on his experience as an academic and entrepreneur.

We also had a great industrial talk given by Dmitry Ushanov from Yandex about named entity disambiguation and its applications to search.

We had good research papers too! See the full program of DEOS.

NoCoDA 2013

04.25.2013, Comments Off on NoCoDA 2013, Conferences, by .


It’s with pleasure that I announce that the 2013 edition of the International Workshop on Non-Conventional Data Access (NoCoDA’13) has been accepted at the 22nd International Conference on Information and Knowledge Management (CIKM’13) in San Francisco (California – USA).

The Workshop Chairs are the usual suspects: Letizia Tanca, Riccardo Torlone, and myself.

The workshop website is already up at: and the topics of interest include:

  • Context-aware data access
  • Preference queries
  • Personalized data access
  • Schema-agnostic data access
  • Keyword-search over databases
  • Provenance-aware data access
  • Ontology-based data access
  • Database summarization
  • Query relaxation
  • Approximate query-answering
  • Probabilistic querying
  • Privacy-preserving data access
  • Push-based data delivery
  • Query annotation
  • Question answering
  • Natural language querying
  • Mobile and pervasive data access
  • Query mediators
Also this year the Programme Committee consists of top researchers in the above fields:

Heuristic Ranking in Tightly Coupled Probabilistic Description Logics

12.21.2012, Comments Off on Heuristic Ranking in Tightly Coupled Probabilistic Description Logics, Conferences, by .

The Semantic Web effort has steadily been gaining traction in the recent years. In particular,Web search companies are recently realizing that their products need to evolve towards having richer semantic search capabilities. Description logics (DLs) have been adopted as the formal underpinnings for Semantic Web languages used in describing ontologies. Reasoning under uncertainty has recently taken a leading role in this arena, given the nature of data found on the Web. In this paper, we present a probabilistic extension of the DL EL++ (which underlies the OWL2 EL profile) using Markov logic networks (MLNs) as probabilistic semantics. This extension is tightly coupled, meaning that probabilistic annotations in formulas can refer to objects in the ontology. We show that, even though the tightly coupled nature of our language means that many basic operations are data-intractable, we can leverage a sublanguage of MLNs that allows to rank the atomic consequences of an ontology relative to their probability values (called ranking queries) even when these values are not fully computed. We present an anytime algorithm to answer ranking queries, and provide an upper bound on the error that it incurs, as well as a criterion to decide when results are guaranteed to be correct.


Reasoning Web 2012 – Lecture

12.18.2012, Comments Off on Reasoning Web 2012 – Lecture, Lectures, by .

Talk about Datalog and its extensions for the Semantic Web at the 8th Reasoning Web Summer School held in Wien.

NoCoDA 2012 – Accepted Papers

06.06.2012, Comments Off on NoCoDA 2012 – Accepted Papers, Uncategorized, by .

The list of accepted papers for NoCoDA 2012 is now available. Congratulations to the authors!

In addition, due to the similarity of topics, we decided to merge NoCoDA with the 6th International Workshop on Evolution and Change in Data Management (ECDM).

Nyaya: a System Supporting the Uniform Management of Large Sets of Semantic Data

06.06.2012, Comments Off on Nyaya: a System Supporting the Uniform Management of Large Sets of Semantic Data, Uncategorized, by .

Video of the Nyaya Demonstration at ICDE 2012.

Querying UML Class Diagrams

06.06.2012, Comments Off on Querying UML Class Diagrams, Uncategorized, by .

Presentation of the Keynote Talk from Georg at FoSSaCS 2012.

OPAL: A Passe-Partout for Web Forms

06.06.2012, Comments Off on OPAL: A Passe-Partout for Web Forms, Uncategorized, by .

This presentation showcases the OPAL tool for automatic web form understanding and filling. This demo paper was presented at WWW 2012.

OPAL was also accepted as full paper, and here are the slides of the talk.


06.06.2012, Comments Off on DIADEM, Uncategorized, by .

Presentation of DIADEM at WWW 2012. EU Projects Track.