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
arXiv preprint arXiv:1201.0230, 2011
2112011
Load Balancing in MapReduce Based on Scalable Cardinality Estimates
B Gufler, N Augsten, A Reiser, A Kemper
1462012
Handling Data Skew in MapReduce.
B Gufler, N Augsten, A Reiser, A Kemper
Closer 11, 574-583, 2011
1192011
Approximate matching of hierarchical data using pq-grams
N Augsten, MH Böhlen, J Gamper
VLDB 5, 301-312, 2005
1102005
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
782008
An empirical evaluation of set similarity join techniques
W Mann, N Augsten, P Bouros
Proceedings of the VLDB Endowment 9 (9), 636-647, 2016
702016
Tree edit distance: Robust and memory-efficient
M Pawlik, N Augsten
Information Systems 56, 157-173, 2016
632016
Efficient computation of the tree edit distance
M Pawlik, N Augsten
ACM Transactions on Database Systems (TODS) 40 (1), 1-40, 2015
482015
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
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
402010
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 1313, 89-94, 2014
212014
Measuring structural similarity of semistructured data based on information-theoretic approaches
S Helmer, N Augsten, M Böhlen
The VLDB journal 21 (5), 677-702, 2012
182012
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
162018
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
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
132012
An incrementally maintainable index for approximate lookups in hierarchical data
N Augsten, M Böhlen, J Gamper
ACM, 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
On-the-fly token similarity joins in relational databases
N Augsten, A Miraglia, T Neumann, A Kemper
Proceedings of the 2014 ACM SIGMOD international conference on Management of …, 2014
112014
The system can't perform the operation now. Try again later.
Articles 1–20