RTED: a robust algorithm for the tree edit distance M Pawlik, N Augsten arXiv preprint arXiv:1201.0230, 2011 | 300 | 2011 |
Tree edit distance: Robust and memory-efficient M Pawlik, N Augsten Information Systems 56, 157-173, 2016 | 193 | 2016 |
Load Balancing in MapReduce Based on Scalable Cardinality Estimates B Gufler, N Augsten, A Reiser, A Kemper | 177 | 2012 |
An empirical evaluation of set similarity join techniques W Mann, N Augsten, P Bouros Proceedings of the VLDB Endowment 9 (9), 636-647, 2016 | 164 | 2016 |
Handling data skew in MapReduce. B Gufler, N Augsten, A Reiser, A Kemper Closer 11, 574-583, 2011 | 155 | 2011 |
Efficient computation of the tree edit distance M Pawlik, N Augsten ACM Transactions on Database Systems (TODS) 40 (1), 1-40, 2015 | 139 | 2015 |
Approximate matching of hierarchical data using pq-grams N Augsten, MH Böhlen, J Gamper VLDB 5, 301-312, 2005 | 135 | 2005 |
The pq-gram distance between ordered labeled trees N Augsten, M Böhlen, J Gamper ACM Transactions on Database Systems (TODS) 35 (1), 1-36, 2008 | 120 | 2008 |
Set similarity joins on mapreduce: An experimental survey F Fier, N Augsten, P Bouros, U Leser, JC Freytag Proceedings of the VLDB Endowment 11 (10), 1110-1122, 2018 | 72 | 2018 |
Similarity joins in relational database systems N Augsten, M Bohlen Morgan & Claypool Publishers, 2013 | 66 | 2013 |
Approximate joins for data-centric XML N Augsten, M Bohlen, C Dyreson, J Gamper 2008 IEEE 24th International Conference on Data Engineering, 814-823, 2008 | 51 | 2008 |
Tasm: Top-k approximate subtree matching N Augsten, D Barbosa, M Böhlen, T Palpanas 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010), 353-364, 2010 | 44 | 2010 |
PEL: Position-Enhanced Length Filter for Set Similarity Joins. W Mann, N Augsten Grundlagen von Datenbanken 1313, 89-94, 2014 | 37 | 2014 |
The role of web services in digital government J Gamper, N Augsten International Conference on Electronic Government, 161-166, 2003 | 35 | 2003 |
A link is not enough–reproducibility of data M Pawlik, T Hütter, D Kocher, W Mann, N Augsten Datenbank-Spektrum 19, 107-115, 2019 | 31 | 2019 |
A new perspective on the tree edit distance S Schwarz, M Pawlik, N Augsten Similarity Search and Applications: 10th International Conference, SISAP …, 2017 | 27 | 2017 |
DeSignate: detecting signature characters in gene sequence alignments for taxon diagnoses T Hütter, MH Ganser, M Kocher, M Halkic, S Agatha, N Augsten BMC bioinformatics 21, 1-9, 2020 | 25 | 2020 |
Measuring structural similarity of semistructured data based on information-theoretic approaches S Helmer, N Augsten, M Böhlen The VLDB journal 21, 677-702, 2012 | 21 | 2012 |
Efficient top-k approximate subtree matching in small memory N Augsten, D Barbosa, M Bohlen, T Palpanas IEEE transactions on knowledge and data engineering 23 (8), 1123-1137, 2010 | 21 | 2010 |
A relational matrix algebra and its implementation in a column store O Dolmatova, N Augsten, MH Böhlen Proceedings of the 2020 ACM SIGMOD International Conference on Management of …, 2020 | 19 | 2020 |