Author of the publication

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Augsten, Nikolaus
add a person with the name Augsten, Nikolaus
 

Other publications of authors with the same name

Efficient Top-k Approximate Subtree Matching in Small Memory., , , and . IEEE Trans. Knowl. Data Eng., 23 (8): 1123-1137 (2011)The address connector: noninvasive synchronization of hierarchical data sources., , and . Knowl. Inf. Syst., 37 (3): 639-663 (2013)Tree edit distance: Robust and memory-efficient., and . Inf. Syst., (2016)A Scalable Index for Top-k Subtree Similarity Queries., and . SIGMOD Conference, page 1624-1641. ACM, (2019)PEL: Position-Enhanced Length Filter for Set Similarity Joins., and . Grundlagen von Datenbanken, volume 1313 of CEUR Workshop Proceedings, page 89-94. CEUR-WS.org, (2014)On-the-fly token similarity joins in relational databases., , , and . SIGMOD Conference, page 1495-1506. ACM, (2014)Approximate Matching of Hierarchical Data Using pq-Grams., , and . VLDB, page 301-312. ACM, (2005)SWOOP: Top-k Similarity Joins over Set Streams., , and . CoRR, (2017)Load Balancing in MapReduce Based on Scalable Cardinality Estimates., , , and . ICDE, page 522-533. IEEE Computer Society, (2012)A Memory-Efficient Tree Edit Distance Algorithm., and . DEXA (1), volume 8644 of Lecture Notes in Computer Science, page 196-210. Springer, (2014)