An Incremental Hausdorff Distance Calculation Algorithm

Summary: Incremental Hausdorff distance calculation via simultaneous index exploration of X and Y; avoids full X scan with aggregate NN search. Applies to trajectory similarity; outperforms traditional approaches by ~10x in tree traversal cost and total response time. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 10279
Venue: VLDB
Year: 2011
Pagerank: 4.9317829e-05
Overall Rank: 6,770 | 52.91%
DOI: -

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
5,508	Fast Large-Scale Trajectory Clustering	2020	VLDB	5.4713696e-05
7,021	VRE: A Versatile, Robust, and Economical Trajectory Data System	2022	VLDB	4.8581131e-05
11,379	Fast Dataset Search with Earth Mover’s Distance	2022	VLDB	4.1945683e-05

Outgoing Citations (Sorted by Pagerank)

Showing 10 of 10 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank
2	R-Trees: A Dynamic Index Structure For Spatial Searching	1984	SIGMOD	0.0032169493
6	The R*-tree: An Efficient and Robust Access Method for Points and Rectangles	1990	SIGMOD	0.0016162015
47	Nearest Neighbor Queries	1995	SIGMOD	0.0007015885
251	Robust and Fast Similarity Search for Moving Object Trajectories	2005	SIGMOD	0.00030644658
358	On The Marriage of Lp-norms and Edit Distance	2004	VLDB	0.0002599481
1,631	Incremental Distance Join Algorithms for Spatial Databases	1998	SIGMOD	0.00011078269
1,768	Closest Pair Queries in Spatial Databases	2000	SIGMOD	0.00010622873
3,255	A Revised R*-tree in Comparison with Related Index Structures	2009	SIGMOD	7.3160522e-05
5,636	GORDER: An Efficient Method for KNN Join Processing	2004	VLDB	5.3981191e-05
6,500	Adaptive Multi-Stage Distance Join Processing	2000	SIGMOD	5.0381573e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
9,308	Optimal Spatial Dominance: An Effective Search of Nearest Neighbor Candidates	2015	SIGMOD	4.3571035e-05
10,042	Accelerating High-Dimensional ANN Search via Skipping Redundant Distance Computations	2026	SIGMOD	4.1945683e-05
1,183	A Cost Model For Nearest Neighbor Search in High-Dimensional Data Space	1997	PODS	0.00013455596
12,357	The Power of Two Min-Hashes for Similarity Search among Hierarchical Data Objects	2008	PODS	4.1945683e-05
8,763	Smooth Tradeoffs between Insert and Query Complexity in Nearest Neighbor Search	2015	PODS	4.456315e-05
1,275	Continuous Nearest Neighbor Search	2002	VLDB	0.00012883899
11,477	Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering*	2021	SIGMOD	4.1945683e-05
1,776	Distributed Trajectory Similarity Search	2017	VLDB	0.00010593716
10,165	Fast-Convergent Proximity Graphs for Approximate Nearest Neighbor Search	2026	SIGMOD	4.1945683e-05
34	Similarity Search in High Dimensions via Hashing	1999	VLDB	0.00076637636