Folgen
Nikolaus Augsten
Nikolaus Augsten
University of Salzburg
Bestätigte E-Mail-Adresse bei plus.ac.at - Startseite
Titel
Zitiert von
Zitiert von
Jahr
RTED: a robust algorithm for the tree edit distance
M Pawlik, N Augsten
arXiv preprint arXiv:1201.0230, 2011
2722011
Load Balancing in MapReduce Based on Scalable Cardinality Estimates
B Gufler, N Augsten, A Reiser, A Kemper
1682012
Handling Data Skew in MapReduce.
B Gufler, N Augsten, A Reiser, A Kemper
Closer 11, 574-583, 2011
1452011
Tree edit distance: Robust and memory-efficient
M Pawlik, N Augsten
Information Systems 56, 157-173, 2016
1442016
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
1292005
An empirical evaluation of set similarity join techniques
W Mann, N Augsten, P Bouros
Proceedings of the VLDB Endowment 9 (9), 636-647, 2016
1282016
Efficient computation of the tree edit distance
M Pawlik, N Augsten
ACM Transactions on Database Systems (TODS) 40 (1), 1-40, 2015
1142015
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
1112008
Similarity joins in relational database systems
N Augsten, MH Böhlen
Synthesis Lectures on Data Management 5 (5), 1-124, 2013
562013
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
522018
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
502008
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
422010
The role of web services in digital government
J Gamper, N Augsten
International Conference on Electronic Government, 161-166, 2003
352003
PEL: Position-Enhanced Length Filter for Set Similarity Joins.
W Mann, N Augsten
Grundlagen von Datenbanken 1313, 89-94, 2014
322014
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
222010
A new perspective on the tree edit distance
S Schwarz, M Pawlik, N Augsten
International Conference on Similarity Search and Applications, 156-170, 2017
202017
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
202012
Rws-diff: flexible and efficient change detection in hierarchical data
JP Finis, M Raiber, N Augsten, R Brunel, A Kemper, F Färber
Proceedings of the 22nd ACM international conference on Information …, 2013
192013
A link is not enough–reproducibility of data
M Pawlik, T Hütter, D Kocher, W Mann, N Augsten
Datenbank-Spektrum 19 (2), 107-115, 2019
182019
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
182012
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20