A parallel relational database management system approach to relevance feedback in information retrieval

A scalable, parallel, relational database‐driven information retrieval engine is described. To support portability across a wide‐range of execution environments, including parallel machines, all algorithms strictly adhere to the SQL‐92 standard. By incorporating relevance feedback algorithms, accura...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of the American Society for Information Science Jg. 50; H. 5; S. 413 - 426
Hauptverfasser: Lundquist, Carol, Frieder, Ophir, Holmes, David O., Grossman, David
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York John Wiley & Sons, Inc 1999
John Wiley & Sons
Schlagworte:
Database Design
Database Management Systems
Exact sciences and technology
Feedback
Information and communication sciences
Information and document management systems
Information Management
Information Retrieval
Information retrieval systems. Information and document management system
Information science. Documentation
Information Systems
Online Searching
Relevance (Information Retrieval)
Sciences and techniques of general use
Search Engines
Relevance
Prototype
Information system
Parallel system
Relational database
Feedback regulation
Information retrieval
Algorithm
ISSN:0002-8231, 1097-4571
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A scalable, parallel, relational database‐driven information retrieval engine is described. To support portability across a wide‐range of execution environments, including parallel machines, all algorithms strictly adhere to the SQL‐92 standard. By incorporating relevance feedback algorithms, accuracy is enhanced over prior database‐driven information retrieval efforts. Algorithmic modifications to our earlier prototype resulted in significantly enhanced scalability. Currently our information retrieval engine sustains near‐linear speedups using a 24‐node parallel database machine. Experiments using the TIPSTER data collections are presented to validate the described approaches.
Bibliographie:ArticleID:ASI4
ark:/67375/WNG-TPQGPWXP-L
istex:855066FA71AEDABDBA172D855D954DCB566B6AA7
ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0002-8231
1097-4571
DOI:10.1002/(SICI)1097-4571(1999)50:5<413::AID-ASI4>3.0.CO;2-4