default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNikolaus Augsten
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j18]Manuel Widmoser
, Daniel Kocher, Nikolaus Augsten:
Scalable Distributed Inverted List Indexes in Disaggregated Memory. Proc. ACM Manag. Data 2(3): 171 (2024)- [j17]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): 1671-1696 (2024) - [c32]Bianca Löhnert, Nikolaus Augsten, Cem Okulmus, Magdalena Ortiz:
Towards Practicable Algorithms for Rewriting Graph Queries beyond DL-Lite (Extended Abstract). Description Logics 2024 - [i9]Bianca Löhnert, Nikolaus Augsten, Cem Okulmus, Magdalena Ortiz:
Towards Practicable Algorithms for Rewriting Graph Queries beyond DL-Lite. CoRR abs/2405.18181 (2024) - 2023
- [j16]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): 71:1-71:25 (2023) - [j15]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): 2686-2698 (2023) - [c31]George Papadakis, Marco Fisichella, Franziska Schoger, George Mandilaras, Nikolaus Augsten, Wolfgang Nejdl:
Benchmarking Filtering Techniques for Entity Resolution. ICDE 2023: 653-666 - [c30]Manuel Widmoser, Daniel Kocher, Nikolaus Augsten, Willi Mann:
MetricJoin: Leveraging Metric Properties for Robust Exact Set Similarity Joins. ICDE 2023: 1045-1058 - [c29]Pranay Mundra, Jianhao Zhang, Fatemeh Nargesian, Nikolaus Augsten:
Koios: Top-k Semantic Overlap Set Search. ICDE 2023: 1531-1543 - [i8]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 abs/2304.04817 (2023) - [i7]Pranay Mundra, Jianhao Zhang, Fatemeh Nargesian, Nikolaus Augsten:
KOIOS: Top-k Semantic Overlap Set Search. CoRR abs/2304.10572 (2023) - 2022
- [j14]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): 11-29 (2022) - [c28]Iztok Savnik, Kiyoshi Nitta, Riste Skrekovski, Nikolaus Augsten:
Statistics of RDF Store for Querying Knowledge Graphs. FoIKS 2022: 93-110 - [c27]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: 1584-1597 - [i6]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 abs/2201.08099 (2022) - [i5]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 abs/2202.12521 (2022) - 2021
- [c26]Daniel Kocher, Nikolaus Augsten, Willi Mann:
Scaling Density-Based Clustering to Large Collections of Sets. EDBT 2021: 109-120 - [i4]Iztok Savnik, Kiyoshi Nitta, Riste Skrekovski, Nikolaus Augsten:
Statistics of Knowledge Graphs Based On The Conceptual Schema. CoRR abs/2109.09391 (2021) - 2020
- [j13]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): 151 (2020) - [c25]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: 34-48 - [c24]Mateusz Pawlik, Nikolaus Augsten:
Minimal Edit-Based Diffs for Large Trees. CIKM 2020: 1225-1234 - [c23]Oksana Dolmatova, Nikolaus Augsten, Michael H. Böhlen:
Preserving Contextual Information in Relational Matrix Operations. ICDE 2020: 1894-1897 - [c22]Oksana Dolmatova, Nikolaus Augsten, Michael H. Böhlen:
A Relational Matrix Algebra and its Implementation in a Column Store. SIGMOD Conference 2020: 2573-2587 - [i3]Oksana Dolmatova, Nikolaus Augsten, Michael H. Böhlen:
A Relational Matrix Algebra and its Implementation in a Column Store. CoRR abs/2004.05517 (2020)
2010 – 2019
- 2019
- [j12]Mateusz Pawlik, Thomas Hütter, Daniel Kocher, Willi Mann, Nikolaus Augsten:
A Link is not Enough - Reproducibility of Data. Datenbank-Spektrum 19(2): 107-115 (2019) - [c21]Thomas Hütter, Mateusz Pawlik, Robert Loschinger, Nikolaus Augsten:
Effective Filters and Linear Time Verification for Tree Similarity Joins. ICDE 2019: 854-865 - [c20]Daniel Kocher, Nikolaus Augsten:
A Scalable Index for Top-k Subtree Similarity Queries. SIGMOD Conference 2019: 1624-1641 - 2018
- [j11]Fabian Fier, Nikolaus Augsten, Panagiotis Bouros, Ulf Leser, Johann-Christoph Freytag:
Set Similarity Joins on MapReduce: An Experimental Survey. Proc. VLDB Endow. 11(10): 1110-1122 (2018) - [c19]Nikolaus Augsten:
A Roadmap towards Declarative Similarity Queries. EDBT 2018: 509-512 - [e1]Nikolaus Augsten:
Proceedings of the Workshops of the EDBT/ICDT 2018 Joint Conference (EDBT/ICDT 2018), Vienna, Austria, March 26, 2018. CEUR Workshop Proceedings 2083, CEUR-WS.org 2018 [contents] - 2017
- [c18]Doris Silbernagl, Nikolaus Krismer, Nikolaus Augsten, Günther Specht:
Recommending OSM Tags To Improve Metadata Quality. LocalRec@SIGSPATIAL 2017: 6:1-6:10 - [c17]Stefan Schwarz, Mateusz Pawlik, Nikolaus Augsten:
A New Perspective on the Tree Edit Distance. SISAP 2017: 156-170 - [i2]Willi Mann, Nikolaus Augsten, Christian S. Jensen:
SWOOP: Top-k Similarity Joins over Set Streams. CoRR abs/1711.02476 (2017) - 2016
- [j10]Mateusz Pawlik, Nikolaus Augsten:
Tree edit distance: Robust and memory-efficient. Inf. Syst. 56: 157-173 (2016) - [j9]Willi Mann, Nikolaus Augsten, Panagiotis Bouros:
An Empirical Evaluation of Set Similarity Join Techniques. Proc. VLDB Endow. 9(9): 636-647 (2016) - [c16]Bezaye Tesfaye, Nikolaus Augsten:
Reachability Queries in Public Transport Networks. GvD 2016: 109-114 - 2015
- [j8]Mateusz Pawlik, Nikolaus Augsten:
Efficient Computation of the Tree Edit Distance. ACM Trans. Database Syst. 40(1): 3:1-3:40 (2015) - 2014
- [c15]Mateusz Pawlik, Nikolaus Augsten:
A Memory-Efficient Tree Edit Distance Algorithm. DEXA (1) 2014: 196-210 - [c14]Willi Mann, Nikolaus Augsten:
PEL: Position-Enhanced Length Filter for Set Similarity Joins. Grundlagen von Datenbanken 2014: 89-94 - [c13]Nikolaus Augsten, Armando Miraglia, Thomas Neumann, Alfons Kemper:
On-the-fly token similarity joins in relational databases. SIGMOD Conference 2014: 1495-1506 - 2013
- [b1]Nikolaus Augsten, Michael H. Böhlen:
Similarity Joins in Relational Database Systems. Synthesis Lectures on Data Management, Morgan & Claypool Publishers 2013, ISBN 9781627050289, pp. 1-124 - [j7]Michail Kazimianec, Nikolaus Augsten:
Clustering with Proximity Graphs: Exact and Efficient Algorithms. Int. J. Knowl. Based Organ. 3(4): 84-104 (2013) - [j6]Nikolaus Augsten, Michael H. Böhlen, Johann Gamper:
The address connector: noninvasive synchronization of hierarchical data sources. Knowl. Inf. Syst. 37(3): 639-663 (2013) - [c12]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: 339-348 - 2012
- [j5]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): 463-488 (2012) - [j4]Sven Helmer, Nikolaus Augsten, Michael H. Böhlen:
Measuring structural similarity of semistructured data based on information-theoretic approaches. VLDB J. 21(5): 677-702 (2012) - [c11]Benjamin Gufler, Nikolaus Augsten, Angelika Reiser, Alfons Kemper:
Load Balancing in MapReduce Based on Scalable Cardinality Estimates. ICDE 2012: 522-533 - [i1]Mateusz Pawlik, Nikolaus Augsten:
RTED: A Robust Algorithm for the Tree Edit Distance. CoRR abs/1201.0230 (2012) - 2011
- [j3]Mateusz Pawlik, Nikolaus Augsten:
RTED: A Robust Algorithm for the Tree Edit Distance. Proc. VLDB Endow. 5(4): 334-345 (2011) - [j2]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): 1123-1137 (2011) - [c10]Benjamin Gufler, Nikolaus Augsten, Angelika Reiser, Alfons Kemper:
Handling Data Skew in MapReduce. CLOSER 2011: 574-583 - [c9]Michail Kazimianec, Nikolaus Augsten:
PG-Skip: Proximity Graph Based Clustering of Long Strings. DASFAA (2) 2011: 31-46 - [c8]Michail Kazimianec, Nikolaus Augsten:
PG-Join: Proximity Graph Based String Similarity Joins. SSDBM 2011: 274-292 - 2010
- [j1]Nikolaus Augsten, Michael H. Böhlen, Johann Gamper:
The pq-gram distance between ordered labeled trees. ACM Trans. Database Syst. 35(1): 4:1-4:36 (2010) - [c7]Michail Kazimianec, Nikolaus Augsten:
Exact and Efficient Proximity Graph Computation. ADBIS 2010: 289-304 - [c6]Nikolaus Augsten, Denilson Barbosa, Michael H. Böhlen, Themis Palpanas:
TASM: Top-k Approximate Subtree Matching. ICDE 2010: 353-364
2000 – 2009
- 2008
- [c5]Nikolaus Augsten, Michael H. Böhlen, Curtis E. Dyreson, Johann Gamper:
Approximate Joins for Data-Centric XML. ICDE 2008: 814-823 - 2006
- [c4]Nikolaus Augsten, Michael H. Böhlen, Johann Gamper:
An Incrementally Maintainable Index for Approximate Lookups in Hierarchical Data. VLDB 2006: 247-258 - 2005
- [c3]Nikolaus Augsten, Michael H. Böhlen, Johann Gamper:
Approximate Matching of Hierarchical Data Using pq-Grams. VLDB 2005: 301-312 - 2004
- [c2]Nikolaus Augsten, Michael H. Böhlen, Johann Gamper:
Reducing the Integration of Public Administration Databases to Approximate Tree Matching. EGOV 2004: 102-107 - 2003
- [c1]Johann Gamper, Nikolaus Augsten:
The Role of Web Services in Digital Government. EGOV 2003: 161-166
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
