2023 - Research.com Computer Science in United Kingdom Leader Award
2018 - Fellow of the Royal Society, United Kingdom
2017 - Member of Academia Europaea
2012 - ACM Fellow For contributions to Web data management
2011 - Fellow of the Royal Society of Edinburgh
Wenfei Fan mainly investigates Theoretical computer science, Data integrity, XML, Data mining and Information retrieval. Wenfei Fan has researched Theoretical computer science in several fields, including Subgraph isomorphism problem, Line graph, Graph and Factor-critical graph. His work carried out in the field of Data integrity brings together such families of science as Set and Heuristic.
His study connects Algorithm and XML. His Data mining research is multidisciplinary, incorporating elements of Decidability, Semantics, Data quality and Path. His work in XML validation addresses subjects such as XML database, which are connected to disciplines such as Efficient XML Interchange.
His scientific interests lie mostly in Theoretical computer science, XML, Information retrieval, XML validation and Graph. Wenfei Fan interconnects Functional dependency, Bounded function and Set in the investigation of issues within Theoretical computer science. His XML research is multidisciplinary, incorporating perspectives in Programming language, Relational database and Data integrity.
His work deals with themes such as XML framework and XML Signature, Document Structure Description, which intersect with XML validation. His research integrates issues of Streaming XML, Efficient XML Interchange, XML database and XML Schema Editor in his study of Document Structure Description. His studies deal with areas such as Graph, Scalability, Computation and Pattern matching as well as Graph.
His main research concerns Graph, Theoretical computer science, Computation, Scalability and Satisfiability. His Graph partition study in the realm of Graph interacts with subjects such as Curiosity. His Theoretical computer science research includes elements of Functional dependency and Bounded function.
His Functional dependency research incorporates themes from Graph, Undecidable problem and Expressive power. The Computation study combines topics in areas such as Upper and lower bounds, Approximation algorithm, Graph algorithms and Parallel computing. The study incorporates disciplines such as Parallel algorithm, SQL, Set and Topology in addition to Scalability.
Wenfei Fan mostly deals with Graph, Theoretical computer science, Functional dependency, Satisfiability and Synthetic data. His Graph research is multidisciplinary, relying on both Graph, Partition, Partition and Computation. His research on Theoretical computer science often connects related areas such as Extension.
The concepts of his Functional dependency study are interwoven with issues in Time complexity, Representation, Enhanced Data Rates for GSM Evolution, Consistency and Matching. He has included themes like Conditional functional dependencies, Chase, Undecidable problem and Expressive power in his Satisfiability study. As a part of the same scientific study, Wenfei Fan usually deals with the Synthetic data, concentrating on Scalability and frequently concerns with Process, Identification and Object.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Keys with Upward Wildcards for XML
Wenfei Fan;Peter Schwenzer;Kun Wu.
database and expert systems applications (2001)
Keys for XML
Peter Buneman;Susan B. Davidson;Wenfei Fan;Carmem S. Hara.
Computer Networks (2002)
A cost-based model and effective heuristic for repairing constraints by value modification
Philip Bohannon;Wenfei Fan;Michael Flaster;Rajeev Rastogi.
international conference on management of data (2005)
Conditional Functional Dependencies for Data Cleaning
P. Bohannon;Wenfei Fan;F. Geerts;Xibei Jia.
international conference on data engineering (2007)
Improving data quality: consistency and accuracy
Gao Cong;Wenfei Fan;Floris Geerts;Xibei Jia.
very large data bases (2007)
Conditional functional dependencies for capturing data inconsistencies
Wenfei Fan;Floris Geerts;Xibei Jia;Anastasios Kementsietsidis.
ACM Transactions on Database Systems (2008)
On XML integrity constraints in the presence of DTDs
Wenfei Fan;Leonid Libkin.
Journal of the ACM (2002)
Discovering Conditional Functional Dependencies
Wenfei Fan;F Geerts;Jianzhong Li;Ming Xiong.
IEEE Transactions on Knowledge and Data Engineering (2011)
Secure XML querying with security views
Wenfei Fan;Chee-Yong Chan;Minos Garofalakis.
international conference on management of data (2004)
Graph pattern matching: from intractable to polynomial time
Wenfei Fan;Jianzhong Li;Shuai Ma;Nan Tang.
very large data bases (2010)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
University of Antwerp
Beihang University
University of Edinburgh
Harbin Institute of Technology
Qatar Computing Research Institute
University of Pennsylvania
University of Edinburgh
Nanyang Technological University
Amazon (United States)
Google (United States)
University of South Australia
TU Wien
University of Tennessee at Knoxville
University of Memphis
Curtin University
Indian Institute of Technology Hyderabad
McMaster University
University College Dublin
Norwegian University of Life Sciences
Smithsonian Conservation Biology Institute
University of Oxford
Arizona State University
Oregon Health & Science University
Tufts University
Harvard University
Harvard University