Faster and Better Solution to Embed Lp Metrics by Tree Metrics
Summary: ELT: faster embedding of Lp metrics into tree metrics via HSTs, using a divide-and-conquer framework achieving O(log n) distortion. Key tricks: nearest-neighbor indexing and sampling to beat O(n^2); DCsam yields faster construction and stronger empirical distortion/runtime gains vs. prior methods. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Yuxiang Zeng (Hong Kong University of Science and Technology)
- 2. Yongxin Tong (Beihang University)
- 3. Lei Chen (Hong Kong University of Science and Technology)
BibTeX Citation
@inproceedings{zeng_sigmod22,
title = {{Faster and Better Solution to Embed Lp Metrics by Tree Metrics}},
author = {Zeng, Yuxiang and Tong, Yongxin and Chen, Lei},
series = {{SIGMOD} '22},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3514221.3517831},
url = {https://dl.acm.org/doi/10.1145/3514221.3517831},
year = {2022}
}Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,376 | LiteHST: A Tree Embedding based Method for Similarity Search | 2023 | SIGMOD | 5.6298131e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 9 of 9 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.0020210012 |
| 4 | The R*-tree: An Efficient and Robust Access Method for Points and Rectangles | 1990 | SIGMOD | 0.001157935 |
| 332 | Query-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search | 2016 | VLDB | 0.00020920444 |
| 962 | DBSCAN Revisited: Mis-Claim, Un-Fixability, and Approximation | 2015 | SIGMOD | 0.00012936472 |
| 1,840 | Effectively Learning Spatial Indices | 2020 | VLDB | 9.6404567e-05 |
| 2,349 | On Efficient Spatial Matching | 2007 | VLDB | 8.7115756e-05 |
| 4,661 | Online Minimum Matching in Real-Time Spatial Data: Experiments and Analysis | 2016 | VLDB | 6.5792798e-05 |
| 6,302 | Last-Mile Delivery Made Practical: An Efficient Route Planning Framework with Theoretical Guarantees | 2020 | VLDB | 5.9213518e-05 |
| 7,084 | The Simpler The Better: An Indexing Approach for Shared-Route Planning Queries | 2020 | VLDB | 5.7074102e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 5,332 | Correlating XML Data Streams Using Tree-Edit Distance Embeddings | 2003 | PODS |
| 2 | 8,070 | Towards Metric DBSCAN: Exact, Approximate, and Streaming Algorithms | 2024 | SIGMOD |
| 3 | 303 | On The Marriage of Lp-norms and Edit Distance | 2004 | VLDB |
| 4 | 5,867 | Fast Euclidean OPTICS with Bounded Precision in Low Dimensional Space | 2018 | SIGMOD |
| 5 | 9,209 | Optimality and Scalability in Lattice Histogram Construction | 2009 | VLDB |
| 6 | 5,800 | DET-LSH: A Locality-Sensitive Hashing Scheme with Dynamic Encoding Tree for Approximate Nearest Neighbor Search | 2024 | VLDB |
| 7 | 5,847 | MapReduce and Streaming Algorithms for Diversity Maximization in Metric Spaces of Bounded Doubling Dimension | 2017 | VLDB |
| 8 | 3,047 | Similarity Evaluation on Tree-structured Data | 2005 | SIGMOD |
| 9 | 11,675 | Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering* | 2021 | SIGMOD |
| 10 | 7,376 | LiteHST: A Tree Embedding based Method for Similarity Search | 2023 | SIGMOD |