World's Best Scientists 2026 revealed!
Award Badge
Computer Science
UK
2025

D-Index & Metrics

Computer Science

D-Index
70
Citations
17134
World Ranking
1894
National Ranking
109

Research.com Recognitions

  • 2025 - Research.com Computer Science in United Kingdom Leader Award
  • 2023 - Research.com Computer Science in United Kingdom Leader Award
  • 2022 - 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

Overview

Wenfei Fan is affiliated with the University of Edinburgh in the United Kingdom. Their research contributions primarily lie within the field of Computer Science, with a particular focus on subfields such as Artificial Intelligence, Computer Vision and Pattern Recognition, Information Systems, Management Science and Operations Research, and Computational Theory and Mathematics.

Their work addresses multiple topics including:

  • Advanced Graph Neural Networks
  • Graph Theory and Algorithms
  • Data Quality and Management
  • Data Mining Algorithms and Applications
  • Data Management and Algorithms
  • Complexity and Algorithms in Graphs
  • Topic Modeling

Among Wenfei Fan's recent papers are:

  • "GraphScope", 2021, Proceedings of the VLDB Endowment
  • "Incrementalization of graph partitioning algorithms", 2020, Proceedings of the VLDB Endowment
  • "Capturing associations in graphs", 2020, Proceedings of the VLDB Endowment
  • "Discovering Graph Functional Dependencies", 2020, ACM Transactions on Database Systems
  • "Discovering association rules from big graphs", 2022, Proceedings of the VLDB Endowment

The primary venues for Wenfei Fan's publications include:

  • Proceedings of the VLDB Endowment
  • Proceedings of the ACM on Management of Data
  • ACM Transactions on Database Systems
  • Proceedings of the 2022 International Conference on Management of Data
  • Science China Information Sciences

Frequent collaborators in their research have been:

  • Ping Lü
  • Chao Tian
  • Yaoshu Wang
  • Qiang Yin
  • Ruochun Jin

Wenfei Fan has published a book titled Big Data in 2021 with Springer Science+Business Media.

The scientist has received several honors, including:

  • Fellow of the Royal Society, United Kingdom (2018)
  • Member of Academia Europaea (2017)
  • ACM Fellow (2012) for contributions to Web data management
  • Fellow of the Royal Society of Edinburgh (2011)

Best Publications

  • A cost-based model and effective heuristic for repairing constraints by value modification

    Philip Bohannon;Wenfei Fan;Michael Flaster;Rajeev Rastogi

  • Conditional functional dependencies for capturing data inconsistencies

    Wenfei Fan;Floris Geerts;Xibei Jia;Anastasios Kementsietsidis

  • Conditional Functional Dependencies for Data Cleaning

    P. Bohannon;Wenfei Fan;F. Geerts;Xibei Jia

  • Keys for XML

    Peter Buneman;Susan B. Davidson;Wenfei Fan;Carmem S. Hara

  • Improving data quality: consistency and accuracy

    Gao Cong;Wenfei Fan;Floris Geerts;Xibei Jia

  • Discovering Conditional Functional Dependencies

    Wenfei Fan;F Geerts;Jianzhong Li;Ming Xiong

  • Graph pattern matching: from intractable to polynomial time

    Wenfei Fan;Jianzhong Li;Shuai Ma;Nan Tang

  • On XML integrity constraints in the presence of DTDs

    Wenfei Fan;Leonid Libkin

  • Foundations of Data Quality Management

    Wenfei Fan;Floris Geerts

  • Secure XML querying with security views

    Wenfei Fan;Chee-Yong Chan;Minos Garofalakis

  • XPath satisfiability in the presence of DTDs

    Michael Benedikt;Wenfei Fan;Floris Geerts

  • Keys for XML

    Peter Buneman;Susan Davidson;Wenfei Fan;Carmem Hara

  • Integrity constraints for XML

    Wenfei Fan;Jérôme Siméon

  • Reasoning about keys for XML

    Peter Buneman;Susan Davidson;Wenfei Fan;Carmem Hara

  • Dependencies revisited for improving data quality

    Wenfei Fan

  • Reasoning about Keys for XML

    Peter Buneman;Susan B. Davidson;Wenfei Fan;Carmem S. Hara

  • Towards certain fixes with editing rules and master data

    Wenfei Fan;Jianzhong Li;Shuai Ma;Nan Tang

  • Incremental graph pattern matching

    Wenfei Fan;Xin Wang;Yinghui Wu

  • Reasoning about record matching rules

    Wenfei Fan;Xibei Jia;Jianzhong Li;Shuai Ma

  • Query preserving graph compression

    Wenfei Fan;Jianzhong Li;Xin Wang;Yinghui Wu

  • Structural properties of XPath fragments

    Michael Benedikt;Wenfei Fan;Gabriel Kuper

  • Keys with Upward Wildcards for XML

    Wenfei Fan;Peter Schwenzer;Kun Wu

Frequent Co-Authors

Floris Geerts
Floris Geerts University of Antwerp
Shuai Ma
Shuai Ma Beihang University
Peter Buneman
Peter Buneman University of Edinburgh
Jianzhong Li
Jianzhong Li Harbin Institute of Technology
Nan Tang
Nan Tang Hong Kong University of Science and Technology (Guangzhou)
Susan B. Davidson
Susan B. Davidson University of Pennsylvania
Gao Cong
Gao Cong Nanyang Technological University
Leonid Libkin
Leonid Libkin University of Edinburgh
Rajeev Rastogi
Rajeev Rastogi Amazon (United States)
Anastasios Kementsietsidis
Anastasios Kementsietsidis Google (United States)

If you think any of the details on this page are incorrect, let us know.

Report an issue

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:

Related Online Degrees & Career Pathways

As the demand for tech professionals grows, students are exploring new ways to study Computer Science in the USA. Flexible learning options make it possible to earn degrees online and fast-track your career.

For those looking to enter the job market quickly, pursuing the fastest masters degree online can help you gain advanced skills in less time. These programs are designed for motivated learners seeking to accelerate their education.

If you want credentials that will pay off, consider the most useful graduate degrees. A master's in Computer Science is among the most valuable, opening doors to top roles in tech companies and beyond.

Not ready for a bachelor's or master's program? An associate degree online offers a fast, affordable route to entry-level IT positions. This is a great option for those needing a flexible start.

Finally, finances are always important. The cheapest online colleges can make your education more accessible, helping you save money while reaching your goals.

Best Scientists Citing Wenfei Fan

Trending Scientists