ACDelco Radiators & Heating Components Best Books of the Month Shop Men's Watches Cloud Drive Photos nav_sap_SWP_6M_fly_beacon $5 Albums belkin All-New Fire TV Stick with Voice Remote Subscribe & Save Introducing Handmade Find the Best Purina Pro Plan for Your Pet Amazon Gift Card Offer wdftv wdftv wdftv  Amazon Echo Starting at $49.99 Kindle Voyage Nintendo Digital Games Shop Now Learn more

Enter your mobile number or email address below and we'll send you a link to download the free Kindle App. Then you can start reading Kindle books on your smartphone, tablet, or computer - no Kindle device required.

  • Apple
  • Android
  • Windows Phone
  • Android

To get the free app, enter your email address or mobile phone number.

Information Retrieval: Data Structures and Algorithms 1st Edition

4 customer reviews
ISBN-13: 007-6092032151
ISBN-10: 0134638379
Why is ISBN important?
This bar-code number lets you verify that you're getting exactly the right version or edition of a book. The 13-digit and 10-digit formats both work.
Scan an ISBN with your phone
Use the Amazon App to scan ISBNs and compare prices.
Have one to sell? Sell on Amazon
Buy used
Buy new
More Buying Choices
19 New from $14.95 27 Used from $0.40
Free Two-Day Shipping for College Students with Amazon Student Free%20Two-Day%20Shipping%20for%20College%20Students%20with%20Amazon%20Student

Save Up to 90% on Textbooks Textbooks
$80.00 FREE Shipping. Only 1 left in stock (more on the way). Ships from and sold by Gift-wrap available.

Editorial Reviews

From the Publisher

An edited volume containing data structures and algorithms for information retrieved including a disk with examples written in C. For programmers and students interested in parsing text, automated indexing, its the first collection in book form of the basic data structures and algorithms that are critical to the storage and retrieval of documents.

From the Back Cover

Information retrieval is a sub-field of computer science that deals with the automated storage and retrieval of documents. Providing the latest information retrieval techniques, this guide discusses Information Retrieval data structures and algorithms, including implementations in C. Aimed at software engineers building systems with book processing components, it provides a descriptive and evaluative explanation of storage and retrieval systems, file structures, term and query operations, document operations and hardware. Contains techniques for handling inverted files, signature files, and file organizations for optical disks. Discusses such operations as lexical analysis and stoplists, stemming algorithms, thesaurus construction, and relevance feedback and other query modification techniques. Provides information on Boolean operations, hashing algorithms, ranking algorithms and clustering algorithms. In addition to being of interest to software engineering professionals, this book will be useful to information science and library science professionals who are interested in text retrieval technology.


Best Books of the Month
Best Books of the Month
Want to know our Editors' picks for the best books of the month? Browse Best Books of the Month, featuring our favorite new books in more than a dozen categories.

Product Details

  • Paperback: 464 pages
  • Publisher: Prentice Hall; 1 edition (June 22, 1992)
  • Language: English
  • ISBN-10: 0134638379
  • ISBN-13: 978-0134638379
  • Product Dimensions: 6.9 x 1.3 x 9 inches
  • Shipping Weight: 1.9 pounds (View shipping rates and policies)
  • Average Customer Review: 4.0 out of 5 stars  See all reviews (4 customer reviews)
  • Amazon Best Sellers Rank: #2,257,244 in Books (See Top 100 in Books)

Customer Reviews

Most Helpful Customer Reviews

20 of 22 people found the following review helpful By Bob Carpenter on December 7, 2001
Format: Paperback
Rather than a coherent textbook about information retrieval, this book contains 18 papers by individual authors which vary wildly in depth, quality and relevance today. The basic issues are covered each with their own chapters: inverted files, vector comparison techniques, stoplists, stemming, tehsauri, string searching, relevance feedback, boolean operations, ranking, clustering and hashing.
The introduction covers hashing and automata for string matching in detail, but doesn't mention vector-based techniques other than Hamming distance (!) and in one paragraph provides the only mention of edit distance (aka Levenstein distance) in the book. The chapter on PAT trees and the one on optical disks seem out of place due to their depth and obscurity. On the other hand, there's no mention of caching anywhere. The chapter on lexical analysis and stoplists by Fox has a nice introduction, but then devolves into page after page of C code. Ditto for Frakes' chapter on stemming -- good introduction, but we didn't need ten pages of code. Same for the thesaurus chapter -- a few pages of introduction, and then 40+ pages of code for some kind of hierarchical clustering. Baeza-Yates' chapter on string searching covers Knuth-Morris-Pratt and Boyer-Moore briefly and even contains some interesting empirical data, but again, we didn't really need the C code. Harman's chapter on relevance feedback (query modification) stands out as being entirely sensible, high level and informative, but is a decade behind the times. The chapter on boolean operations provides a few pages of info and then mysteriously spends 10 pages on bit vector code and then another handful on hashing. Then the following chapter on hashing has 40 pages of C code for perfect hashing!
Read more ›
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse
11 of 11 people found the following review helpful By Giorgio Brajnik on December 16, 1998
Format: Paperback
I adopted this book as the primary textbook for my course on information retrieval. It covers a substantial part of core topics in IR: models of information retrieval system (boolean and best-match systems); implementations (inverted files, tries, signature files, hashing), indexing and retrieval algorithms (lexical analysis, stemming, ranking, relevance feedback, boolean operations) and somewhat more advanced topics like clustering and automatic thesaurus construction. These topics are dealt with varying level of detail: for some of them there are also C code examples that are rather useful to students; other topics are less well detailed (eg. relevance feedback and probabilistic models). These topics are dealt with sufficient clarity and reasonable conciseness. Some shortcomings are: (i) the weak treatment of the probabilistic models (I would have liked a deeper analysis of the underlying principles and how they lead to certain kinds of systems). Consequences of some techniques are discussed with insufficient depth. (ii) In my view too much attention is devoted to low-level string processing, like what is done in chapter 10, centered on string searching algorithms (not relevant to the main topic of the book). (iii) Other important topics have not been dealt at all, unfortunately. These include almost everything that goes under the topic of user-centered information retrieval and user interfaces. Another missing topic is "passage retrieval".
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse
4 of 6 people found the following review helpful By Shlomo Yona on November 3, 2001
Format: Paperback
I bought this book while working on some informaitno retrieval related project, and it turned out as a useful reference for explaining terminology, suggesting efficient data structures, and offering good references for further reading.
However, the book turned out yet more useful to me as, during my M.A. studies (in CS) I had to write a work on "Suffix Trees" and "Suffix Arrays" and I found that Gonnet, Baeza-Yates and Snider describe equivalent ideas they call "PAT trees" and "PAT arrays".
I found this book useful too for working on computational linguistics related projects as well.
In short - I like keeping this book always in reach, as a reference, though, I found this book not so friendly as an introduction book to the subject ("Managing Gigabytes", might turn out to be a more welcomming).
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse
3 of 5 people found the following review helpful By A Customer on March 8, 1997
Format: Paperback
Although this is more of a hardcore software book, the techniques and issues presented are transferable to the general problem of knowledge management. In particular, the various software tricks for how to handle very large databases provide useful ideas on how to get the right bits of knowledge to the user.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse

Set up an Amazon Giveaway

Amazon Giveaway allows you to run promotional giveaways in order to create buzz, reward your audience, and attract new followers and customers. Learn more
Information Retrieval: Data Structures and Algorithms
This item: Information Retrieval: Data Structures and Algorithms
Price: $80.00
Ships from and sold by

Want to discover more products? Check out this page to see more: algorithms