Irs Syllabus
Irs Syllabus
1. To learn about the relationships to data base management systems and libraries.
2. To understand the important concepts, algorithms, and data/file structures
3. To learn about clusters, searching techniques and visualization.
4. To expose the students to find the searching algorithms and Evaluation systems.
5. To facilitate design, and implementation of Information Retrieval (IR) systems.
COURSE OUTCOMES:
UNIT – I Classes: 08
UNIT – II Classes: 12
CATALOGING AND INDEXING: Objectives, Indexing Process, Automatic Indexing, Information
Extraction. DATA STRUCTURES: Introduction, Stemming Algorithms, Inverted file structures, N-gram
data structure, and PAT data structure, Signature file structure, Hidden Markov Models.
AUTOMATIC INDEXING: Classes of Automatic Indexing, Statistical Indexing, Natural Language,
concept , Indexing, Hypertext Linkages.
UNIT – IV Classes: 12
TEXT SEARCH ALGORITHMS: Introduction, Software Text Search Algorithms, Hardware Text
Search Systems.
INFORMATION SYSTEM EVALUATION: Introduction, Measures used in System Evaluation,
Measurement Example -TREC results.
UNIT – V Classes: 14
Text Books:
1. Gerald J. Kowalski, Mark T. Maybury (2000), Information Storage and Retrieval Systems:Theory
and Implementation, 2ndedition, Springer International Edition, USA.
nd
2. Information Retrieval: Algorithms and Heuristics By David A Grossman and Ophir Frieder, 2
Edition, Springer.
Reference Books:
1. Database Systems, 6th edition, Ramez Elmasri, ShamkantB.Navathe, Pearson Education, 2013.
2. Introduction to Database Systems, C.J.Date, Pearson Education.
3. Fundamentals of Relational Database Management Systems, S. Sumathi, S. Esakkirajan,
Springer.