Nikolaus Augsten

Publication Activity (10 Years)

Years Active: 2003-2024
Publications (10 Years): 36

Top Topics

Public Transport

Relational Data

Similarity Join

Top Venues

SIGMOD Conference

Proc. VLDB Endow.

Publications

Manuel Widmoser, Daniel Kocher, Nikolaus Augsten
Scalable Distributed Inverted List Indexes in Disaggregated Memory. Proc. ACM Manag. Data 2 (3) (2024)
Bianca Löhnert, Nikolaus Augsten, Cem Okulmus, Magdalena Ortiz
Towards Practicable Algorithms for Rewriting Graph Queries beyond DL-Lite (Extended Abstract). Description Logics (2024)
Bianca Löhnert, Nikolaus Augsten, Cem Okulmus, Magdalena Ortiz
Towards Practicable Algorithms for Rewriting Graph Queries beyond DL-Lite. CoRR (2024)
Franziska Neuhof, Marco Fisichella, George Papadakis, Konstantinos Nikoletos, Nikolaus Augsten, Wolfgang Nejdl, Manolis Koubarakis
Open benchmark for filtering techniques in entity resolution. VLDB J. 33 (5) (2024)
Pranay Mundra, Jianhao Zhang, Fatemeh Nargesian, Nikolaus Augsten
Koios: Top-k Semantic Overlap Set Search. ICDE (2023)
Pranay Mundra, Jianhao Zhang, Fatemeh Nargesian, Nikolaus Augsten
KOIOS: Top-k Semantic Overlap Set Search. CoRR (2023)
Konstantin Emil Thiel, Daniel Kocher, Nikolaus Augsten, Thomas Hütter, Willi Mann, Daniel Ulrich Schmitt
FINEX: A Fast Index for Exact & Flexible Density-Based Clustering. Proc. ACM Manag. Data 1 (1) (2023)
George Papadakis, Marco Fisichella, Franziska Schoger, George Mandilaras, Nikolaus Augsten, Wolfgang Nejdl
Benchmarking Filtering Techniques for Entity Resolution. ICDE (2023)
Daniel Ulrich Schmitt, Daniel Kocher, Nikolaus Augsten, Willi Mann, Alexander Miller
A Two-Level Signature Scheme for Stable Set Similarity Joins. Proc. VLDB Endow. 16 (11) (2023)
Manuel Widmoser, Daniel Kocher, Nikolaus Augsten, Willi Mann
MetricJoin: Leveraging Metric Properties for Robust Exact Set Similarity Joins. ICDE (2023)
Konstantin Emil Thiel, Daniel Kocher, Nikolaus Augsten, Thomas Hütter, Willi Mann, Daniel Ulrich Schmitt
FINEX: A Fast Index for Exact & Flexible Density-Based Clustering (Extended Version with Proofs). CoRR (2023)
George Papadakis, Marco Fisichella, Franziska Schoger, George Mandilaras, Nikolaus Augsten, Wolfgang Nejdl
How to reduce the search space of Entity Resolution: with Blocking or Nearest Neighbor search? CoRR (2022)
Thomas Hütter, Nikolaus Augsten, Christoph M. Kirsch, Michael J. Carey, Chen Li
JEDI: These aren't the JSON documents you're looking for? SIGMOD Conference (2022)
Thomas Hütter, Nikolaus Augsten, Christoph M. Kirsch, Michael J. Carey, Chen Li
JEDI: These aren't the JSON documents you're looking for... (Extended Version*). CoRR (2022)
Bezaye Tesfaye, Nikolaus Augsten, Mateusz Pawlik, Michael H. Böhlen, Christian S. Jensen
Speeding Up Reachability Queries in Public Transport Networks Using Graph Partitioning. Inf. Syst. Frontiers 24 (1) (2022)
Iztok Savnik, Kiyoshi Nitta, Riste Skrekovski, Nikolaus Augsten
Statistics of RDF Store for Querying Knowledge Graphs. FoIKS (2022)
Iztok Savnik, Kiyoshi Nitta, Riste Skrekovski, Nikolaus Augsten
Statistics of Knowledge Graphs Based On The Conceptual Schema. CoRR (2021)
Daniel Kocher, Nikolaus Augsten, Willi Mann
Scaling Density-Based Clustering to Large Collections of Sets. EDBT (2021)
Thomas Hütter, Maximilian H. Ganser, Manuel Kocher, Merima Halkic, Sabine Agatha, Nikolaus Augsten
DeSignate: detecting signature characters in gene sequence alignments for taxon diagnoses. BMC Bioinform. 21 (1) (2020)
Oksana Dolmatova, Nikolaus Augsten, Michael H. Böhlen
Preserving Contextual Information in Relational Matrix Operations. ICDE (2020)
Bezaye Tesfaye, Nikolaus Augsten, Mateusz Pawlik, Michael H. Böhlen, Christian S. Jensen
An Efficient Index for Reachability Queries in Public Transport Networks. ADBIS (2020)
Oksana Dolmatova, Nikolaus Augsten, Michael H. Böhlen
A Relational Matrix Algebra and its Implementation in a Column Store. CoRR (2020)
Mateusz Pawlik, Nikolaus Augsten
Minimal Edit-Based Diffs for Large Trees. CIKM (2020)
Oksana Dolmatova, Nikolaus Augsten, Michael H. Böhlen
A Relational Matrix Algebra and its Implementation in a Column Store. SIGMOD Conference (2020)
Mateusz Pawlik, Thomas Hütter, Daniel Kocher, Willi Mann, Nikolaus Augsten
A Link is not Enough - Reproducibility of Data. Datenbank-Spektrum 19 (2) (2019)
Daniel Kocher, Nikolaus Augsten
A Scalable Index for Top-k Subtree Similarity Queries. SIGMOD Conference (2019)
Thomas Hütter, Mateusz Pawlik, Robert Loschinger, Nikolaus Augsten
Effective Filters and Linear Time Verification for Tree Similarity Joins. ICDE (2019)
Fabian Fier, Nikolaus Augsten, Panagiotis Bouros, Ulf Leser, Johann-Christoph Freytag
Set Similarity Joins on MapReduce: An Experimental Survey. Proc. VLDB Endow. 11 (10) (2018)
Nikolaus Augsten
A Roadmap towards Declarative Similarity Queries. EDBT (2018)
Doris Silbernagl, Nikolaus Krismer, Nikolaus Augsten, Günther Specht
Recommending OSM Tags To Improve Metadata Quality. LocalRec@SIGSPATIAL (2017)
Willi Mann, Nikolaus Augsten, Christian S. Jensen
SWOOP: Top-k Similarity Joins over Set Streams. CoRR (2017)
Stefan Schwarz, Mateusz Pawlik, Nikolaus Augsten
A New Perspective on the Tree Edit Distance. SISAP (2017)
Mateusz Pawlik, Nikolaus Augsten
Tree edit distance: Robust and memory-efficient. Inf. Syst. 56 (2016)
Bezaye Tesfaye, Nikolaus Augsten
Reachability Queries in Public Transport Networks. GvD (2016)
Willi Mann, Nikolaus Augsten, Panagiotis Bouros
An Empirical Evaluation of Set Similarity Join Techniques. Proc. VLDB Endow. 9 (9) (2016)
Mateusz Pawlik, Nikolaus Augsten
Efficient Computation of the Tree Edit Distance. ACM Trans. Database Syst. 40 (1) (2015)
Nikolaus Augsten, Armando Miraglia, Thomas Neumann, Alfons Kemper
On-the-fly token similarity joins in relational databases. SIGMOD Conference (2014)
Willi Mann, Nikolaus Augsten
PEL: Position-Enhanced Length Filter for Set Similarity Joins. Grundlagen von Datenbanken (2014)
Mateusz Pawlik, Nikolaus Augsten
A Memory-Efficient Tree Edit Distance Algorithm. DEXA (1) (2014)
Jan P. Finis, Martin Raiber, Nikolaus Augsten, Robert Brunel, Alfons Kemper, Franz Färber
RWS-Diff: flexible and efficient change detection in hierarchical data. CIKM (2013)
Michail Kazimianec, Nikolaus Augsten
Clustering with Proximity Graphs: Exact and Efficient Algorithms. Int. J. Knowl. Based Organ. 3 (4) (2013)
Nikolaus Augsten, Michael H. Böhlen, Johann Gamper
The address connector: noninvasive synchronization of hierarchical data sources. Knowl. Inf. Syst. 37 (3) (2013)
Benjamin Gufler, Nikolaus Augsten, Angelika Reiser, Alfons Kemper
Load Balancing in MapReduce Based on Scalable Cardinality Estimates. ICDE (2012)
Sven Helmer, Nikolaus Augsten, Michael H. Böhlen
Measuring structural similarity of semistructured data based on information-theoretic approaches. VLDB J. 21 (5) (2012)
Nikolaus Augsten, Michael H. Böhlen, Curtis E. Dyreson, Johann Gamper
Windowed pq-grams for approximate joins of data-centric XML. VLDB J. 21 (4) (2012)
Mateusz Pawlik, Nikolaus Augsten
RTED: A Robust Algorithm for the Tree Edit Distance CoRR (2012)
Mateusz Pawlik, Nikolaus Augsten
RTED: A Robust Algorithm for the Tree Edit Distance. Proc. VLDB Endow. 5 (4) (2011)
Benjamin Gufler, Nikolaus Augsten, Angelika Reiser, Alfons Kemper
Handling Data Skew in MapReduce. CLOSER (2011)
Michail Kazimianec, Nikolaus Augsten
PG-Skip: Proximity Graph Based Clustering of Long Strings. DASFAA (2) (2011)
Michail Kazimianec, Nikolaus Augsten
PG-Join: Proximity Graph Based String Similarity Joins. SSDBM (2011)
Nikolaus Augsten, Denilson Barbosa, Michael H. Böhlen, Themis Palpanas
Efficient Top-k Approximate Subtree Matching in Small Memory. IEEE Trans. Knowl. Data Eng. 23 (8) (2011)
Michail Kazimianec, Nikolaus Augsten
Exact and Efficient Proximity Graph Computation. ADBIS (2010)
Nikolaus Augsten, Michael H. Böhlen, Johann Gamper
-gram distance between ordered labeled trees. ACM Trans. Database Syst. 35 (1) (2010)
Nikolaus Augsten, Denilson Barbosa, Michael H. Böhlen, Themis Palpanas
TASM: Top-k Approximate Subtree Matching. ICDE (2010)
Nikolaus Augsten, Michael H. Böhlen, Curtis E. Dyreson, Johann Gamper
Approximate Joins for Data-Centric XML. ICDE (2008)
Nikolaus Augsten, Michael H. Böhlen, Johann Gamper
An Incrementally Maintainable Index for Approximate Lookups in Hierarchical Data. VLDB (2006)
Nikolaus Augsten, Michael H. Böhlen, Johann Gamper
Approximate Matching of Hierarchical Data Using pq-Grams. VLDB (2005)
Nikolaus Augsten, Michael H. Böhlen, Johann Gamper
Reducing the Integration of Public Administration Databases to Approximate Tree Matching. EGOV (2004)
Johann Gamper, Nikolaus Augsten
The Role of Web Services in Digital Government. EGOV (2003)