Nikolaus Augsten

Proceedings of the 24th International Conference on Extending Database Technology, 2021

2020

DeSignate: detecting signature characters in gene sequence alignments for taxon diagnoses.

[BibT_eX]

[DOI]

BMC Bioinform., 2020

A Relational Matrix Algebra and its Implementation in a Column Store.

[BibT_eX]

[DOI]

Oksana Dolmatova

Proceedings of the 2020 International Conference on Management of Data, 2020

Preserving Contextual Information in Relational Matrix Operations.

[BibT_eX]

[DOI]

Oksana Dolmatova

Proceedings of the 36th IEEE International Conference on Data Engineering, 2020

Minimal Edit-Based Diffs for Large Trees.

[BibT_eX]

[DOI]

Proceedings of the CIKM '20: The 29th ACM International Conference on Information and Knowledge Management, 2020

An Efficient Index for Reachability Queries in Public Transport Networks.

[BibT_eX]

[DOI]

Proceedings of the Advances in Databases and Information Systems, 2020

2019

A Link is not Enough - Reproducibility of Data.

[BibT_eX]

[DOI]

Datenbank-Spektrum, 2019

A Scalable Index for Top-k Subtree Similarity Queries.

[BibT_eX]

[DOI]

Daniel Kocher

Proceedings of the 2019 International Conference on Management of Data, 2019

Effective Filters and Linear Time Verification for Tree Similarity Joins.

[BibT_eX]

[DOI]

Proceedings of the 35th IEEE International Conference on Data Engineering, 2019

2018

Set Similarity Joins on MapReduce: An Experimental Survey.

[BibT_eX]

[DOI]

Johann-Christoph Freytag

Proc. VLDB Endow., 2018

A Roadmap towards Declarative Similarity Queries.

[BibT_eX]

[DOI]

Proceedings of the 21st International Conference on Extending Database Technology, 2018

2017

SWOOP: Top-k Similarity Joins over Set Streams.

[BibT_eX]

[DOI]

Christian S. Jensen

CoRR, 2017

A New Perspective on the Tree Edit Distance.

[BibT_eX]

[DOI]

Stefan Schwarz

Proceedings of the Similarity Search and Applications - 10th International Conference, 2017

Recommending OSM Tags To Improve Metadata Quality.

[BibT_eX]

[DOI]

Proceedings of the 1st ACM SIGSPATIAL Workshop on Recommendations for Location-based Services and Social Networks, 2017

2016

An Empirical Evaluation of Set Similarity Join Techniques.

[BibT_eX]

[DOI]

Panagiotis Bouros

Proc. VLDB Endow., 2016

Tree edit distance: Robust and memory-efficient.

[BibT_eX]

[DOI]

Inf. Syst., 2016

Reachability Queries in Public Transport Networks.

[BibT_eX]

[DOI]

Bezaye Tesfaye

Proceedings of the 28th GI-Workshop Grundlagen von Datenbanken, Nörten Hardenberg, 2016

2015

Efficient Computation of the Tree Edit Distance.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 2015

2014

On-the-fly token similarity joins in relational databases.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Management of Data, 2014

PEL: Position-Enhanced Length Filter for Set Similarity Joins.

[BibT_eX]

[DOI]

Proceedings of the 26th GI-Workshop Grundlagen von Datenbanken, 2014

A Memory-Efficient Tree Edit Distance Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Database and Expert Systems Applications, 2014

2013

Similarity Joins in Relational Database Systems

[BibT_eX]

[DOI]

Synthesis Lectures on Data Management, Morgan & Claypool Publishers, ISBN: 978-3-031-01851-0, 2013

The address connector: noninvasive synchronization of hierarchical data sources.

[BibT_eX]

[DOI]

Knowl. Inf. Syst., 2013

Clustering with Proximity Graphs: Exact and Efficient Algorithms.

[BibT_eX]

[DOI]

Int. J. Knowl. Based Organ., 2013

RWS-Diff: flexible and efficient change detection in hierarchical data.

[BibT_eX]

[DOI]

Proceedings of the 22nd ACM International Conference on Information and Knowledge Management, 2013

2012

Measuring structural similarity of semistructured data based on information-theoretic approaches.

[BibT_eX]

[DOI]

Sven Helmer

VLDB J., 2012

Windowed pq-grams for approximate joins of data-centric XML.

[BibT_eX]

[DOI]

VLDB J., 2012

Load Balancing in MapReduce Based on Scalable Cardinality Estimates.

[BibT_eX]

[DOI]

Proceedings of the IEEE 28th International Conference on Data Engineering (ICDE 2012), 2012

2011

Efficient Top-k Approximate Subtree Matching in Small Memory.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2011

RTED: A Robust Algorithm for the Tree Edit Distance.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2011

PG-Join: Proximity Graph Based String Similarity Joins.

[BibT_eX]

[DOI]

Proceedings of the Scientific and Statistical Database Management, 2011

PG-Skip: Proximity Graph Based Clustering of Long Strings.

[BibT_eX]

[DOI]

Proceedings of the Database Systems for Advanced Applications, 2011

Handling Data Skew in MapReduce.

[BibT_eX]

Proceedings of the CLOSER 2011, 2011

2010

The <i>pq</i>-gram distance between ordered labeled trees.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 2010

TASM: Top-k Approximate Subtree Matching.

[BibT_eX]

[DOI]

Proceedings of the 26th International Conference on Data Engineering, 2010

Exact and Efficient Proximity Graph Computation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Databases and Information Systems, 2010

2008

Approximate Joins for Data-Centric XML.

[BibT_eX]

[DOI]

Proceedings of the 24th International Conference on Data Engineering, 2008

2006

An Incrementally Maintainable Index for Approximate Lookups in Hierarchical Data.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Conference on Very Large Data Bases, 2006

2005

Approximate Matching of Hierarchical Data Using pq-Grams.

[BibT_eX]

[DOI]

Proceedings of the 31st International Conference on Very Large Data Bases, Trondheim, Norway, August 30, 2005

2004

Reducing the Integration of Public Administration Databases to Approximate Tree Matching.

[BibT_eX]

[DOI]

Proceedings of the Electronic Government: Third International Conference, 2004

2003

The Role of Web Services in Digital Government.

[BibT_eX]

[DOI]