2010 Italian Open – Men's Doubles

Daniel Nestor and Nenad Zimonjić were the defending champions, but lost in the second round to Pablo Cuevas and Juan Mónaco.
Bob Bryan and Mike Bryan defeated their compatriots John Isner and Sam Querrey in the final. They won 6–2, 6–3.

Men's Doubles
2010 Italian Open
Champions Bob Bryan
Mike Bryan
Runners-up John Isner
Sam Querrey
Final score6–2, 6–3
Main article: 2010 Italian Open (tennis)

Seeds

All seeds receive a bye into the second round.

  1. Daniel Nestor / Nenad Zimonjić (Second Round)
  2. Bob Bryan / Mike Bryan (Champions)
  3. Lukáš Dlouhý / Leander Paes (Quarterfinals)
  4. Mahesh Bhupathi / Max Mirnyi (Second Round)
  5. Wesley Moodie / Dick Norman (Second Round)
  6. Simon Aspelin / Paul Hanley (Second Round)
  7. Łukasz Kubot / Oliver Marach (Semifinals)
  8. Mark Knowles / Bruno Soares (Second Round)

Draw

Key

Finals
Semifinals Final
          
  Pablo Cuevas
Juan Mónaco 		65 62  
  John Isner
Sam Querrey 		7 7  
  John Isner
Sam Querrey 		2 3  
2 Bob Bryan
Mike Bryan 		6 6  
7 Łukasz Kubot
Oliver Marach 		1 2  
2 Bob Bryan
Mike Bryan 		6 6  

Top Half
First Round Second Round Quarterfinals Semifinals
1 D Nestor
N Zimonjić 		2 64  
  P Cuevas
J Mónaco 		3 7 [10]   P Cuevas
J Mónaco 		6 7  
  J Benneteau
J Chardy 		6 5 [8]   P Cuevas
J Mónaco 		6 6  
  I Andreev
M Youzhny 		4 2   WC S Bolelli
P Starace 		4 4  
WC S Bolelli
P Starace 		6 6   WC S Bolelli
P Starace 		6 63 [10]
8 M Knowles
B Soares 		3 7 [3]
  P Cuevas
J Mónaco 		65 62  
  J Isner
S Querrey 		7 7  
4 M Bhupathi
M Mirnyi 		2 7 [6]
  J Isner
S Querrey 		4 6 [10]   J Isner
S Querrey 		6 65 [10]
  J-W Tsonga
S Wawrinka 		6 2 [7]   J Isner
S Querrey 		6 6  
WC Y Allegro
R Federer 		6 7   WC Y Allegro
R Federer 		4 4  
  J Brunström
J-J Rojer 		4 64   WC Y Allegro
R Federer 		4 6 [10]
6 S Aspelin
P Hanley 		6 3 [8]

Bottom Half
First Round Second Round Quarterfinals Semifinals
7 Ł Kubot
O Marach 		6 6  
ALT J Tipsarević
V Troicki 		6 6   ALT J Tipsarević
V Troicki 		4 0  
  M Fyrstenberg
M Matkowski 		3 3   7 Ł Kubot
O Marach 		6 6  
  I Ljubičić
M Llodra 		6 6   3 L Dlouhý
L Paes 		3 4  
  J Knowle
A Ram 		4 3     I Ljubičić
M Llodra 		     
3 L Dlouhý
L Paes 		w/o    
7 Ł Kubot
O Marach 		1 2  
2 B Bryan
M Bryan 		6 6  
5 W Moodie
D Norman 		1 6 [8]
  F López
F Verdasco 		2 63     N Almagro
M Granollers 		6 3 [10]
  N Almagro
M Granollers 		6 7     N Almagro
M Granollers 		3 6 [6]
  J Kerr
F Polášek 		2 3   2 B Bryan
M Bryan 		6 3 [10]
  F Čermák
M Mertiňák 		6 6     F Čermák
M Mertiňák 		4 1  
2 B Bryan
M Bryan 		6 6  
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)```

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