World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

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

Jeffrey F. Naughton publication distribution in Computer Science in 2026

The chart shows the distribution of publications by all Research.com ranked scientists in the field of Computer Science in 2026. The highlighted bar marks where Jeffrey F. Naughton sits on this spectrum.

32–41 publications: 7 scientists 42–51 publications: 22 scientists 52–61 publications: 82 scientists 62–71 publications: 134 scientists 72–81 publications: 249 scientists 82–91 publications: 324 scientists 92–101 publications: 421 scientists 102–111 publications: 420 scientists 112–121 publications: 497 scientists 122–131 publications: 544 scientists 132–141 publications: 555 scientists 142–151 publications: 609 scientists 152–161 publications: 559 scientists 162–171 publications: 534 scientists 172–181 publications: 556 scientists 182–191 publications: 583 scientists 192–201 publications: 519 scientists 202–211 publications: 508 scientists 212–221 publications: 490 scientists 222–231 publications: 437 scientists 232–241 publications: 423 scientists 242–251 publications: 408 scientists 252–261 publications: 377 scientists 262–271 publications: 301 scientists 272–281 publications: 335 scientists 282–291 publications: 320 scientists 292–301 publications: 293 scientists 302–311 publications: 250 scientists 312–321 publications: 238 scientists 322–331 publications: 206 scientists 332–341 publications: 209 scientists 342–351 publications: 208 scientists 352–361 publications: 162 scientists 362–371 publications: 176 scientists 372–381 publications: 127 scientists 382–391 publications: 158 scientists 392–401 publications: 128 scientists 402–411 publications: 104 scientists 412–421 publications: 94 scientists 422–431 publications: 99 scientists 432–441 publications: 83 scientists 442–451 publications: 108 scientists 452–461 publications: 73 scientists 462–471 publications: 77 scientists 472–481 publications: 69 scientists 482–491 publications: 84 scientists 492–501 publications: 62 scientists 502–511 publications: 54 scientists 512–521 publications: 57 scientists 522–531 publications: 51 scientists 532–541 publications: 51 scientists 542–551 publications: 32 scientists 552–561 publications: 38 scientists 562–571 publications: 28 scientists 572–581 publications: 43 scientists 582–591 publications: 33 scientists 592–601 publications: 41 scientists 602–611 publications: 32 scientists 612–621 publications: 28 scientists 622–631 publications: 25 scientists 632–641 publications: 27 scientists 642–651 publications: 17 scientists 652–661 publications: 20 scientists 662–671 publications: 17 scientists 672–681 publications: 15 scientists 682–691 publications: 14 scientists 692–701 publications: 21 scientists 702–711 publications: 13 scientists 712–721 publications: 12 scientists 722–731 publications: 19 scientists 732–741 publications: 14 scientists 742–751 publications: 12 scientists 752–761 publications: 10 scientists 762–771 publications: 10 scientists 772–781 publications: 11 scientists 782–791 publications: 10 scientists 792–801 publications: 11 scientists 802–811 publications: 8 scientists 812–821 publications: 8 scientists 822–831 publications: 7 scientists 832–841 publications: 11 scientists 842–851 publications: 10 scientists 852–861 publications: 5 scientists 862–871 publications: 9 scientists 872–881 publications: 4 scientists 882–891 publications: 6 scientists 892–901 publications: 3 scientists 902–911 publications: 6 scientists 912–921 publications: 3 scientists 922–931 publications: 2 scientists 932–941 publications: 2 scientists 942–951 publications: 2 scientists 952–961 publications: 3 scientists 962–971 publications: 3 scientists 972–981 publications: 3 scientists 982–990 publications: 5 scientists 991+ publications: 100 scientists
32 publications 991+

This scientist: 261 publications — 65th percentile

65% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 991 publications or more.

Jeffrey F. Naughton D-index placement in Computer Science in 2026

The chart shows the D-index (discipline H-index) distribution of Computer Science scientists ranked by Research.com in 2026. The highlighted bar marks where Jeffrey F. Naughton sits on this spectrum.

30–31 D-Index: 879 scientists 32–33 D-Index: 983 scientists 34–35 D-Index: 918 scientists 36–37 D-Index: 990 scientists 38–39 D-Index: 968 scientists 40–41 D-Index: 907 scientists 42–43 D-Index: 821 scientists 44–45 D-Index: 763 scientists 46–47 D-Index: 689 scientists 48–49 D-Index: 543 scientists 50–51 D-Index: 543 scientists 52–53 D-Index: 518 scientists 54–55 D-Index: 500 scientists 56–57 D-Index: 458 scientists 58–59 D-Index: 400 scientists 60–61 D-Index: 337 scientists 62–63 D-Index: 308 scientists 64–65 D-Index: 292 scientists 66–67 D-Index: 249 scientists 68–69 D-Index: 213 scientists 70–71 D-Index: 192 scientists 72–73 D-Index: 189 scientists 74–75 D-Index: 165 scientists 76–77 D-Index: 139 scientists 78–79 D-Index: 119 scientists 80–81 D-Index: 121 scientists 82–83 D-Index: 113 scientists 84–85 D-Index: 88 scientists 86–87 D-Index: 87 scientists 88–89 D-Index: 75 scientists 90–91 D-Index: 69 scientists 92–93 D-Index: 57 scientists 94–95 D-Index: 46 scientists 96–97 D-Index: 38 scientists 98–99 D-Index: 34 scientists 100–101 D-Index: 36 scientists 102–103 D-Index: 27 scientists 104–105 D-Index: 37 scientists 106–107 D-Index: 18 scientists 108–109 D-Index: 31 scientists 110–111 D-Index: 19 scientists 112–113 D-Index: 16 scientists 114–115 D-Index: 12 scientists 116–117 D-Index: 20 scientists 118–119 D-Index: 15 scientists 120–121 D-Index: 5 scientists 122–123 D-Index: 20 scientists 124–125 D-Index: 8 scientists 126–127 D-Index: 5 scientists 128–129 D-Index: 7 scientists 130 D-Index: 3 scientists 131+ D-Index: 98 scientists
30 D-Index 131+

This scientist: 88 D-Index — 95th percentile

95% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 131 D-Index or more.

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

Recently Published Articles