This map shows the geographic impact of Sven Helmer'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 Sven Helmer with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Sven Helmer more than expected).
This network shows the impact of papers produced by Sven Helmer. 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 Sven Helmer. The network helps show where Sven Helmer may publish in the future.
Co-authorship network of co-authors of Sven Helmer
This figure shows the co-authorship network connecting the top 25 collaborators of Sven Helmer.
A scholar is included among the top collaborators of Sven Helmer 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 Sven Helmer. Sven Helmer is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Helmer, Sven, et al.. (2009). Increasing the Performance of Fuzzy Retrieval Using Impact Ordering. BIROn (Birkbeck, University of London). 957–962.2 indexed citations
14.
Helmer, Sven. (2007). Measuring the structural similarity of semistructured documents using entropy. View. 1022–1032.35 indexed citations
15.
Helmer, Sven, et al.. (2004). XQuery Processing in Natix with an Emphasis on Join Ordering.. MADOC (University of Mannheim). 49–54.8 indexed citations
16.
Helmer, Sven, et al.. (2002). Compiling Away Set Containment and Intersection Joins. MADOC (University of Mannheim).1 indexed citations
17.
Helmer, Sven, et al.. (2002). Natix: A Technology Overview.3 indexed citations
18.
Helmer, Sven, Till Westmann, & Guido Moerkotte. (1998). Diag-Join: An Opportunistic Join Algorithm for 1:N Relationships. MADOC (University of Mannheim). 98–109.18 indexed citations
19.
Helmer, Sven & Guido Moerkotte. (1997). Evaluation of main memory join algorithms for joins with subset join predicates. View. 386–395.7 indexed citations
20.
Helmer, Sven & Guido Moerkotte. (1996). Evaluation of Main Memory Join Algorithms for Joins with Set Comparison Join Predicates. Very Large Data Bases. 386–395.38 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.