Fang Wei-Kleiner

Proceedings of the ISWC 2019 Satellite Tracks (Posters & Demonstrations, 2019

2016

Tree decomposition-based indexing for efficient shortest path and nearest neighbors query answering on graphs.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2016

2015

Completing the is-a structure in light-weight ontologies.

[BibT_eX]

[DOI]

J. Biomed. Semant., 2015

2014

A System for Debugging Missing Is-a Structure in EL Ontologies.

[BibT_eX]

[DOI]

Proceedings of the Third International Workshop on Debugging Ontologies and Ontology Mappings, 2014

Completing the is-a Structure of Biomedical Ontologies.

[BibT_eX]

[DOI]

Proceedings of the Data Integration in the Life Sciences - 10th International Conference, 2014

Abduction Framework for Repairing Incomplete EL Ontologies: Complexity Results and Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013

Semantic query optimization in the presence of types.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2013

Tree Decomposition based Steiner Tree Computation over Large Graphs

[BibT_eX]

[DOI]

CoRR, 2013

Repairing missing is-a structure in ontologies is an abductive reasoning problem.

[BibT_eX]

[DOI]

Proceedings of the Second International Workshop on Debugging Ontologies and Ontology Mappings, 2013

Finding nearest neighbors in road networks: a tree decomposition method.

[BibT_eX]

[DOI]

Proceedings of the Joint 2013 EDBT/ICDT Conferences, 2013

2011

TEDI: Efficient Shortest Path Query Answering on Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Data Management: Techniques and Applications., 2011

2010

Monadic datalog over finite structures of bounded treewidth.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2010

Tractable database design and datalog abduction through bounded treewidth.

[BibT_eX]

[DOI]

Inf. Syst., 2010

Bounded treewidth as a key to tractability of knowledge representation and reasoning.

[BibT_eX]

[DOI]

Artif. Intell., 2010

TEDI: efficient shortest path query answering on graphs.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGMOD International Conference on Management of Data, 2010

Efficient Graph Reachability Query Answering Using Tree Decomposition.

[BibT_eX]

[DOI]

Proceedings of the Reachability Problems, 4th International Workshop, 2010

2009

Evaluation of skyline algorithms in PostgreSQL.

[BibT_eX]

[DOI]

Hannes Eder

Proceedings of the International Database Engineering and Applications Symposium (IDEAS 2009), 2009

2008

A unified apriori-like algorithm for conjunctive query containment.

[BibT_eX]

[DOI]

Proceedings of the 12th International Database Engineering and Applications Symposium (IDEAS 2008), 2008

dRDF: Entailment for Domain-Restricted RDF.

[BibT_eX]

[DOI]

Proceedings of the Semantic Web: Research and Applications, 2008

Abduction with Bounded Treewidth: From Theoretical Tractability to Practically Efficient Computation.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

2007

Foundations of Rule-Based Query Answering.

[BibT_eX]

[DOI]

Proceedings of the Reasoning Web, 2007

Efficient Datalog Abduction through Bounded Treewidth.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006

Tractable database design through bounded treewidth.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2006

2005

Query equivalence and containment on relational and tree databases.

[BibT_eX]

[DOI]

PhD thesis, 2005

2003

Containment of Conjunctive Queries with Safe Negation.

[BibT_eX]

[DOI]

Proceedings of the Database Theory, 2003

On the Containment of Conjunctive Queries.

[BibT_eX]

[DOI]

Proceedings of the Computer Science in Perspective, Essays Dedicated to Thomas Ottmann, 2003

2002

Conjunctive Query Containment in the Presence of Disjunctive Integrity Constraints.

[BibT_eX]

[DOI]

Proceedings of the 9th International Workshop on Knowledge Representation meets Databases (KRDB 2002), 2002

2001

A Formal Analysis of the Lightweight Directory Access Protocol.

[BibT_eX]

[DOI]