Search Results for author: Mostafa Milani

Found 6 papers, 0 papers with code

Extending Sticky-Datalog+/- via Finite-Position Selection Functions: Tractability, Algorithms, and Optimization

no code implementations2 Aug 2021 Leopoldo Bertossi, Mostafa Milani

We propose a bottom-up QA algorithm for programs in the class sch(S), for a general selection function S. As a particular case, we obtain a polynomial-time QA algorithm for JWS and weakly-sticky programs.

Ontological Multidimensional Data Models and Contextual Data Qality

no code implementations1 Apr 2017 Leopoldo Bertossi, Mostafa Milani

Data quality assessment and data cleaning are context-dependent activities.

The Ontological Multidimensional Data Model

no code implementations10 Mar 2017 Leopoldo Bertossi, Mostafa Milani

In this extended abstract we describe, mainly by examples, the main elements of the Ontological Multidimensional Data Model, which considerably extends a relational reconstruction of the multidimensional data model proposed by Hurtado and Mendelzon by means of tuple-generating dependencies, equality-generating dependencies, and negative constraints as found in Datalog+-.

Extending Weakly-Sticky Datalog+/-: Query-Answering Tractability and Optimizations

no code implementations10 Jul 2016 Mostafa Milani, Leopoldo Bertossi

We apply the magic-sets rewriting in combination with the proposed QA algorithm for the optimization of QA over JWS programs.

A Hybrid Approach to Query Answering under Expressive Datalog+/-

no code implementations22 Apr 2016 Mostafa Milani, Andrea Cali, Leopoldo Bertossi

Datalog+/- is a family of ontology languages that combine good computational properties with high expressive power.

Tractable Query Answering and Optimization for Extensions of Weakly-Sticky Datalog+-

no code implementations13 Apr 2015 Mostafa Milani, Leopoldo Bertossi

We consider a semantic class, weakly-chase-sticky (WChS), and a syntactic subclass, jointly-weakly-sticky (JWS), of Datalog+- programs.

Cannot find the paper you are looking for? You can Submit a new open access paper.