Lying ahull

In sailing, lying ahull is a controversial method of weathering a storm, executed by downing all sails, battening the hatches and locking the tiller to leeward so the boat tries to point to windward but this is balanced by the force of wind and waves. A sea anchor is not used, allowing the boat to drift freely, completely at the mercy of the storm. Ideally the boat should rest with the wind just forward of the beam so the boat is not broadside onto the waves. Modern boats with fin keels may have too much windage at the bows for this technique and come to rest broadside on or may not be stable at all.

Sources
gollark: ```sqlnonlocality=# EXPLAIN ANALYZE SELECT url, ts_rank(fts, query) AS rank, ts_headline(fts::text, query, 'MaxWords=60') FROM pages, websearch_to_tsquery('bee') query WHERE fts @@ query ORDER BY rank LIMIT 1; QUERY PLAN -------------------------------------------------------------------------------------------------------------------------------------------------- Limit (cost=860.79..861.06 rows=1 width=96) (actual time=35935.590..35935.594 rows=1 loops=1) -> Result (cost=860.79..874.83 rows=52 width=96) (actual time=35935.587..35935.589 rows=1 loops=1) -> Sort (cost=860.79..860.92 rows=52 width=178) (actual time=35934.109..35934.111 rows=1 loops=1) Sort Key: (ts_rank(pages.fts, query.query)) Sort Method: top-N heapsort Memory: 25kB -> Nested Loop (cost=0.25..860.53 rows=52 width=178) (actual time=444.148..35932.932 rows=349 loops=1) Join Filter: (pages.fts @@ query.query) Rows Removed by Join Filter: 10272 -> Function Scan on websearch_to_tsquery query (cost=0.25..0.26 rows=1 width=32) (actual time=0.038..0.041 rows=1 loops=1) -> Seq Scan on pages (cost=0.00..728.95 rows=10495 width=142) (actual time=10.189..289.581 rows=10621 loops=1) Planning Time: 0.184 ms Execution Time: 35935.637 ms(12 rows)```
gollark: What? Why does it say it's doing a sequential scan now? Æ all is bee.
gollark: Slower, even.
gollark: Oops, it turns out I'm accidentally sorting by it instead of the rank, but it's equally slow after fixing that.
gollark: ```nonlocality=# EXPLAIN ANALYZE SELECT url, ts_rank(fts, query), ts_headline(fts::text, query, 'MaxWords=60') AS rank FROM pages, websearch_to_tsquery('bee') query WHERE fts @@ query ORDER BY rank LIMIT 1; QUERY PLAN ------------------------------------------------------------------------------------------------------------------------------------------------- Limit (cost=860.92..860.92 rows=1 width=96) (actual time=8506.425..8506.427 rows=1 loops=1) -> Sort (cost=860.92..861.05 rows=52 width=96) (actual time=8506.423..8506.425 rows=1 loops=1) Sort Key: (ts_headline((pages.fts)::text, query.query, 'MaxWords=60'::text)) Sort Method: top-N heapsort Memory: 25kB -> Nested Loop (cost=688.65..860.66 rows=52 width=96) (actual time=1.362..8505.403 rows=348 loops=1) -> Function Scan on websearch_to_tsquery query (cost=0.25..0.26 rows=1 width=32) (actual time=0.023..0.025 rows=1 loops=1) -> Bitmap Heap Scan on pages (cost=688.40..846.49 rows=52 width=142) (actual time=0.353..1.502 rows=348 loops=1) Recheck Cond: (fts @@ query.query) Heap Blocks: exact=231 -> Bitmap Index Scan on page_search_index (cost=0.00..688.39 rows=52 width=0) (actual time=0.320..0.320 rows=387 loops=1) Index Cond: (fts @@ query.query) Planning Time: 0.190 ms Execution Time: 8506.463 ms(13 rows)```
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.