Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
The Lorel query language for semistructured data
1997587 citationsSerge Abiteboul, Dallan Quass et al.International Journal on Digital Librariesprofile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
This map shows the geographic impact of Jason McHugh's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Jason McHugh with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jason McHugh more than expected).
This network shows the impact of papers produced by Jason McHugh. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Jason McHugh. The network helps show where Jason McHugh may publish in the future.
Co-authorship network of co-authors of Jason McHugh
This figure shows the co-authorship network connecting the top 25 collaborators of Jason McHugh.
A scholar is included among the top collaborators of Jason McHugh based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Jason McHugh. Jason McHugh is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
McHugh, Jason & Jennifer Widom. (1999). Query Optimization for XML. Very Large Data Bases. 315–326.181 indexed citations
5.
McHugh, Jason & Jennifer Widom. (1999). Optimizing Branching Path Expressions.11 indexed citations
6.
Abiteboul, Serge, Jason McHugh, Michael Rys, Vasilis Vassalos, & Janet L. Wiener. (1998). Incremental Maintenance for Materialized Views over Semistructured Data. Very Large Data Bases. 38–49.68 indexed citations
7.
Goldman, Roy, Sudarshan S. Chawathe, Arturo Crespo, & Jason McHugh. (1998). A Standard Textual Interchange Format for the Object Exchange Model (OEM).7 indexed citations
8.
McHugh, Jason & Jennifer Widom. (1998). Compile-Time Path Expansion in Lore.14 indexed citations
9.
McHugh, Jason, et al.. (1998). Indexing Semistructured Data.55 indexed citations
Abiteboul, Serge, Dallan Quass, Jason McHugh, Jennifer Widom, & Janet L. Wiener. (1997). The Lorel query language for semistructured data. International Journal on Digital Libraries. 1(1). 68–88.587 indexed citations breakdown →
14.
Abiteboul, Serge, et al.. (1997). Views for Semistructured Data.28 indexed citations
15.
McHugh, Jason & Jennifer Widom. (1997). Query Optimization for Semistructured Data.10 indexed citations
16.
Quass, Dallan, Serge Abiteboul, Jeff Ullman, et al.. (1996). LORE. 549–549.33 indexed citations
17.
Quass, Dallan, Jennifer Widom, Roy Goldman, et al.. (1996). LORE. ACM SIGMOD Record. 25(2). 549–549.5 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.