2000 Faber Grand Prix – Singles

Jana Novotná was the defending champion, but did not compete this year.

Singles
2000 Faber Grand Prix
Champion Serena Williams
Runner-up Denisa Chládková
Final score6–1, 6–1
Main article: 2000 Faber Grand Prix

Serena Williams won the title by defeating Denisa Chládková 6–1, 6–1 in the final.

Seeds

The top four seeds received a bye to the second round.

  1. Serena Williams (Champion)
  2. Nathalie Tauziat (Second round)
  3. Amélie Mauresmo (Semifinals)
  4. Elena Likhovtseva (Second round)
  5. Anke Huber (First round)
  6. Ruxandra Dragomir (Second round)
  7. Silvija Talaja (First round)
  8. Patty Schnyder (Quarterfinals)

Draw

Key

Finals
Semifinals Final
          
1 Serena Williams 6 64 77
3 Amélie Mauresmo 2 77 63
1 Serena Williams 6 6
Denisa Chládková 1 1
  Denisa Chládková 6 65 77
  Anne-Gaëlle Sidot 3 77 64

Top Half
First Round Second Round Quarterfinals Semifinals
1 S Williams 6 6
S Appelmans 6 6 S Appelmans 1 3
WC M Müller 4 2 1 S Williams 6 6
G León García 0 1 8 P Schnyder 1 4
Q S Jeyaseelan 6 6 Q S Jeyaseelan 5 4
WC R Sandu 2 61 8 P Schnyder 7 6
8 P Schnyder 6 77 1 S Williams 6 64 77
3 A Mauresmo 2 77 63
3 A Mauresmo
LL T Pisnik 77 6 LL T Pisnik d
S Farina 64 3 3 A Mauresmo 6 6
K Hrdličková 3 0 A Smashnova 2 1
A Smashnova 6 6 A Smashnova 7 6
K Habšudová 3 65 6 R Dragomir 5 2
6 R Dragomir 6 77

Bottom Half
First Round Second Round Quarterfinals Semifinals
7 S Talaja 5 3
A Kremer 7 6 A Kremer 6 6
Q M Oremans 6 6 Q M Oremans 2 4
I Spîrlea 3 3 A Kremer 2 3
D Chládková 6 3 6 D Chládková 6 6
Q A Hopmans 4 6 3 D Chládková 3 6 6
4 E Likhovtseva 6 2 3
D Chládková 6 65 77
5 A Huber 1 77 3 AG Sidot 3 77 64
K Clijsters 6 62 6 K Clijsters 77 4 4
LL A Cocheteux 2 3 AG Sidot 63 6 6
AG Sidot 6 6 AG Sidot 6 6
N Zvereva 4 3 Q K Boogert 4 2
Q K Boogert 6 6 Q K Boogert 63 7 6
2 N Tauziat 77 5 3
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`.
gollark: Maybe I need a better full text search backend?!
gollark: This is apioform.
gollark: So it works in about 30ms - perfectly okay - *without* the ts_headline, but takes about 30 seconds *with* it.

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