Nikolaus Augsten

67 papers A* 10A 2B 4C 3Journal 31Unranked 15

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