| DeSignate: detecting signature characters in gene sequence alignments for taxon diagnoses. | 0 | 0.34 | 2020 |
| Minimal Edit-Based Diffs for Large Trees | 1 | 0.35 | 2020 |
| A Relational Matrix Algebra and its Implementation in a Column Store | 0 | 0.34 | 2020 |
| An Efficient Index for Reachability Queries in Public Transport Networks. | 0 | 0.34 | 2020 |
| Preserving Contextual Information In Relational Matrix Operations | 0 | 0.34 | 2020 |
| Effective Filters and Linear Time Verification for Tree Similarity Joins | 0 | 0.34 | 2019 |
| A Link is not Enough - Reproducibility of Data. | 0 | 0.34 | 2019 |
| A Scalable Index for Top-k Subtree Similarity Queries | 0 | 0.34 | 2019 |
| Set Similarity Joins on MapReduce: An Experimental Survey. | 0 | 0.34 | 2018 |
| Set similarity joins on mapreduce: an experimental survey | 2 | 0.36 | 2018 |
| A Roadmap towards Declarative Similarity Queries. | 0 | 0.34 | 2018 |
| SWOOP: Top-k Similarity Joins over Set Streams. | 0 | 0.34 | 2017 |
| Recommending OSM Tags To Improve Metadata Quality | 1 | 0.36 | 2017 |
| An Empirical Evaluation of Set Similarity Join Techniques. | 19 | 0.62 | 2016 |
| An Empirical Evaluation of Set Similarity Join Techniques. | 0 | 0.34 | 2016 |
| Reachability Queries in Public Transport Networks. | 0 | 0.34 | 2016 |
| Tree edit distance: Robust and memory-efficient. | 0 | 0.34 | 2016 |
| Efficient Computation of the Tree Edit Distance | 16 | 0.71 | 2015 |
| A Memory-Efficient Tree Edit Distance Algorithm. | 2 | 0.37 | 2014 |
| On-the-fly token similarity joins in relational databases | 5 | 0.43 | 2014 |
| PEL: Position-Enhanced Length Filter for Set Similarity Joins. | 6 | 0.44 | 2014 |
| The address connector: noninvasive synchronization of hierarchical data sources. | 1 | 0.35 | 2013 |
| RWS-Diff: flexible and efficient change detection in hierarchical data | 6 | 0.43 | 2013 |
| Clustering with Proximity Graphs: Exact and Efficient Algorithms | 0 | 0.34 | 2013 |
| RTED: A Robust Algorithm for the Tree Edit Distance. | 0 | 0.34 | 2012 |
| RTED: a robust algorithm for the tree edit distance | 44 | 1.28 | 2012 |
| Measuring structural similarity of semistructured data based on information-theoretic approaches | 7 | 0.44 | 2012 |
| Load Balancing in MapReduce Based on Scalable Cardinality Estimates | 65 | 1.96 | 2012 |
| Windowed pq-grams for approximate joins of data-centric XML | 10 | 0.47 | 2012 |
| Efficient Top-k Approximate Subtree Matching in Small Memory | 7 | 0.47 | 2011 |
| PG-join: proximity graph based string similarity joins | 0 | 0.34 | 2011 |
| Handling Data Skew in MapReduce. | 0 | 0.34 | 2011 |
| PG-Skip: proximity graph based clustering of long strings | 3 | 0.38 | 2011 |
| TASM: Top-k Approximate Subtree Matching | 17 | 0.74 | 2010 |
| The pq-gram distance between ordered labeled trees | 49 | 1.59 | 2010 |
| Exact and efficient proximity graph computation | 2 | 0.38 | 2010 |
| Approximate Joins for Data-Centric XML | 23 | 0.82 | 2008 |
| An incrementally maintainable index for approximate lookups in hierarchical data | 8 | 0.56 | 2006 |
| Approximate matching of hierarchical data using pq-grams | 48 | 1.33 | 2005 |
| Reducing the Integration of Public Administration Databases to Approximate Tree Matching | 4 | 0.43 | 2004 |
| The Role of Web Services in Digital Government | 11 | 0.64 | 2003 |
