HC Svilengrad
Handball Klub Svilengrad is a women's handball club from Svilengrad in Bulgaria. HC Svilengrad competes in the GHR A.
HC Svilengrad | |
---|---|
Full name | Handball Klub Svilengrad |
Founded | 2014 |
Head coach | Pavel Dzhenev |
League | GHR A |
2015-2016 | 2nd |
Website Official site |
European record
Season | Competition | Round | Club | Home | Away | Aggregate |
---|---|---|---|---|---|---|
2016–17 | Challenge Cup | R3 | ![]() |
17–24 | 22–29 | 39–53 |
Team
Current squad
- Squad for the 2016–17 season
|
|
gollark: Something is very O(n) here and I have about 300 search results for bee.
gollark: Site-3371.
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)```
External links
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.