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.
ARIES
1992650 citationsC. Mohan, Bruce G. Lindsay et al.profile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
This map shows the geographic impact of C. Mohan'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 C. Mohan with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites C. Mohan more than expected).
This network shows the impact of papers produced by C. Mohan. 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 C. Mohan. The network helps show where C. Mohan may publish in the future.
Co-authorship network of co-authors of C. Mohan
This figure shows the co-authorship network connecting the top 25 collaborators of C. Mohan.
A scholar is included among the top collaborators of C. Mohan 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 C. Mohan. C. Mohan is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
20 of 20 papers shown
1.
Barber, Ronald, Christian Garcia-Arellano, René Müller, et al.. (2017). Evolving Databases for New-Gen Big Data Applications.. Conference on Innovative Data Systems Research.9 indexed citations
2.
Mohan, C.. (2015). Big Data: Hype and Reality.. SEBD. 11.2 indexed citations
3.
Bornhövd, Christof, Mehmet Altınel, C. Mohan, Hamid Pirahesh, & Berthold Reinwald. (2004). Adaptive Database Caching with DBCache.. IEEE Data(base) Engineering Bulletin. 27. 11–18.37 indexed citations
4.
Mohan, C.. (2001). Caching Technologies for Web Applications. Very Large Data Bases. 726.31 indexed citations
5.
Mohan, C., et al.. (2000). Evolution of Groupware for Business Applications: A Database Perspective on Lotus Domino/Notes. Very Large Data Bases. 684–687.5 indexed citations
6.
Mohan, C.. (1999). Repeating History Beyond ARIES. Very Large Data Bases. 1–17.26 indexed citations
7.
Mohan, C.. (1995). Concurrency control and recovery methods for B + -tree indexes: ARIES/KVL and ARIES/IM. Prentice-Hall, Inc eBooks. 248–306.14 indexed citations
8.
Mohan, C., Gustavo Alonso, Roger Günthör, & M. Kamath. (1995). Exotica: A Research Perspective ob Workflow Management Systems.. IEEE Data(base) Engineering Bulletin. 18. 19–26.31 indexed citations
9.
Alonso, Gustavo, Roger Günthör, M. Kamath, et al.. (1995). Exotica/FMDC: Handling Disconnected Clients in a Workflow Management System.. 99–110.35 indexed citations
10.
Mohan, C., et al.. (1994). Recent Work on Distributed Commit Protocolls, and Recoverable Messaging and Queuing.. IEEE Data(base) Engineering Bulletin. 17. 22–28.15 indexed citations
11.
Mohan, C.. (1993). A Cost-Effective Method for Providing Improved Data Availability During DBMS Restart Recovery After a Failure. Very Large Data Bases. 368–379.14 indexed citations
12.
Mohan, C.. (1993). Generalized Presumed Abort: Marrying Presumed Abort and SNA LU6.2 Commit Protocols.. 0.4 indexed citations
13.
Pirahesh, Hamid, et al.. (1991). Alert: An Architecture for Transforming a Passive DBMS into an Active DBMS. Very Large Data Bases. 469–478.72 indexed citations
14.
Mohan, C.. (1990). ARIES/KVL: A Key-Value Locking Method for Concurrency Control of Multiaction Transactions Operating on B-Tree Indexes. Very Large Data Bases. 392–405.137 indexed citations
15.
Mohan, C.. (1990). Commit-LSN: a novel and simple method for reducing locking and latching in transaction processing systems. Very Large Data Bases. 307–335.38 indexed citations
16.
Rothermel, Kurt & C. Mohan. (1989). ARIES/NT: a recovery method based on write-ahead logging for nested transactions. Very Large Data Bases. 337–346.43 indexed citations
17.
Mohan, C.. (1987). Directions in System Architectures for High Transaction Rates.. International Conference on Management of Data. 6.1 indexed citations
18.
Mohan, C.. (1984). Recent Advances in Distributed Data Base Management. IEEE Computer Society Press eBooks.4 indexed citations
19.
Haas, Laura M., Patricia G. Selinger, Elisa Bertino, et al.. (1982). Research Direction in Query Optimization at the University of Maryland.. IEEE Data(base) Engineering Bulletin. 5. 28–32.15 indexed citations
20.
Kedem, Zvi M., C. Mohan, & Abraham Silberschatz. (1982). An Efficient Deadlock Removal Scheme for Non-Two-Phase Locking Protocols. Very Large Data Bases. 91–97.3 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.