The Quest of the Missing Map
The Quest of the Missing Map is the nineteenth volume in the Nancy Drew Mystery Stories series. It was first published in 1942 under the pseudonym Carolyn Keene.[1] The actual author was ghostwriter Mildred Wirt Benson.
![]() Original edition cover | |
Author | Carolyn Keene |
---|---|
Cover artist | Russell H. Tandy |
Country | United States |
Language | English |
Series | Nancy Drew Mystery Stories |
Genre | Juvenile literature |
Published | 1942 Grosset & Dunlap |
Media type | Print (Hardback & Paperback) |
ISBN | 0-448-09519-X |
OCLC | 38463003 |
Preceded by | The Mystery at the Moss-Covered Mansion |
Followed by | The Clue in the Jewel Box |
Plot summary
Nancy investigates a small ship cottage at the Chatham estate and discovers a connection between the mysterious occurrences at the cottage and an island where a lost treasure is said to be buried. With one half of a map, Nancy sets out to find a missing twin brother who holds the other half. The mystery becomes dangerous when an assailant hears about the treasure and is determined to push Nancy off the trail. Can she endure this and other grave dangers, and recover in time to solve the mystery?
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)```
gollark: What? Why does it say it's doing a sequential scan now? Æ all is bee.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.