EARTH AND SPACE INDEX
Fielded Search

A bibliographic database of AGU publications from 1988 to present
The Basics | Search Guidelines | Basic Search

  Earth and Space Index - Fielded Search


  Enter Query Term(s) and Select Field(s) to Search
   
  In

   
  In

  
  In

  Maximum  Results

  Display Format: HTML Refer

     


The Basics


EASI Help - Search Guidelines

Contents:

Introduction

Earth and Space Index (EASI) contains citations with index terms for all journal articles, books, and other documents published by AGU. Coverage is from 1988 to present, a total of over 70,000 records. Searches can be entered as natural language or Boolean expressions.

Prior to 1997, EASI has been distributed on diskette together with a bibliographic search application called EndNote from Niles and Associates. EASI Monthly Updates are also disseminated via e-mail for current awareness. These services offer certain advantages beyond just the searchable data, such as the capacity to import sets of references directly into an article in a wordprocessor, and to automatically format those references according to a range of journal-specific "styles". There were some restrictions, however, such as the finite size of the EndNote "library", the maximum number of records that can be searched as a unit, and also the lack of a Unix version.

As a part of its continuing plan to develop and improve electronic information services to scientists and members, AGU has now decided to offer the full EASI database via the World Wide Web. Future plans include extending the service to incorporate abstracts submitted electronically by authors, direct ordering of full-text articles via a variety of media (mail, fax, download, etc.), as well as direct linking to the full-text of online articles that are published electronically. EASI will thus serve not only as the AGU bibliographic database but also as the access route to a suite of online products and services that collectively comprise the electronic AGU repository.

This EASI Help document is a brief guide to searching the EASI database using the WAIS (freeWAIS-sf) search server and Z39.50 WWW gateway (SFgate). While EASI can be searched simply and effectively by just entering search terms into the text box and pressing "Submit Query", familiarizing oneself with these help pages can lead to more accurate and more comprehensive search results.

Basic EASI Search

The Basic Search screen has a single box for entering search term(s) or phrase(s), and choosing an operator (AND, OR, or NOT) if necessary, to combine search terms, while the Fielded Search screen supports the combination of several terms or concepts into a single query.

To search EASI without deliberating over special features, simply enter one or more query terms into the first text box, following the on-screen instructions (The Basics), select the maximum number of hits you want to be returned, and press the Submit Query button. The basic query can consist of one or more targetted keywords, or it can be entered as natural language. Documents in the database matching the query are returned in a results page, where you can review the titles and select records to be displayed in full.

Natural Language

The WAIS server can be queried using natural language questions such as "Tell me about tsunamis in the Pacific Ocean in 1996". The search engine takes the words and phrases in the question and finds matching documents, i.e. ones that include the specified words and phrases. (In this example, the server will search for documents containing the words "tsunamis", "Pacific", "Ocean" and "1996"; the other words are called "stop words" and are not used for searching a document).

Locating Words with the Same Root

Place an asterisk at the end of a query term to search for occurrences of words that begin with the same root, also known as "right truncation", or "wildcards". For example, tecton* will find all terms that begin with the letters tecton, such as tectonic, tectonics, tectonophysics, tectonogenesis, etc. This technique is important when the user wants to retrieve as many relevant items as possible, i.e. does not want to miss any relevant items.

Stemming in a field means that every word is reduced to its word-stem, before it is added to the index. This way 'computer', 'computing' and 'computers' are treated identically. Stemming is handled automatically by the server.

Fielded Search

The Fielded Search screen supports the combination of several terms or concepts into a single search:
  • Enter search term(s) in the first box
  • Select the appropriate field (Title, Author, ...)
  • To combine the search with other terms, select the appropriate Boolean operator -- AND (to narrow the search by combining with other criteria) OR (to broaden the search) or NOT (to exclude references)
  • Advanced Searching

    Users can construct more sophisticated search queries in either form (Basic or Fielded) using a combination of search parameters including phrases, truncation, field names, nesting within parentheses, controlled vocabulary, authority lists, and Boolean operators. Entering a query using these parameters in an advanced search requires the following syntax.

    Query Syntax

    The standard query specifies the terms to search, the fields to search in, and the Boolean operators to apply, using the following syntax:

    field=term operator field=term ...(etc)
    where

    field is the two-letter field code, e.g. ti=Atlantic; au=Potter; yr=1990. The default is ALL FIELDS, i.e. if no field code is specified before a term.

    term is the term (or phrase) to be searched on. All occurrences of terms that begin with a given text string can be searched by truncation (appending an * at the end of the string), e.g. kw=atmos* will retrieve all occurrences that begin with "atmos", such as "atmosphere", "atmospheric" etc.

    operator is one of

    Examples:

    au=Smith AND ti=Mars
    ti=moon OR ti=lunar
    kw=dust NOT kw=volcan*
    Southern ADJ Oscillation

    Entering Query Term(s)

    Complex searches can be entered as a single query in a text box, using Boolean operators, field codes, nesting, truncation, and so on. As a general rule of thumb, be specific by using query terms at the desired level of detail: for broad searches, use more general terms; for more specific searches, use narrower terms.

    Boolean Operators AND, OR, NOT and ADJ

    Boolean operators are mathematical operators based on set theory, and they provide a powerful mechanism for specifying exact relationships between words, literal phrases, and field specifications in a search query.

    Note the following guidelines regarding the Boolean operators AND, OR, NOT and ADJ: