PHP MySQL - 十进制的 Levenshtein 替代方案
我有一个包含纬度和经度坐标的数据集（两个单独的小数列）。我需要对它们进行搜索，并根据提供的纬度/经度坐标按邻近程度对它们进行排序。
我不反对将列转换为 varchar 来执行匹配/反对搜索，但我知道匹配/反对针对单词进行了优化。
按距离对坐标进行排序的最佳方法是什么？如有必要，我可以通过 PHP 执行此操作，但我更愿意在对象层执行此操作，以减少服务器负载和加载时间。
我目前正在测试匹配/对抗方法。
总结：
给定 -90.23, 13.18 按邻近顺序返回最接近的匹配纬度/经度坐标对。
结果示例：
[1] -90.24, 13.17
[2] -90.18, 12.99
[3] -91.78, 16.98
[4] -90.27, 24.78
I have a data set with latitude and longitude coordinates (two separate decimal columns). I need to perform a search on them and order them by proximity, based on a supplied lat/lon coordinate.
I am not opposed to converting the columns to a varchar to perform a match/against search, but I know that the match/against is optimized for words.
What would be the best way to sort coordinates by distance? I can do this via PHP if necessary, though I would prefer to do it at the object layer to reduce server load and load times.
I am currently in the process of testing the match/against approach.
Sum up:
Given -90.23, 13.18 return the closest matching latitude/longitude coordinate pairs in order of proximity.
Sample result:
[1] -90.24, 13.17
[2] -90.18, 12.99
[3] -91.78, 16.98
[4] -90.27, 24.78
如果你对这篇内容有疑问，欢迎到本站社区发帖提问 参与讨论，获取更多帮助，或者扫码二维码加入 Web 技术交流群。
绑定邮箱获取回复消息
由于您还没有绑定你的真实邮箱，如果其他用户或者作者回复了您的评论，将不能在第一时间通知您！
发布评论
评论（1）
有多种方法可以计算点集之间的地理距离。有些准确，有些则快速。您选择哪种方法完全取决于您的要求。由于 Stack Overflow 上有很多已回答的问题，都有具体的答案：
https://stackoverflow.com/search ?tab=votes&q=distance%20mysql
There are numerous methods to calculate geographic distance between sets of points. Some are accurate where others are fast. Which method you choose is all depends on your requirements. As there are many answered questions here at Stack Overflow which have specific answers:
https://stackoverflow.com/search?tab=votes&q=distance%20mysql