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.
SCOPE
2008505 citationsPer-Åke Larson, Jingren Zhou et al.profile →
Hekaton
2013330 citationsCraig Freedman, Per-Åke Larson et al.profile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
Countries citing papers authored by Per-Åke Larson
Since
Specialization
Citations
This map shows the geographic impact of Per-Åke Larson'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 Per-Åke Larson with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Per-Åke Larson more than expected).
This network shows the impact of papers produced by Per-Åke Larson. 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 Per-Åke Larson. The network helps show where Per-Åke Larson may publish in the future.
Co-authorship network of co-authors of Per-Åke Larson
This figure shows the co-authorship network connecting the top 25 collaborators of Per-Åke Larson.
A scholar is included among the top collaborators of Per-Åke Larson 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 Per-Åke Larson. Per-Åke Larson is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Freedman, Craig, et al.. (2014). Compilation in the Microsoft SQL Server Hekaton Engine.. IEEE Data(base) Engineering Bulletin. 37. 22–30.33 indexed citations
3.
Larson, Per-Åke, et al.. (2013). The Hekaton Memory-Optimized OLTP Engine.. IEEE Data(base) Engineering Bulletin. 36. 34–40.30 indexed citations
4.
Larson, Per-Åke, Eric N. Hanson, & Susan Price. (2012). Columnar Storage in SQL Server 2012. IEEE Data(base) Engineering Bulletin. 35. 15–20.14 indexed citations
5.
Zhou, Jingren, Per-Åke Larson, & Hicham G. Elmongui. (2007). Lazy maintenance of materialized views. Very Large Data Bases. 231–242.44 indexed citations
6.
Guo, Hongfei, Per-Åke Larson, & Raghu Ramakrishnan. (2005). Caching with good enough currency, consistency, and completeness. Minds at UW (University of Wisconsin). 457–468.18 indexed citations
Zhang, Weiye & Per-Åke Larson. (1998). Buffering and Read-Ahead Strategies for External Mergesort. Very Large Data Bases. 523–533.15 indexed citations
9.
Zhang, Weiye & Per-Åke Larson. (1997). Dynamic Memory Adjustment for External Mergesort. Very Large Data Bases. 376–385.30 indexed citations
10.
Zhang, Weiye & Per-Åke Larson. (1996). A memory-adaptive sort (MASORT) for database systems. Conference of the Centre for Advanced Studies on Collaborative Research. 41.7 indexed citations
11.
Bauer, Michael, et al.. (1994). Managing Global Information in the CORDS Multidatabase System.. 23–34.1 indexed citations
Seeger, Bernhard, et al.. (1993). Reading a Set of Disk Pages. Very Large Data Bases. 592–603.18 indexed citations
14.
Bauer, Michael, et al.. (1993). An integrated architecture for distributed applications. Conference of the Centre for Advanced Studies on Collaborative Research. 8–26.3 indexed citations
15.
Zhu, Qiang & Per-Åke Larson. (1993). Query optimization using fuzzy set theory for multidatabase systems. Conference of the Centre for Advanced Studies on Collaborative Research. 848–859.3 indexed citations
16.
Larson, Per-Åke, et al.. (1992). Multidatabase services: issues and architectural design. Conference of the Centre for Advanced Studies on Collaborative Research. 57–66.9 indexed citations
17.
Boral, Haran & Per-Åke Larson. (1988). Proceedings of the 1988 ACM SIGMOD international conference on Management of data. International Conference on Management of Data.3 indexed citations
18.
Larson, Per-Åke, et al.. (1987). Query Transformation for PSJ-Queries. Very Large Data Bases. 245–254.94 indexed citations
19.
Larson, Per-Åke, et al.. (1985). Computing queries from derived relations. Very Large Data Bases. 259–269.100 indexed citations
20.
Larson, Per-Åke, et al.. (1985). Robin Hood Hashing (Preliminary Report). 281–288.4 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.