You can see another example of search-results postprocessing in these before and after examples from the Linux Magazine site. Here, there's only a single datatype: articles written for the magazine or for the site. The postprocessor first builds an unordered list of hashtables containing the essential metadata for each search result:
Linux Magazine search results grouped by issue date
{
'title' => ' July 1999 | PRODUCT REVIEW | APACHE: The Definitive Guide, Second Edition',
'url'
=> 'http://www.linux-mag.com/1999-07/productreview_01.html',
'blurb' => ' ... version Linux Magazine / July 1999/ REVIEWS <b>APACHE:</b> The Definitive Guide, Second Edition PRODUCTREVIEW <b>APACHE:</b> The Definitive Guide, Second Edition by Elizabeth Zinkann With<b>Apache</b> being the most popular Web server platform in ... '
},
{
'title' => ' June 1999 | FEATURES | The Apache Story',
'url' => 'http://www.linux-mag.com/1999-06/apache_06.html',
'blurb' => ' ... Issues Feedback Contacts feedback mail to a friend printer-friendly version Linux Magazine / June 1999 / FEATURES The <b>Apache</b>Story << prev page 01 02 03 04 05 06 Again, IBM beat my expectations. I frankly didn't know what to expect ... '
},
From this unordered list, can produce two hashtables-of-lists (HoLs, in Perl-speak). One groups the results by issue date, like this:
Linux Magazine search results grouped by department
'1999-06'
=
> [
{
title' => ' June 1999 | FEATURES | The Apache Story',
'url'
=> 'http://www.l
In this volume of Best of BYTE, we explore the emergence of some heuristic algorithms. Although we have only scratched the surface of this intriguing subject, we hope we've suggested the potential of the synthesis of heuristics and algorithms.
