World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
88
Citations
26812
World Ranking
691
National Ranking
367

Research.com Recognitions

  • 2008 - ACM Software System Award For Gamma, the first embodiment of a parallel, "shared nothing" database system running on a cluster of commodity computers, using data partitioning and innovative parallel query execution strategies.
  • 2002 - ACM Fellow For contributions to database system research and practice.

Overview

Jeffrey F. Naughton is affiliated with Celonis in the United States. Their research predominantly spans the field of Computer Science, with a focus on several subfields including Computer Networks and Communications, Signal Processing, Information Systems, Artificial Intelligence, and Computer Vision and Pattern Recognition.

The core topics of their work include Advanced Database Systems and Queries, Data Management and Algorithms, Cloud Computing and Resource Management, Distributed Systems and Fault Tolerance, Data Stream Mining Techniques, Caching and Content Delivery, and Graph Theory and Algorithms.

Their recent publications demonstrate an emphasis on efficient data processing and workload management. Notable papers include:

  • "Efficient Sorting, Duplicate Removal, Grouping, and Aggregation" (2022) published in ACM Transactions on Database Systems
  • "Comprehensive and Efficient Workload Summarization" (2022) published in Datenbank-Spektrum
  • "Comprehensive and efficient workload compression" (2020) published in Proceedings of the VLDB Endowment
  • "Locality-Aware Distribution Schemes" (2021) published in Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • "Providing Insights for Queries affected by Failures and Stragglers" (2020) published in arXiv (Cornell University)

Frequent co-authors include Shaleen Deep, Paraschos Koutris, Stratis D. Viglas, Bruhathi Sundarmurthy, and Thanh Do. These collaborations reflect ongoing partnerships contributing to their research output.

The main venues publishing their work consist of arXiv (Cornell University), ACM Transactions on Database Systems, Datenbank-Spektrum, Proceedings of the VLDB Endowment, and Leibniz-Zentrum für Informatik (Schloss Dagstuhl).

Among honors, Jeffrey F. Naughton has received the ACM Software System Award in 2008 for their work on Gamma, a parallel "shared nothing" database system utilizing data partitioning and parallel query execution strategies. Additionally, they were named an ACM Fellow in 2002 for contributions to database system research and practice.

Best Publications

  • Relational Databases for Querying XML Documents: Limitations and Opportunities

    Jayavel Shanmugasundaram;Kristin Tufte;Chun Zhang;Gang He

  • On supporting containment queries in relational database management systems

    Chun Zhang;Jeffrey Naughton;David DeWitt;Qiong Luo

  • On the Computation of Multidimensional Aggregates

    Sameet Agarwal;Rakesh Agrawal;Prasad Deshpande;Ashish Gupta

  • The 007 Benchmark

    Michael J. Carey;David J. DeWitt;Jeffrey F. Naughton

  • Generalized Search Trees for Database Systems

    Joseph M. Hellerstein;Jeffrey F. Naughton;Avi Pfeffer

  • Shoring up persistent applications

    Michael J. Carey;David J. DeWitt;Michael J. Franklin;Nancy E. Hall

  • An array-based algorithm for simultaneous multidimensional aggregates

    Yihong Zhao;Prasad M. Deshpande;Jeffrey F. Naughton

  • Evaluating window joins over unbounded streams

    J. Kang;J.F. Naughton;S.D. Viglas

  • Covering indexes for branching path queries

    Raghav Kaushik;Philip Bohannon;Jeffrey F Naughton;Henry F Korth

  • Materialized View Selection for Multidimensional Datasets

    Amit Shukla;Prasad Deshpande;Jeffrey F. Naughton

  • Practical selectivity estimation through adaptive sampling

    Richard J. Lipton;Jeffrey F. Naughton;Donovan A. Schneider

  • Practical Skew Handling in Parallel Joins

    David J. DeWitt;Jeffrey F. Naughton;Donovan A. Schneider;S. Seshadri

  • Sampling-Based Estimation of the Number of Distinct Values of an Attribute

    Peter J. Haas;Jeffrey F. Naughton;S. Seshadri;Lynne Stokes

  • The oo7 Benchmark.

    Michael J. Carey;David J. DeWitt;Jeffrey F. Naughton

  • Rate-based query optimization for streaming information sources

    Stratis D. Viglas;Jeffrey F. Naughton

  • Maximizing the output rate of multi-way join queries over streaming information sources

    Stratis D. Viglas;Jeffrey F. Naughton;Josef Burger

  • The Asilomar report on database research

    Phil Bernstein;Michael Brodie;Stefano Ceri;David DeWitt

  • On schema matching with opaque column names and data values

    Jaewoo Kang;Jeffrey F. Naughton

  • Estimating the Selectivity of XML Path Expressions for Internet Scale Applications

    Ashraf Aboulnaga;Alaa R. Alameldeen;Jeffrey F. Naughton

  • Caching multidimensional queries using chunks

    Prasad M. Deshpande;Karthikeyan Ramasamy;Amit Shukla;Jeffrey F. Naughton

  • On the computation of multidimensional aggregates

    Sameet Agarwal;Rakesh Agarwal;Prasad M. Deshpande;Ashish Gupta

  • Computation of Multidimensional Aggregates

    Prasad M Deshpande;Sameet Agarwal;Jeffrey F Naughton;Raghu Ramakrishnan

Frequent Co-Authors

David J. DeWitt
David J. DeWitt University of Wisconsin–Madison
AnHai Doan
AnHai Doan University of Wisconsin–Madison
Raghu Ramakrishnan
Raghu Ramakrishnan Microsoft (United States)
Jignesh M. Patel
Jignesh M. Patel Carnegie Mellon University
Michael J. Carey
Michael J. Carey University of California, Irvine
Joseph M. Hellerstein
Joseph M. Hellerstein University of California, Berkeley
Jeffrey D. Ullman
Jeffrey D. Ullman Stanford University
Michael J. Franklin
Michael J. Franklin University of Chicago
Jayavel Shanmugasundaram
Jayavel Shanmugasundaram Yahoo (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

Exploring alternative online degree options in the USA can broaden your career opportunities in the technology field and beyond. Many students begin their journey with associates degrees online, allowing them to quickly gain foundational knowledge and credits that can later be transferred towards a bachelor’s degree.

If you are interested in expanding your expertise beyond computing, online business degree programs offer the flexibility to develop in-demand skills such as management, marketing, and entrepreneurship. These skills can complement technical knowledge and help you stand out in the job market.

Budget is often a concern for prospective students. Fortunately, there are cheap online universities that offer respected programs without the high tuition costs of traditional institutions. If you’re focused more on technical fields, pursuing an cheapest engineering degree online can set you up for specialized roles in engineering or applied technology industries.

By researching a variety of online degree pathways, you can find a program that fits your needs, budget, and long-term goals.

Best Scientists Citing Jeffrey F. Naughton

Trending Scientists