FIL European Luge Championships 1994
The FIL European Luge Championships 1994 took place in Königssee, Germany for a record sixth time after hosting the event previously in 1967, 1972, 1973, 1977, and 1988.
Men's singles
Medal | Athlete | Time |
---|---|---|
Gold | ![]() |
|
Silver | ![]() |
|
Bronze | ![]() |
Women's singles
Medal | Athlete | Time |
---|---|---|
Gold | ![]() |
|
Silver | ![]() |
|
Bronze | ![]() |
Men's doubles
Medal | Athlete | Time |
---|---|---|
Gold | ![]() |
|
Silver | ![]() |
|
Bronze | ![]() |
Mixed team
Medal | Athlete | Time |
---|---|---|
Gold | ![]() |
|
Silver | ![]() |
|
Bronze | ![]() |
Medal table
Rank | Nation | Gold | Silver | Bronze | Total |
---|---|---|---|---|---|
1 | ![]() | 3 | 1 | 1 | 5 |
2 | ![]() | 1 | 0 | 1 | 2 |
3 | ![]() | 0 | 3 | 2 | 5 |
Totals (3 nations) | 4 | 4 | 4 | 12 |
gollark: I mean, postgres has very good caching, so it gets fairly fast if I search for bees multiple times, but whyyyy?
gollark: Yes.
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.
References
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.