Fast and Flexible Tree Edit Distance

Filter
Conference contribution

Search results

  • 2020

    Minimal Edit-Based Diffs for Large Trees

    Pawlik, M. & Augsten, N., 2020, Proceedings of the ACM International Conference on Information and Knowledge Management. p. 1225-1234

    Research output: Chapter in Book/Report/Conference proceeding/Legal commentary › Conference contribution › peer-review

    Open Access
  • 2019

    A Scalable Index for Top-k Subtree Similarity Queries

    Kocher, D. & Augsten, N., 2019, SIGMOD 2019 - Proceedings of the 2019 International Conference on Management of Data. p. 1624-1641 18 p. (Proceedings of the ACM SIGMOD International Conference on Management of Data).

    Research output: Chapter in Book/Report/Conference proceeding/Legal commentary › Conference contribution › peer-review

  • 2018

    A roadmap towards declarative similarity queries

    Augsten, N., 1 Jan 2018, Advances in Database Technology - EDBT 2018: 21st International Conference on Extending Database Technology, Proceedings. Bohlen, M., Pichler, R., May, N., Rahm, E., Wu, S.-H. & Hose, K. (eds.). OpenProceedings.org, p. 509-512 4 p. (Advances in Database Technology - EDBT; vol. 2018-March).

    Research output: Chapter in Book/Report/Conference proceeding/Legal commentary › Conference contribution › peer-review

    Open Access
  • 2017

    A New Perspective on the Tree Edit Distance

    Schwarz, S., Pawlik, M. & Augsten, N., 2017, Similarity Search and Applications. p. 156-170 (Lecture Notes in Computer Science).

    Research output: Chapter in Book/Report/Conference proceeding/Legal commentary › Conference contribution › peer-review

    Open Access