In Search Of... integrating site search
Upcoming SlideShare
Loading in...5
×
 

In Search Of... integrating site search

on

  • 7,842 views

Presentation from PHP UK 2010. Despite being a key method of navigation on many sites, search functionality often gets the short end of the stick in development, either by handing the job over to ...

Presentation from PHP UK 2010. Despite being a key method of navigation on many sites, search functionality often gets the short end of the stick in development, either by handing the job over to Google or just enabling full text search on the appropriate column in the database. In this talk we will look at how full text search actually works, how to integrate local text search engines into your PHP application, and how it's possible to actually provide better and more relevant results than Google itself, at least for your own site.

Statistics

Views

Total Views
7,842
Views on SlideShare
7,766
Embed Views
76

Actions

Likes
6
Downloads
117
Comments
2

6 Embeds 76

http://www.slideshare.net 46
http://www.berejeb.com 24
http://www.linkedin.com 3
http://www.gandhinarni.it 1
http://bookssearch.blogspot.com 1
https://connect.ubc.ca 1

Accessibility

Categories

Upload Details

Uploaded via as Adobe PDF

Usage Rights

CC Attribution License

Report content

Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
  • Full Name Full Name Comment goes here.
    Are you sure you want to
    Your message goes here
    Processing…
  • thanks !
    Are you sure you want to
    Your message goes here
    Processing…
  • great round up Ian, wish I'd been to the talk too
    Are you sure you want to
    Your message goes here
    Processing…
Post Comment
Edit your comment
  • Contact Details <br />
  • This is a question we&#x2019;d often like to ask our users <br /> But with search, they tell us <br /> Search is about getting content to users that want it <br /> Searching users are Active and engaged <br /> Give them what they want and they are more likely to <br /> Buy, Read, Comment, Share etc. <br />
  • This talk covers <br /> how full text search works, <br /> looks at some different options for integration <br /> looks at making it better <br /> Time for questions at the end, but one does spring to mind now: <br /> <br />
  • Why search, why not let google do it? <br /> Private, intranet, FB inbox, offline <br /> Bad at, twitter for a long time, blogs for a long time <br /> Product focus, like amazon <br /> Speed of update, like a forum <br /> Now, lets look at how a full text search operates. <br /> <br />
  • Search Engine Structure <br /> Raw Text <br /> Documents (add url, title, split up etc.) <br /> Text Analysis <br /> Index <br /> Query Parser <br /> Query <br /> Results <br /> Search UI <br />
  • Simplified structure of a search engine. <br /> Start with pool of raw data, chunked into documents <br /> Analyser processes text in docs , Index stores <br /> Other side: Search UI <br /> Query parsed by query parser, like anlyser, <br /> Searched on index and Results sorted and returned <br />
  • Tokenising is taking a document and splitting it into tokens to index. <br /> Can be difficult, even with space char. <br /> Commas - remove punctuation - then send 1.1 mil to 11 mil! <br /> Hyphens <br /> Apostrophes <br />
  • That said, starting with something simple isn&#x2019;t a bad idea. <br /> Here we look for continuous sequences of word chars <br /> Capture with offset, which is for phrase matching. <br /> More advanced SEs have better tokenisation: & in AT&T <br /> Some instead have buzzwords file, specific terms: C++ <br /> <br />
  • Pair extracted tokens with assigned doc ID <br /> Filter stop words - an, the, of - don&#x2019;t distinguish <br /> Position info included <br />
  • Invert and merge pairs, so terms -> doc <br /> Positions still stored, represented by () <br /> e.g best @ 4 and 16 in doc 1. <br /> Often stored separate, or just a straight count <br /> List of docs == posting list <br /> Enough to start a search <br />
  • Take search query and tokenise the same way. Important! <br /> For each term we array_intersect. <br /> Can do boolean searches by doing array union for OR etc. <br /> BUT no RANK - any result with all words as good as other <br /> Must store importance of terms to documents - weight <br />
  • The weighting scheme includes two measures <br /> TF - term frequency, the count of terms in the document <br /> IDF, inverse document frequency, the rareness of the term in the collection <br />
  • Simple but usable weight algo, basis of most. <br /> TF - Count of times term appears <br /> IDF - total docs / docs with term, 10 total / 3 with term. Log to smooth <br /> Store this score with the document in the posting list for the term <br /> Normalise scores over a doc to acct for length - but still boosts short text <br />
  • TF-IDF PHP code <br /> <br /> <br />
  • TF-IDF PHP code <br /> <br /> <br />
  • Document is position in N dimension space <br /> One dimension for each term ever seen <br /> Mostly 0 <br /> Normalised to length 1 (sqrt of sum of sqrs of vals) <br />
  • Just look at 2 terms here to keep it simple <br /> Here, rather than just looking for matches <br /> We accumulate a score for each matching document <br /> 246 is our highest scoring document, picking up two good scores <br /> But 120 makes it in at number three, despite not having &#x2018;best&#x2019; in it. <br /> <br />
  • For a 2 term, 2 dimension case, that looks like this. <br /> Calculate cosine of angle between with dot prod <br /> Similarity - 1 = same, 0 = orthogonal (no shared terms) <br /> We can treat a query as a new document <br /> The documents it is most similar to are the best results <br /> Only need to compare to documents that share terms -rest will be score 0 <br />
  • Look at query terms, retrieve posting list from index <br /> Treat query term weights as 1 - incorrect, but ok for relative results <br /> Index merge, and calc dot product by summing weights. <br /> So, don&#x2019;t need a full match <br /> Could add phrase search, or positional bias. <br />
  • Two main question <br /> Where does the data come from? <br /> How is the index accessed? <br /> Look at 6 PHP friendly engines <br /> Each different integration method <br /> Each with new bits of functionality <br /> <br />
  • Data from a database columns in one table <br /> Simplest of all to implement - integrate through query <br /> Note fulltext index. <br /> Straight vector space search impl. as described before. <br /> Only can be used for MyISAM, not InnoDB <br /> If you&#x2019;re using postgres, tsearch built in since 8.3 <br />
  • MATCH AGAINST syntax <br /> Boolean too - all engines have this, we focus on natural <br /> Only one document has both words <br /> Ranked in score order - MATCH AGAINST returns a float <br /> Note there&#x2019;s some tricky default config: min word length 4, and 50% fill exclusion <br />
  • One interesting option is Query Expansion - <br /> Blindly expand the search based on words returned. <br /> Usually not a very good idea, because we want more precision that recall <br /> Precision is quality of results, recall is completeness <br /> In this case it&#x2019;s expanded to lorenzo, because of marcello&#x2019;s hatred for bacon <br /> <br /> <br />
  • Can actually interrogate the index <br /> myisam_ftdump <br /> Run from the database directory <br /> However, lets say you want to search on a normalised schema directly - multiple tables <br />
  • Using sphinx you can index a more complex query <br /> Used on craigslist, and apparently on The Pirate Bay <br /> There is a PHP API for access, or extension pecl/sphinx <br /> Same interface but faster <br />
  • Once installed, setup sphinx.conf file <br /> Top: Connection Stuff - also works with postgresql <br /> Indexing on sql_query - could use view, complex etc. <br /> Adding attributes - non indexed elements of a doc - Numeric or timestamp only in sphinx. <br /> Using multi valued attributes, support tags many to many <br /> Other options, such sql_query_pre or post <br />
  • Next tell sphinx about the index <br /> Minimum length of indexed word <br /> Prefix for wild card search - infix anywhere, prefix end <br /> We also enable a stemmer <br />
  • Stemming consistently collapses different forms of the same word to a stem <br /> Here each version is reduced to happen, but not always an english word is generated, just a consistent one <br /> This allows us to match more words, and is often, but not always, helpful <br /> The most common algorithm is the Porter stemmer, there is a PHP implementation on the site <br />
  • Indexer command to build index <br /> Might lock DB table, there is a ranged table work around <br /> Command line search, defaults to require all <br /> Stemmer - love vs loves <br /> Last line - start indexing daemon <br />
  • Match any word <br /> Wildcard search - prefix search, <br /> Returns both &#x2018;bacon&#x2019; docs <br /> Add filters - limiting to certain values of attributes <br /> Now we just get 1 result <br /> Sphinx can be built into mysql as a table type, and queried via a where arg <br />
  • From the other end - Swish is easy to plug in to existing system at short notice <br /> Swish-e is an engine with a long pedigree, and a PHP extension. <br /> Used by quite a few universities. <br /> Doesn&#x2019;t support multibyte charsets, which is a bit of a downside. <br /> Great for combinations where you have a bunch of word docs or similar documents, and a website, and you want to search both. <br /> <br />
  • First &#x2018;fs&#x2019; for file system index - we create a conf file for indexer <br /> In the conf we tell it where to look for files <br /> FileFilters extract text from non-text formats doc/pdf <br /> Can specify IndexDir multiple times different doc stores <br /> Requires wv ware and xpdf <br /> Apache Tika <br /> <br />
  • Includes an effective web crawler, another way to get data <br /> Getting it through the web loses some of the advantages <br /> Can plug into website no real control over <br /> Mode is prog to call out to the spider script <br /> Index file is different name <br />
  • Being able to query across the two indexes is very handy <br /> Here we search fs and www indexes and give combined results <br /> Can use various filters to limit search to parts of HTML documents <br /> Or filter on file system paths <br />
  • Now we&#x2019;ll look at engines where we index from within PHP <br /> Lucene, apache foundation search engine <br /> Very succesful, but has ports instead of bindings <br /> Native PHP port in Zend Framework, Zend Search Lucene <br />
  • Hook right into the application, easy addition/plugin <br /> Lots of control, easy to add metadata/attributes <br /> Lucene calls them fields: string keys, multiple value types <br /> Text indexed and original stored - unstored not <br /> Index compatible w/ Java lucene 2.3 - can index java, search PHP <br /> <br />
  • Querying is straightforward, and quick. <br /> The scores are only really interesting as a relative value <br /> <br />
  • Includes some handy utilities such as HTML doc parser <br /> Spits out various fields such as title and body auto <br /> Allows you to add other fields as required <br /> Advantage of PHP - easy to hack at, add new doc types <br /> HOWEVER - doesn&#x2019;t scale to large collections so you may prefer to use one the Java based versions... and the easiest way is with Solr <br />
  • Solr uses java lucene - wraps in REST+XML/JSON web service <br /> Convenient for all the usual SOA reasons. <br /> Solr is in use by CNET, digg, netflix and other high profile sites. <br /> There is a PHP extension, or a PHP client API <br />
  • Not massively different from ZSL. <br /> Solr needs you to create a schema first, to define the fields of docs <br /> Note the client commit down the bottom. <br /> Until a document is committed <br /> Hardly know you&#x2019;re using a webservice <br />
  • Searching is similar <br /> XML based response format means a more complex return struct <br /> Solr is great for larger scale collections <br /> Provides good admin functionality - enterprise friendly <br />
  • Our last engine is Xapian <br /> High performance C based search engine. <br /> There is a Solr like service called Flax, but we&#x2019;ll look at the engine directly. <br /> PHP SWIG based extension and low level API <br /> Gives some cool features, and a lot of control <br /> Creates database on FS, or can be accessed remote <br />
  • Separation between the document and the indexer <br /> Integration of stemmer - english here <br /> We have an numeric indexed attribute, referred to as a &#x2018;value&#x2019; here, for the title <br />
  • Xapian index (local etc.) <br />
  • The searching is more complicated <br /> We have more control - <br /> STEM_SOME, don&#x2019;t stem words that start with a capital letter (proper nouns) <br />
  • Xapian query <br />
  • Retrieving the result relies on these functions wrapping around C iterators. <br /> Note the percentage score value - overtly relative, but can be thresholded if needed <br />
  • Xapian query result <br />
  • We have search engine <br /> We know where data coming from <br /> How can we improve results <br /> <br />
  • Link text can be a great source of keywords <br /> To use a classic example, from one of the early papers about google, if someone types &#x2018;big blue&#x2019; into google, one of the top results is IBM.com. <br /> But the page it points to doesn&#x2019;t contain the phrase <br /> Things link to it that do contain that phrase, and Google index against it. <br /> Big win for things like images and videos, where there may be no text <br /> <br />
  • Need to parse document <br /> Easy in PHP with the DOM parser <br /> We could then add these to the index, as a new field on a document <br /> ZSL has a built in html document type, but the getLinks function doesn&#x2019;t include anchor text <br /> <br /> <br />
  • Anchor text extract <br />
  • The next idea is zone weighting. <br /> This is a page from my blog <br /> I know what&#x2019;s important on this page - 1 to 3 <br /> Google has to guess, based on appearance <br /> Green = boilerplate - don&#x2019;t index <br /> Index these zones as fields, and weight differently <br />
  • If we break our content down into fields, <br /> We can set different &#x2018;boost&#x2019; values on them <br /> Boosts > 1 more important, &lt; 1 less important <br /> E.G. de-emphasise comments <br /> <br /> <br />
  • Document Weight - Importance, Authority <br /> In general - not tied to specific query <br /> Page rank - but that wont work on small collection <br /> Comments - &#x201C;great post&#x201D;, comment count <br /> Inbound visitors <br /> Retweets - Google uses a UserRank PR type calculation on follower counts <br />
  • Similar to zones, boost at document level <br /> The default is 1 <br /> Adding one 100th for each comment <br /> This of course could be tuned for individual circumstances <br />
  • Got engine, got data, got good results <br /> Now, look at ways to improve search user experience <br />
  • With UI - do what other websites do <br /> With search - do what google et al do <br /> Summaries or snippits show a selection of the page <br />
  • Sphinx build highlights <br />
  • Most search engines have some support for this. <br /> With Sphinx here, we can pass the query and index name to the BuildExcerpts function to get highlighted contextual snippits <br /> getTextFromDB is just a pretend function that would wrap retrieving the raw full text. <br />
  • We can do by storing some of the original text in SE <br /> We&#x2019;ve added a StoreDescription based on the body, for 1000 characters <br /> This will appear in the result object as swishdescription. <br /> We may want to index more, then choose the bit we display based on the presence of query words. <br />
  • Google highlighted search terms on summaries <br /> Can do on whole document as well <br /> Easy to do in many engines <br /> ZSL highlight matches - could use stored field or external <br /> HighlightMatches without fragment will add HTML headers <br />
  • Spelling correction is a really handy function <br /> Important to correct to known words from the index <br /> Rather than default dictionary <br /> <br />
  • Xapian example - set flag on indexer & queryparser. <br /> We had an index based on PHP documentation <br /> Have mistyped str_replace and strcmp <br />
  • Function names were corrected, despite not being &#x2018;words&#x2019; <br /> They featured in index, and had low edit distance from query <br /> Some low quality results returned - where we might use threshold <br /> Solr/Lucene has a similar plugin <br />
  • Another useful idea is sorting result sets on other than rank <br /> This is an example from google news <br /> E.G. file search, email, private messages may want others (sender, date, subject) <br />
  • Here we&#x2019;ve added a sort on title <br /> Can be expensive as SEs can&#x2019;t do normal shortcuts <br /> But normally straightforward <br />
  • We&#x2019;ve got a search here on epicurious, the food and cooking site. <br /> Shows categories and result counts <br /> This is called faceted search, categories = facets <br /> Document has many categories <br /> Good for product based search <br /> Solr was built with faceted search in mind for CNET reviews <br />
  • Enable faceted mode, set one facet, &#x2018;cat&#x2019; <br /> If we&#x2019;d been duplicating epicurious, each of the options on the left would have been a facet. <br /> Get results plus enumeration of options in each facet + count <br />
  • User can offer feedback by selecting more like this <br /> Find documents like this one <br /> Good for search with many meanings - &#x2018;creed&#x2019; (game, band, belief) <br /> Example from a dissertation search engine <br />
  • Generate search from document user selected <br /> Xapian has built in, can do in Solr as well. <br /> Top 40 most important terms extracted (can do more than one doc) <br /> Using str_replace from index of phpdoc <br /> Combine terms with ORs <br />
  • Finds itself, and other good matches <br /> MySQL FTI has blind query expansion, which gets more results based on the results retrieved - not as good, and hella slow! <br />
  • Search can be expensive <br /> Lots of data to process <br /> Most engines have some sort of query cache built in <br /> We&#x2019;ll take a quick look at some different aspects of performance. <br />
  • Indexes designed for more read than write <br /> Adding data can be expensive to a large index. <br /> Have two indexes <br /> Merge <br /> Lucene uses segments automatically <br />
  • Smaller index: less IO, better O/S cache, faster results <br /> But slower update speed <br /> Recombine segments, Merge deltas <br /> Optimise and compress index <br /> This can be an expensive operation though. <br /> Try to keep index on local disk, not network <br />
  • When demands too big for a single server, need to look at distributing <br /> Replication tends not to give such a boost here, as you generally have too large an index which is too slow for single queries, rather than scale <br /> Need to shard contents based on hash - something not searched for <br /> Most systems have a way of working with remote backends, to give single search and sort point <br />
  • The systems we&#x2019;ve talked about will all index tens of thousands of documents <br /> Xap and Solr should handle into the millions on one server <br /> 100s of mil/billions = webscale - Challenges: Data size, rate of update <br /> Nutch is a FOSS webscale SE/crawler created by Doug Cutting, of Lucene. <br /> Also did hadoop: mapreduce, distributes files etc. (not being sued by google) <br /> Used on thousands of nodes at yahoo, among others <br />
  • <br />
  • <br />
  • Thanks! <br />

In Search Of... integrating site search In Search Of... integrating site search Presentation Transcript

  • In Search Of... integrating site search Ian Barber @ianbarber http://phpir.com ian@ibuildings.com http://joind.in/talk/view/1462
  • what do you want?
  • How Search Works Integrating Search Improving Results Using Search Search Performance Questions 3
  • 4
  • Query Query Query Query Query Parser Result Result Result Result Index Analyser Document Document Document Document 4
  • Tokenisation “ With AT&T’s help, the F.B.I Miami-Dade office had recovered $1.1 million from O’Healy’s Ponzi scheme, 10-15% more than ” expected. 6
  • PHP Tokenisation function tokenise($string) { $string = strtolower($string); preg_match_all('/w+/', $string, $matches, PREG_OFFSET_CAPTURE); return $matches[0]; } 7
  • Document Term Pairs Document ID Term 1 the 1 best 1 of 1 the ... ... 204 and 204 what 204 would 8
  • Inverted Index Term Documents best 1 (4, 16), 4 (422), 129 (344) ... what 24 (50, 98), 75 (33, 208) ... would 99 (32, 599), 201 (344) .. ... ... 9
  • Boolean Query Merge Query: Best Western Hotel best 1 4 129 298 305 338 western 4 95 194 204 298 305 working 4 298 305 hotel 2 40 200 298 355 402 Result: Document 298 10
  • Lorem ipsum dolor sit amet, Lorem ipsum dolor sit amet, consectetur adipiscing elit. Sed sit amet ante vitae enim elementum semper sodales quis consectetur adipiscing elit. Sed sit amet ante vitae enim elementum semper sodalesipsum. Aliquam vel condimentum Lorem ipsum dolor sit amet, quis neque. ipsum. Aliquam vel condimentum neque. Curabitur ornare feugiat ornare. Donec consectetur adipiscing elit. Sed sit amet ante consectetur elit metus. Nulla eleifend Curabitur ornare feugiat ornare. Donec vitae enim elementum semper sodales quis consectetur elit metus. Nulla eleifend tincidunt massa et euismod. Vestibulum ipsum. Aliquam vel condimentum neque. vestibulum, justo vel egestas elementum, tincidunt massa et euismod. Vestibulum sit amet, Lorem ipsum dolor Curabitur ornare feugiat ornare. Donec vestibulum, justo consectetur elementum,elit.enim sit ametquam, vel gravida est vel egestas adipiscing purus Sed ornare ante consectetur elit metus. Nulla eleifend purus enim ornarevitae enim elementum sempernibh. quam, vel gravida est vel sodales quis enim tincidunt massa et euismod. Vestibulum Lorem ipsum dolor sit amet, consectetur enim vel nibh. Lorem ipsum dolor ipsum. Aliquam vel condimentum neque. fringillavestibulum, justo vel egestas elementum, sit amet, Nam non eros nisi, eget justo. consectetur adipiscingCurabitur sit ametfeugiat ornare. Donec mauris vehicula enim ornare quam, vel gravida est elit. Sed ornare ante purus adipiscing elit. Sed sit amet ante vitae enim vitae enim elementum consectetur elitjusto.Fusce vel risus vitae Nam non eros nisi,semper sodalesmetus. Nulla eleifend eget fringilla quis enim vel nibh. Fusce vel risus condimentum neque. facilisis sit amet in mi. Nulla ut turpis id ipsum. Aliquam velvitae maurismassa et euismod. Vestibulum tincidunt vehicula elementum semper sodales quis ipsum. Aliquam facilisis sit amet in mi. Nulla ut turpis felis sollicitudin dictum sed nonNam non eros nisi, eget fringilla justo. Curabitur ornare feugiat ornare. Donec velid vestibulum, justo egestas elementum, ipsum. Praesent gravida nulla, sed blandit leo. ut risus est Lorem ipsum dolor sit amet, Lorem ipsum dolor sit amet, consectetur elit metus.purus enim ornare quam, vel volutpat laoreet lacus,Fusce vel risus vitae mauris vehicula felis sollicitudin dictum sed non ipsum. Nulla eleifend vel condimentum neque. Curabitur ornare enim Vestibulum Curabitur ut consectetur adipiscing elit. Sed sit amet ante consectetur adipiscing elit. Sed sit amet ante tincidunt massa risus nulla, sed nibh. leo.consectetur arcu vestibulum vel.facilisis sit amet in mi. Nulla ut turpis id Praesent ut et euismod.vel blandit ut sodales Donec Curabitur volutpat laoreet lacus, vitae enim elementum semper vitae enim elementum semper sodales quis quis felis sollicitudin dictum sed non ipsum. vestibulum, justo vel egestas elementum, dapibus fringilla arcu, et semper lacus feugiat ornare. Donec consectetur elit metus. Nam non vel. ipsum. Aliquam vel condimentumLorem ipsumut risussit amet, blandit leo. consectetur arcu vestibulumeros nisi, eget fringilla justo. purus enim ornare quam, vel gravida est Donec ipsum. Praesent vel condimentum neque. neque. Aliquam dolor nulla, sed arcu, vel risusCurabitur ornare feugiat ornare.consectetur adipiscing elit. Sed Donec ut Curabitur ornare volutpat laoreetsit amet ante Donec enim dapibus fringilla Fusce et sempervitae mauris vehicula vel nibh. lacus Curabitur feugiat ornare. lacus, consectetur elitut turpisNulla eleifendenim elementumNulla eleifend quis metus. id consectetur elit metus. semper sodales Donec Nulla eleifend tincidunt massa et euismod. facilisis sit amet in mi. Nulla vitae consectetur arcu vestibulum vel. tincidunt massa et euismod. Vestibulum massa et euismod. Vestibulum lacus tincidunt Nam non eros nisi, eget fringilla justo. dictum sed non ipsum. felis sollicitudin ipsum. dapibus fringilla arcu, et semper Aliquam vel condimentum neque. vestibulum, justo vel egestas elementum, ornare vel egestas elementum, vestibulum, justo feugiat ornare. Donec Vestibulum vestibulum, justo vel egestas Fusce vel risus vitae mauris vehicula nulla, sed blandit leo. Praesent ut risus purus Curabitur Curabitur volutpat enim ornare quam, vel gravidaenim ornare quam, vel gravida est purus est elit metus. Nulla eleifend facilisis sit amet in mi. Nulla ut turpis id laoreet lacus, ut consectetur enim vel nibh.vel. Donec consectetur arcu vestibulum enim vel nibh. et euismod. Vestibulum elementum, purus enim ornare quam, vel felis sollicitudin dictum sed non ipsum. Praesent ut risus nulla, dapibus fringilla arcu, et semper lacus sed blandit leo. tincidunt massa vestibulum, justo vel egestas elementum, Nam non eros nisi, eget fringilla justo. eros nisi, eget fringilla justo.est Nam non ornare quam, vel gravida gravida est enim vel nibh. Curabitur volutpat laoreet lacus, ut purus enim Fusce vel risus vitae mauris vehicula vel nibh. vitae mauris vehicula Fusce vel risus enim Lorem ipsum dolor sit amet, vel. Donec consectetur arcu vestibulum facilisis sit amet in mi. Nulla ut turpis id amet in mi. Nulla ut turpis id facilisis sit consectetur adipiscing elit.et semper lacus sollicitudin dictum sed non ipsum. dapibus fringilla arcu, Sed sit amet ante felis felis sollicitudin dictum sed non ipsum. Nam non eros nisi, eget fringilla justo. Nam non eros nisi, eget fringilla justo. Fusce vel vitae enim elementum semper sodales quis ipsum. Aliquam vel condimentum neque. Praesent ut risus nulla, sed blandit leo. utrisus vitae mauris vehicula Praesent risus nulla, sed blandit leo. Fusce vel Curabitur volutpat laoreet lacus, ut Curabitur volutpat laoreet lacus, ut Curabitur ornare feugiat ornare. Donec consectetur arcu vestibulum vel. Donec sit arcu vestibulum vel. turpis id facilisis amet in mi. Nulla ut risus vitae mauris vehicula facilisis sit amet in Lorem ipsum dolor sit amet, consectetur consectetur elit metus. Nulla eleifendadipiscing elit. Sed sit amet ante felis sollicitudin dictum sed non ipsum. consectetur Donec Lorem ipsum dolor sit amet, dapibus fringilla arcu, etLorem ipsum dolor sit amet, et semper lacus semper lacus fringilla nulla, sed blandit leo. dapibus ut risus arcu, consectetur adipiscing enimSed vitae elit. elementum ante quis Praesent tincidunt massa et euismod. Vestibulumsit amet semper sodalesconsectetur adipiscing elit. Sed sit amet ante mi. Nulla ut turpis id felis sollicitudin dictum vestibulum, justo vel egestas elementum, vitae enim elementum semper sodales quis vitae Curabitur volutpat laoreet lacus, ut ipsum. Aliquam vel condimentum neque. enim elementum semper sodales quis purus enim ornare quam,vel condimentum feugiat ornare. Donec Curabitur ornare neque. vel gravida est consectetur arcu vestibulum vel. Donec sed non ipsum. Praesent ut risus nulla, sed ipsum. Aliquam enim vel nibh. Curabitur ornare feugiat ornare. metus. ipsum. Aliquam vel condimentum neque. consectetur elit Donec Nulla eleifend Curabiturdapibus feugiat ornare.et semper lacus ornare fringilla arcu, Donec tincidunt massa et euismod. Vestibulum blandit leo. Curabitur volutpat laoreet lacus, ut consectetur elit metus. Nulla eleifend vestibulum,Loremvel egestas elementum, Nam non eros nisi, eget fringilla justo. justo ipsum dolor sit amet, tincidunt massa et euismod. Vestibulum consectetur elit metus. Nulla eleifend tincidunt ipsum dolor sit amet, Lorem massa et euismod. Vestibulum purus enim ornare quam, vel gravidaSed sit amet ante vel egestas elementum, consectetur adipiscing elit. est Fusce vel risus vitaejusto vel egestas elementum, vestibulum, mauris vehicula consectetur arcu vestibulum vel. Donec dapibus enim vel vitae enim est nibh. sit amet in ornare quam, vel id vestibulum, justo consectetur adipiscing elit. Sed sit amet ante facilisis purus enim mi. Nulla ut turpisgravida elementum semper sodales quis purus enim ornare quam, vel gravida est vitae enim elementum semper sodales quis felis sollicitudin dictum sed non ipsum. Aliquam vel condimentum vel nibh. vel condimentum neque. enim vel nibh. ipsum. enim neque. fringilla arcu, et semper lacus egestas non. Praesent ut risus nulla, sed blandit leo. nisi, eget fringilla Nam non eros ipsum. Aliquam Curabitur ornare feugiatjusto. Donec ornare. Curabitur ornare feugiat ornare. Donec consectetur elit metus. Nulla eleifend Curabitur volutpateros nisi,lacus, fringilla vitae mauris vehicula consectetur elit metus. Nulla eleifend Nam non laoreet egetvel risus justo. Fusce ut Nam non eros nisi, eget fringilla justo. Quisque eu purus ut lacus egestas dapibus. consectetur arcu vestibulum vel. Donec inmassa et euismod. Vestibulum tincidunt Fusce vel risus vitae mauris amet mi. Nulla ut turpis tincidunt massavitae mauris Vestibulum facilisis sit vehicula id Fusce vel risus et euismod. vehicula felis sollicitudin dictum vel egestas vestibulum,amet in mi. Nulla elementum, vestibulum, justo dapibus fringilla arcu, et semper lacus turpis id sed non ipsum. facilisis sit amet in mi. Nulla ut elementum, facilisis sit justo vel egestas ut turpis id Integer in velit id est dictum bibendum in id mi. purus enim ornareblandit vel gravida est felis sollicitudin dictum sed non ipsum. sed Praesent ut risus nulla, enim vel nibh. quam, leo. purus enim ornare quam, velnon ipsum. felis sollicitudin dictum sed gravida est Praesent ut risus Curabitur volutpat laoreet lacus, ut enim vel ut risus nulla, sed blandit leo. nulla, sed blandit leo. Praesent nibh. consectetur arcu vestibulum vel. Donec Curabitur volutpat laoreet lacus, ut Curabitur volutpat laoreet lacus, ut dapibus Nam nonarcu, nisi, eget fringilla justo. arcu vestibulum vel. Donec fringilla eros consectetur arcu vestibulum vel. Donec et semper lacus consectetur Nam non eros nisi, eget fringilla justo. Fusce vel risus vitae mauris vehicula dapibus fringilla arcu, et semper lacus Fusce velfringilla arcu, et semper lacus dapibus risus vitae mauris vehicula facilisis sit amet in mi. Nulla ut turpis id facilisis sit amet in mi. Nulla ut turpis id felis sollicitudin dictum sed non ipsum. felis sollicitudin dictum sed non ipsum. Praesent ut risus nulla, sed blandit leo. Praesent ut risus nulla, sed blandit leo. Curabitur volutpat laoreet lacus, ut Curabitur volutpat laoreet lacus, ut consectetur arcu vestibulum vel. Donec consectetur arcu vestibulum vel. Donec dapibus fringilla arcu, et semper lacus dapibus fringilla arcu, et semper lacus
  • TF-IDF function getWeight($docID, $term, $total) { $tf = count($term[$docID]); $idf = log($total / count($term), 2); return $tf * $idf; } 12
  • Document Vector socket what heavy steel ... Doc 1 0.02 0.3 0.001 0 ... Doc 2 0 0 0 0 ... Doc 3 0.001 0.2 0 0 ... Doc 4 0 0 0.002 0.003 ... 13
  • Ranked Query Merge best 23 42 179 246 333 703 weight 0.008 0.002 0.023 0.039 0.014 0.001 western 42 88 120 179 246 798 weight 0.003 0.004 0.023 0.001 0.034 0.004 1 - 246: 0.073 2 - 179: 0.024 3 - 120: 0.023 14
  • PHP Similarity function score($queryString, $index) { $query = tokenize($queryString); $matches = array(); foreach($query as $qterm) { $postings = $index[$qterm]; foreach($postings as $id => $posting) { $matches[$id] += $posting['score']; } } return arsort($matches); } 15
  • Integrating Search 16
  • MySQL Full Text Search CREATE TABLE example ( id INT(11) NOT NULL auto_increment, title VARCHAR(255), content TEXT, PRIMARY KEY(id), FULLTEXT(title,content) ) Engine=MyISAM; INSERT INTO example (title, content) VALUES ('Mikko & Bacon','Mikko loves bacon'), ('Marcello & Bacon','Marcello hates bacon'), ('Jo & Sausages','Johanna loves sausages'), ('Hollywood & Garlic','Lorenzo hates garlic'), ('James & Cheddar','James is keen on cheeses'); 17
  • MySQL FTI Query SELECT * FROM example WHERE MATCH(title,content) AGAINST('loves bacon'); +----+------------------+------------------------+ | id | title | content | +----+------------------+------------------------+ | 1 | Mikko & Bacon | Mikko loves bacon | | 2 | Marcello & Bacon | Marcello hates bacon | | 3 | Jo & Sausages | Johanna loves sausages | +----+------------------+------------------------+ 3 rows in set (0.00 sec) 18
  • Looking At The Index /var/lib/mysql/fttest# myisam_ftdump example 1 Total rows: 5 Total words: 17 Unique words: 14 Longest word: 9 chars (hollywood) Median length: 5 Average global weight: 1.176117 Most common word: 2 times, weight: 0.405465 (bacon) 19
  • Sphinx http://www.sphinxsearch.com 20
  • Sphinx Configuration source posts { type = mysql sql_host = localhost sql_user = user sql_pass = password sql_db = search sql_query = SELECT id, title, content FROM example; sql_attr_multi = uint tag from query; SELECT example_id, tag_id FROM tags; } 21
  • index posts { source = posts path = /var/data/sphinx/example morphology = stem_en min_word_len = 3 min_prefix_len = 3 min_infix_len = 0 enable_star = 1 } 22
  • Stemming http://tartarus.org/~martin/PorterStemmer happening - happen happened - happen happens - happen 23
  • Command Line Searching indexer --config /etc/sphinx.conf --all search --config /etc/sphinx.conf love bacon displaying matches: 1. document=1, weight=3, tag=(1,2) ! id=1 ! title=Mikko & Bacon ! content=Mikko loves bacon words: 1. 'love': 2 documents, 2 hits 2. 'bacon': 2 documents, 4 hits searchd --config /etc/sphinx.conf 24
  • Sphinx From PHP $cl = new SphinxClient(); $cl->SetServer('localhost', 3312); $cl->SetMatchMode(SPH_MATCH_ANY); $result = $cl->Query('bac*'); $docIDs = array_keys($result["matches"]); $cl->SetFilter('tag', array(1)); $result = $cl->Query('bac*'); $docIDs = array_keys($result["matches"]); 25
  • Swish-E http://swish-e.org pecl install swish-beta 26
  • Filesystem Index With Swish-E /usr/local/bin/swish-e -S fs -c fs-swish-e.conf fs-swish-e.conf IndexDir /var/data/documents IndexFile fs-swish-e.index IndexOnly .doc .docx .pdf FuzzyIndexingMode Stemming_en1 FileFilter .pdf /usr/local/bin/swish_filter.pl FileFilter .doc /usr/local/bin/swish_filter.pl
  • Crawling Content /usr/local/bin/swish-e -S prog -c www-swish-e.conf www-swish-e.conf IndexDir /usr/local/lib/swish-e/spider.pl IndexFile www-swish-e.index SwishProgParameters default http://phpir.com/ FuzzyIndexingMode Stemming_en1 DefaultContents HTML
  • Swish-E With Multiple Indices $swish = new Swish( 'www-swish-e.index fs-swish-e.index' ); $search = $swish->prepare(); $queryStr = 'search string goes here'; $result = $search->execute($queryStr); $total = $result->hits; while($r = $result->nextResult()) { echo $r->swishdocpath; // url }
  • Lucene 30
  • $index = Zend_Search_Lucene::create('idx'); foreach($documents as $title => $content) { $doc = new Zend_Search_Lucene_Document(); $doc->addField( Zend_Search_Lucene_Field::Text( 'title', $title)); $doc->addField( Zend_Search_Lucene_Field::UnStored( 'content', $content)); $index->addDocument($doc); } Build Index 31
  • $results = $index->find('loves bacon'); foreach($results as $result) { echo $result->score, " "; echo $result->title, "n"; } Output: 0.81656279309067 Mikko and Bacon 0.24800278854758 Marcello & Bacon Query Zend Search Lucene 32
  • $file = file_get_contents($url); $doc = Zend_Search_Lucene_Document_Html:: loadHTML($file); $doc->addField( Zend_Search_Lucene_Field::Text( 'url', $url ); $index->addDocument($doc) Index HTML 33
  • Solr http://lucene.apache.org/solr/ 34
  • Solr Search Index $options = array( 'hostname' => 'localhost', 'port' => 8983 ); $client = new SolrClient($options); $doc = new SolrInputDocument(); $doc->addField('id', $id); $doc->addField('cat', $category); $doc->addField('title', $title); $doc->addField('text', $text); $response = $client->addDocument($doc); $client->commit(); 35
  • Solr Search Client $client = new SolrClient($options); $query = new SolrQuery('bacon'); $response = $client->query($query); $r = $response->getResponse(); foreach($r['response']['docs'] as $d) { echo $d->title[0] . "n"; } 36
  • Xapian http://xapian.org 37
  • Xapian In PHP $db = new XapianWritableDatabase( 'idx', Xapian::DB_CREATE_OR_OPEN); $i = new XapianTermGenerator(); $i->set_stemmer(new XapianStem("english")); $doc = new XapianDocument(); $doc->set_data($content); $doc->add_value(1, $title); $i->set_document($doc); $i->index_text($content); $db->add_document($doc); 38
  • Xapian Search In PHP $database = new XapianDatabase('idx'); $enquire = new XapianEnquire($database); $qp = new XapianQueryParser(); $qp->set_stemmer(new XapianStem("english")); $qp->set_database($database); $qp->set_stemming_strategy( XapianQueryParser::STEM_SOME); $query = $qp->parse_query($queryString); $enquire->set_query($query); 39
  • $matches = $enquire->get_mset(0, 10); $i = $matches->begin(); while(!$i->equals($matches->end())) { $n = $i->get_rank() + 1; $data = $i->get_document()->get_data(); $title = $i->get_document()->get_value(1); $score = $i->get_percent(); $i->next(); } 40
  • Improving Results 41
  • Anchor Text 42
  • Parse Anchor Text $p = file_get_contents('http://phpir.com'); libxml_use_internal_errors(true); $dom = DomDocument::loadHTML($p); $links = $dom->getElementsByTagName('a'); foreach($links as $link) { $href = $link->getAttribute('href'); $text = $link->nodeValue; } 43
  • 1 2 3 Zone Weighting 44
  • $doc = new Zend_Search_Lucene_Document(); $tfield = Zend_Search_Lucene_Field::Text ('title', $title); $tfield->boost = 1.3; $doc->addField($tfield); $doc->addField( Zend_Search_Lucene_Field::UnStored ('content', $content)); $index->addDocument($doc); ZSL Zone Weighting 45
  • Document Authority 46
  • Document Weights in ZSL $doc = new Zend_Search_Lucene_Document(); $doc->addField( Zend_Search_Lucene_Field::Text ('title', $title)); $doc->addField( Zend_Search_Lucene_Field::UnStored ('content', $content)); $doc->boost = 1 + ($numComments / 100); $index->addDocument($doc); 47
  • Using Search 48
  • Summaries & Highlighting 49
  • Sphinx Extract & Highlight $cl = new SphinxClient(); $cl->SetServer( "localhost", 3312 ); $q = 'bacon'; $r = $cl->Query($q); foreach ($r["matches"] as $doc => $info) { $text[$doc] = getTextFromDB($doc); } $e = $cl->BuildExcerpts($text, 'posts', $q); foreach($extracts as $extract) { echo $extract; } 50
  • Xapian Spelling Correction Indexer $indexer = new XapianTermGenerator(); $indexer->set_database($database); $indexer->set_flags( XapianTermGenerator::FLAG_SPELLING); Searcher $queryString = "strreplace or str_cmp"; $q = new XapianQueryParser(); $q->set_database($database); $query = $q->parse_query($queryString, XapianQueryParser::FLAG_SPELLING_CORRECTION); echo "Did you mean: " . $q->get_corrected_query_string() . "n"; 52
  • Spelling Correction Output php xapsearch.php Did you mean: str_replace or strcmp 4644 results found for “strreplace or str_cmp”: 1: 2% docid=572 [phpdocs/html/cc.license.html] 2: 2% docid=7169 [phpdocs/html/imagick.constants.html] 3: 2% docid=10086 [phpdocs/html/sqlite3result.fetcharray.html] 4: 2% docid=6132 [phpdocs/html/function.swf-posround.html] 53
  • Results Sorting 54
  • Sorting in ZSL $q = Zend_Search_Lucene_Search_QueryParser:: parse('search string'); $results = $index->find($q, 'title'); foreach($results as $result) { echo '<h3>', $result->title, "</h3>n"; $doc = getDocumentFromDB($result->did); echo $q->htmlFragmentHighlightMatches($doc); } 55
  • Faceted Search 56
  • Faceted Search In Solr $client = new SolrClient($options); $query = new SolrQuery('bacon'); $response = $client->query($query); $query->setFacet(true); $query->addFacetField('cat'); $r = $response->getResponse(); $f = $r['facet_counts']['facet_fields']; foreach($f['cat'] as $facet => $count) { echo $facet . " " . $count . "n"; } 57
  • More Like This 58
  • More Like This $rset = new XapianRset(); $rset->add_document(5959); // str_replace $e = $enquire->get_eset(40, $rset); $t = $e->begin(); for($t; !$t->equals($e->end()); $t->next()){ $qs[] = new XapianQuery($t->get_term(), intval($t->get_weight())); } $query = new XapianQuery( XapianQuery::OP_OR, $qs); 59
  • More Like This Example php xapsim.php 1656 results found: 1: 100% docid=5959 [phpdocs/html/function.str-replace.html] 2: 47% docid=5956 [phpdocs/html/function.str-ireplace.html] 3: 24% docid=5328 [phpdocs/html/function.preg-replace.html] 4: 18% docid=5958 [phpdocs/html/function.str-repeat.html] 60
  • Search Performance 61
  • Index Updates New Docs Docs Delta Docs Docs Delta Main Main Query Main Delta Main 62
  • Search Speed Zend Search Lucene $index = Zend_Search_Lucene::open('index'); $index->optimize(); Sphinx indexer --merge main delta --rotate Solr $client = new SolrClient($options); $client->optimize(); Xapian xapian-compact xapindex xapindex2 63
  • Distributing Search Document Document Document Document Index Index Index Application 64
  • Large Scale Search http://www.nutch.org http://hadoop.apache.org 65
  • Image Credits Title http://www.flickr.com/photos/generated/2084287794/ What Do You Want http://www.flickr.com/photos/the_justified_sinner/ You Are Here 2498066986/ http://www.flickr.com/photos/alecvuijlsteke/2692475420/ Integrating Search http://www.flickr.com/photos/squeaks2569/3700355684/ Sphinx http://www.flickr.com/photos/generated/2084287794/ Lucene http://www.flickr.com/photos/mypanda/7731447/ Swish-e http://www.flickr.com/photos/ryan_fung/2239687100/ Solr http://www.flickr.com/photos/m-j-s/2724756177/ Xapian http://www.flickr.com/photos/olibac/3522056495/ Using Search http://www.flickr.com/photos/eneas/175027945/ Improving Search http://www.flickr.com/photos/x-ray_delta_one/3928200642/ Search Performance http://www.flickr.com/photos/maisonbisson/1634408/ Large Scale Search http://www.flickr.com/photos/zedzap/3663508847/ 66
  • Questions? 67
  • Thank you! Ian Barber @ianbarber http://phpir.com ian@ibuildings.com http://joind.in/talk/view/1462