2003 Saudi-Egyptian Super Cup

2003 Saudi-Egyptian Super Cup, the 2nd and last Saudi-Egyptian Super Cup, league and cup champions from each Saudi Arabia and Egypt qualified, the four teams were drawn into two ties, In each tie, the two teams played an annual match, the leagues winners participated on President Mubarak's Cup Winners' Super Cup, the cups winners participated on King Fahd's League Winners' Super Cup.

Qualified teams
Country Placement Team
 Egypt 2002–03 Egyptian Premier League winner Zamalek
 Saudi Arabia 2002–03 Saudi Premier League winner Ittihad
 Egypt 2002–03 Egypt Cup runner-up Ismaily
 Saudi Arabia 2002–03 Saudi Crown Prince Cup winner Ittihad

Matches

King Fahd's Cup Winners' Super Cup
Ittihad 1–0 (a.e.t.) Ismaily
Idris  112'
Prince Abdullah al-Faisal Stadium
Referee: Qasim Hamzah (Kuwait)

President Mubarak's League Winners' Super Cup
Main article: 2003 Saudi-Egyptian Super Cup (President Mubarak's League Winners' Super Cup)
Zamalek 0–0 (a.e.t.) Ittihad
Penalties
El-Said
Mahmoud
Youssef
Sedik 		2–1 Al-Saqri
Al-Waked
Tukar
Idris
Al-Yami
Cairo Stadium
Attendance: 50,000
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)```
gollark: It's not a condition, it's an extra row on the output, and I can see exactly what it does via `EXPLAIN ANALYZE`.

References
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.