Dynamic enumeration of similarity joins

DOI10.4230/LIPICS.ICALP.2021.11MaRDI QIDQ7241107zbMATH OpenFDO

Authors Pankaj K. Agarwal, Xiao Hu, Stavros Sintos, Jun Yang

Publication date 12 May 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2021.11

zbMATH Keywords

dynamic enumerationsimilarity joinsworst-case delay guarantee

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cites work

• Algorithms and Computation
• Applications of range query theory to relational data base join and selection operations
• Approximate nearest neighbor: towards removing the curse of dimensionality
• Computational geometry. Algorithms and applications.
• Counting Triangles under Updates in Worst-Case Optimal Time
• Efficient partition trees
• Fast Construction of Nets in Low-Dimensional Metrics and Their Applications
• Geometric approximation algorithms
• scientific article; zbMATH DE number 1241835 (Why is no real title available?)
• scientific article; zbMATH DE number 1775450 (Why is no real title available?)
• Improved pointer machine and I/O lower bounds for simplex range reporting and related problems
• Locality-sensitive hashing scheme based on p-stable distributions
• On Acyclic Conjunctive Queries and Constant Delay Enumeration
• Optimal partition trees
• Polygon Retrieval
• Reporting neighbors in high-dimensional Euclidean space
• SEQUENTIAL AND PARALLEL ALGORITHMS FOR THE k CLOSEST PAIRS PROBLEM
• Simplex range reporting on a pointer machine
• Simplex Range Searching and Its Variants: A Review
• Solving similarity joins and range queries in metric spaces with the list of twin clusters
• Worst-case optimal insertion and deletion methods for decomposable searching problems

This page was built for publication: Dynamic enumeration of similarity joins

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7241107)