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.
This map shows the geographic impact of David Lomet'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 David Lomet with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites David Lomet more than expected).
This network shows the impact of papers produced by David Lomet. 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 David Lomet. The network helps show where David Lomet may publish in the future.
Co-authorship network of co-authors of David Lomet
This figure shows the co-authorship network connecting the top 25 collaborators of David Lomet.
A scholar is included among the top collaborators of David Lomet 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 David Lomet. David Lomet is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Lomet, David. (2019). Data Caching Systems Win the Cost/Performance Game.. IEEE Data(base) Engineering Bulletin. 42. 3–5.1 indexed citations
3.
Larson, Paul D., et al.. (2012). Message from the TCDE Chair Nominating Committee.. IEEE Data(base) Engineering Bulletin. 35. 2.
4.
Jensen, Christian S. & David Lomet. (2001). TRANSACTION TIME STAMPING IN (TEMPORAL) DATABASES. VBN Forskningsportal (Aalborg Universitet). 441–450.20 indexed citations
5.
Lomet, David. (2000). Review - Notes on Data Base Operating Systems.. International Conference on Management of Data. 2.
6.
Evangelidis, Georgios, David Lomet, & Betty Salzberg. (1997). The hBPi/-tree: A Concurrent and Recoverable Multi-attribute Index. The VLDB Journal.1 indexed citations
7.
Antoshenkov, Gennady, David Lomet, & James D. Murray. (1996). Order Preserving Compression. 655–663.16 indexed citations
8.
Lomet, David & Mark R. Tuttle. (1995). Redo Recovery after System Crashes. Very Large Data Bases. 457–468.23 indexed citations
9.
Evangelidis, Georgios, David Lomet, & Betty Salzberg. (1995). The hBP-tree: A Modified hB-tree Supporting Concurrency, Recovery and Node Consolidation. Very Large Data Bases. 551–561.19 indexed citations
10.
Lomet, David. (1993). Key Range Locking Strategies for Improved Concurrency. Very Large Data Bases. 655–664.46 indexed citations
11.
Lomet, David & Betty Salzberg. (1993). Exploiting A History Database for Backup. Very Large Data Bases. 380–390.14 indexed citations
12.
Agrawal, Rakesh & David Lomet. (1993). Important Membership Message - Repeated from March Issue.. IEEE Data(base) Engineering Bulletin. 16. 1.1 indexed citations
Bernstein, Philip A. & David Lomet. (1987). CASE Requirements for Extensible Database Systems.. IEEE Data(base) Engineering Bulletin. 10. 2–9.2 indexed citations
19.
Lomet, David. (1981). Digital B-trees. Very Large Data Bases. 333–344.21 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.