title: performance searching using a map or a slice
body: <p>I have a struct called Users </p>
  
  <pre><code>type Users struct {
      name string
      job  string
  }
  </code></pre>
  
  <p>Search function </p>
  
  <pre><code>func search() (users []Users, err error) {
  
      users = make([]Users, 0)
      rows, _ := mysql.Query("select name,job from users")
  
      for rows.Next() {
          var user Users
          rows.Scan(&amp;user.Name, &amp;user.Job)
          users = append(users, user)
      }
      return
  }
  </code></pre>
  
  <p>As you may notice I am working with slice  but due to the huge number of result that I have to handle I must work on performance, I have heard that the map are more faster in term of performance but I don't know if my example is included?
  If it's the case could you please suggest me via my code who to write a map array and try to append for each line of the query result.</p>