Fang Wei-Kleiner (aka. Fang Wei)

ADIT
Department of Computer Science (IDA)
University of Linköping
S-581 83 Linköping, Sweden
Office: +46 (13) 28-4604

Email: fang.wei-kleiner@liu.se

Bio

Fang Wei is a researcher of ADIT group, University of Linköping since September 2011. Before that, she was with DBIS group, University of Freiburg (2008-2011), and DBAI group of Vienna University of Technology (2005-2007). She received her Ph.D from University of Freiburg and M.Sc from Dresden University of Technology.

Project

TEDI

Publications

Georg Gottlob, Reinhard Pichler, Fang Wei:
Tractable database design and datalog abduction through bounded treewidth.
Inf. Syst. 35(3): 278-298 (2010)
Fang Wei:
Efficient Graph Reachability Query Answering Using Tree Decomposition [ .pdf ]
In Reachability Problems, 4th International Workshop, (RP 2010), Brno, Czech Republic, August, 2010
Fang Wei:
TEDI: Efficient Shortest Path Query Answering on Graphs [ .pdf ]
In Proceedings of the ACM SIGMOD International Conference on Management of Data, (SIGMOD 2010), June 2010, Indiana (USA).
Michael Meier, Michael Schmidt, Fang Wei, Georg Lausen:
Semantic Query Optimization in the Presence of Types [ .pdf ]
In Proc. of Symposium on Principle of Database Systems (PODS), June 2010, Indiana (USA).
Georg Gottlob, Reinhard Pichler, Fang Wei:
Bounded treewidth as a key to tractability of knowledge representation and reasoning
Artificial Intelligence, 174(1), 105-132, 2010.
Hannes Eder, Fang Wei:
Evaluation of skyline algorithms in PostgreSQL
International Database Engineering and Applications Symposium (IDEAS 2009), September 2009, Cetraro, Calabria, (Italy).
A Unified Apriori-like Algorithm for Conjunctive Query Containment, Fang Wei, Georg Lausen; IDEAS 2008
Abduction with Bounded Treewidth: From Theoretical Tractability to Practically Efficient Computation, Georg Gottlob, Reinhard Pichler, Fang Wei; AAAI 2008
dRDF: Entailment for Domain-Restricted RDF, Reinhard Pichler, Axel Polleres, Fang Wei, Stefan Woltran; ESWC 2008: 200-214
Foundations of Rule-Based Query Answering, Francois Bry, Norbert Eisinger, Thomas Eiter, Tim Furche, Georg Gottlob, Clemens Ley, Benedikt Linse, Reinhard Pichler, Fang Wei; Reasoning Web 2007
Efficient Datalog Abduction through Bounded Treewidth, Georg Gottlob, Reinhard Pichler, Fang Wei; 22st National Conference on Artificial Intelligence (AAAI-07)
Monadic Datalog over Finite Structures with Bounded Treewidth, Georg Gottlob, Reinhard Pichler, Fang Wei; 26th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS '07)
Bounded Treewidth as a Key to Tractability of Knowledge Representation and Reasoning, Georg Gottlob, Reinhard Pichler, Fang Wei; 21st National Conference on Artificial Intelligence (AAAI-06)
Tractable Database Design through Bounded Treewidth, Georg Gottlob, Reinhard Pichler, Fang Wei; 25th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS '06)
On Containment of Conjunctive Queries, Georg Lausen, Fang Wei; Computer Science in Perspective 2003, 231-244.
Containment of Conjunctive Queries with Safe Negation , Fang Wei, Georg Lausen, 9th International Conference on Database Theory (ICDT'03).
Conjunctive Query Containment in the Presence of Disjunctive Integrity Constraints, Fang Wei, Georg Lausen, 9th International Workshop on Knowledge Representation meets Databases (KRDB'02), April 21, 2002, Toulouse France.
A Formal Analysis of the Lightweight Directory Acces s Protocol, Fang Wei, Georg Lausen; International Workshop on Data Semantics in Web Information Systems (DASWIS'01), November 27-30, 2001, Yokohama, Japan.