Retrieval of very large numbers of items in the Web of Science
An exercise to develop accurate search strategies
Bibliographic Data
| ID | 12623697 |
|---|---|
| Authors | Ricardo Arencibia Jorge (0000-0001-8907-2454, corresponding author), L Leydesdorff (0000-0002-7835-3098, University of Amsterdam), Zaida Chinchilla‐Rodríguez (0000-0002-1608-4478), R Rousseau (0000-0002-3252-2538), Ronald W Rousseau (0000-0002-4126-7153), Soren Warner Paris |
| Year | 2009 |
| Volume | 18 |
| Issue | 5 |
| Pages | 529-533 |
| Publication date | 2009-09-01 |
| Open Access | Yes |
| Type | ARTICLE |
| Venue | El Profesional de la Informacion (JOURNAL) |
| Journal identifiers | ISSN: 1386-6710 • E-ISSN: 1699-2407 |
| Publisher | Ediciones Profesionales de la Informacion SL (PUBLISHER) |
| DOI | 10.3145/epi.2009.sep.06 |
| OpenAlex | W2145700026 |
| Language | EN |
| Citations received | 1 |
| References cited | 2 |
The Web of Science interface counts at most 100,000 retrieved items from a single query. If the query results in a dataset containing more than 100,000 items the number of retrieved items is indicated as >100,000. The problem studied here is how to find the exact number of items in a query that leads to more than 100,000 items. One way to achieve this objective is presented. The retrieval of the entire scientific production from the United States in a specific year ( Different sections of items can be retrieved using the Source field of the database. A Boolean statement was created with the aim of eliminating overlapped sections and improving the accuracy of this search strategy
Field (mathematics · Information retrieval · Interface (matter · Search engine · Statement (logic · Web search query · Computer Science · Data Management and Algorithms · Data Mining Algorithms and Applications · Mathematics · Scientific Computing and Data Management
| Citations per year | 0.07 |
|---|---|
| Citation span | 2012 - 2012 (1) |
| Highly cited | No |