So, 418749.73 is the OPTIMIZER cost to beat, and it took two and a half seconds (2555.673) to execute that query. (actual time=0.040.1637.884 rows=3982382 loops=3)Īnd here are the results: (the same results for all requests, so we’ll omit them later.) name > Parallel Seq Scan on geonames ( cost=66.71 rows=4977977 width=38) Worker 1: Sort Method: top-N heapsort Memory: 25kB Worker 0: Sort Method: top-N heapsort Memory: 26kB PostgreSQL provides a simple linear distance operator the data, and performing no optimizations and having no indexes, we see the following execution plan: time psql -qtAc " EXPLAIN ( ANALYZE ON, BUFFERS ON) We will use this to find points that are closest to a given location. PostgreSQL provides a simple linear distance operator (linear distance).
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |