Nikolaus Augsten
Nikolaus Augsten
Verified email at sbg.ac.at - Homepage
TitleCited byYear
RTED: a robust algorithm for the tree edit distance
M Pawlik, N Augsten
Proceedings of the VLDB Endowment 5 (4), 334-345, 2011
2002011
Load Balancing in MapReduce Based on Scalable Cardinality Estimates
B Gufler, N Augsten, A Reiser, A Kemper
1402012
Handling Data Skew in MapReduce.
B Gufler, N Augsten, A Reiser, A Kemper
Closer 11, 574-583, 2011
1132011
Approximate matching of hierarchical data using pq-grams
N Augsten, M Böhlen, J Gamper
Proceedings of the 31st international conference on Very large data bases …, 2005
1062005
The pq-gram distance between ordered labeled trees
N Augsten, M Böhlen, J Gamper
ACM Transactions on Database Systems (TODS) 35 (1), 4, 2010
772010
An empirical evaluation of set similarity join techniques
W Mann, N Augsten, P Bouros
Proceedings of the VLDB Endowment 9 (9), 636-647, 2016
612016
Tree edit distance: Robust and memory-efficient
M Pawlik, N Augsten
Information Systems 56, 157-173, 2016
482016
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
432008
Efficient computation of the tree edit distance
M Pawlik, N Augsten
ACM Transactions on Database Systems (TODS) 40 (1), 3, 2015
392015
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
392010
Similarity joins in relational database systems
N Augsten, MH Böhlen
Synthesis Lectures on Data Management 5 (5), 1-124, 2013
342013
The role of web services in digital government
J Gamper, N Augsten
International Conference on Electronic Government, 161-166, 2003
302003
PEL: Position-Enhanced Length Filter for Set Similarity Joins.
W Mann, N Augsten
Grundlagen von Datenbanken, 89-94, 2014
202014
Measuring structural similarity of semistructured data based on information-theoretic approaches
S Helmer, N Augsten, M Böhlen
The VLDB Journal—The International Journal on Very Large Data Bases 21 (5 …, 2012
172012
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
162010
SYSTEMS AND METHODS FOR EFFICIENT TOP-k APPROXIMATE SUBTREE MATCHING
D Barbosa, N Augsten, M Böhlen, T Palpanas
US Patent App. 13/411,494, 2012
152012
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
132018
An incrementally maintainable index for approximate lookups in hierarchical data
N Augsten, M Böhlen, J Gamper
Proceedings of the 32nd international conference on Very large data bases …, 2006
132006
A memory-efficient tree edit distance algorithm
M Pawlik, N Augsten
International Conference on Database and Expert Systems Applications, 196-210, 2014
122014
Windowed pq-grams for approximate joins of data-centric XML
N Augsten, M Böhlen, C Dyreson, J Gamper
The VLDB Journal 21 (4), 463-488, 2012
122012
The system can't perform the operation now. Try again later.
Articles 1–20