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 Eigentrust algorithm for reputation management in P2P networks
20032.1k citationsHéctor García-Molina et al.profile →
The Eigentrust algorithm for reputation management in P2P networks
20031.0k citationsHéctor García-Molina et al.profile →
Similarity flooding: a versatile graph matching algorithm and its application to schema matching
2003785 citationsSergey Melnik, Héctor García-Molina et al.profile →
Countries citing papers authored by Héctor García-Molina
Since
Specialization
Citations
This map shows the geographic impact of Héctor García-Molina'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 Héctor García-Molina with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Héctor García-Molina more than expected).
Fields of papers citing papers by Héctor García-Molina
This network shows the impact of papers produced by Héctor García-Molina. 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 Héctor García-Molina. The network helps show where Héctor García-Molina may publish in the future.
Co-authorship network of co-authors of Héctor García-Molina
This figure shows the co-authorship network connecting the top 25 collaborators of Héctor García-Molina.
A scholar is included among the top collaborators of Héctor García-Molina 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 Héctor García-Molina. Héctor García-Molina 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.
García-Molina, Héctor, et al.. (2007). Beyond Just Data Privacy. Conference on Innovative Data Systems Research. 324–331.3 indexed citations
Yerneni, Ramana, et al.. (1998). Fusion Queries over Internet Databases.5 indexed citations
10.
Cho, Junghoo, Héctor García-Molina, & Lawrence M. Page. (1998). Efficient Crawling Through URL Ordering.2 indexed citations
11.
Gravano, Luis, Kevin Chen–Chuan Chang, Héctor García-Molina, & Andreas Paepcke. (1997). STARTS: Stanford Proposal for Internet Meta-Searching (Experience Paper).. International Conference on Management of Data. 207–218.2 indexed citations
Yan, Tak W. & Héctor García-Molina. (1995). Duplicate Removal in Information System Dissemination. Very Large Data Bases. 66–77.5 indexed citations
14.
García-Molina, Héctor, Richard J. Lipton, & Jacobo Valdes. (1989). A massive memory machine. IEEE Press eBooks. 408–416.9 indexed citations
15.
Abbott, Robert & Héctor García-Molina. (1989). Scheduling real-time transactions with disk resident data. Very Large Data Bases. 385–395.110 indexed citations
16.
García-Molina, Héctor & Kenneth Salem. (1988). Requirements Specification for a Temporal Extension to the Relationsl Model.. IEEE Data(base) Engineering Bulletin. 11. 26–33.5 indexed citations
17.
García-Molina, Héctor, et al.. (1987). Performance evaluation of reliable distributed systems. 454–488.5 indexed citations
18.
Barbará, Daniel, et al.. (1986). Policies for Dynamic Vote Reassignment.. International Conference on Distributed Computing Systems. 25(4). 37–44.19 indexed citations
Barbará, Daniel & Héctor García-Molina. (1982). How Expensive is Data Replication? An Example.. International Conference on Distributed Computing Systems. 263–268.8 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.