I've got a strange problem with indexing PDF files in SQL Server 2005, and hope someone can help. My database has a table called MediaFile with the following fields - MediaFileId int identity pk, FileContent image, and FileExtension varchar(5). I've got my web application storing file contents in this table with no problems, and am able...
Basically I have a website. I have a properly setup sitemap so I assume Google knows about all of my pages. And I've seen on some sites, the search form leads to a page with the shell of the original site but the results are clearly provided by Google. Similar to codinghorror.com's search, however his results aren't shown within his w...
We'll soon be embarking on the development of a new mobile application. This particular app will be used for heavy searching of text based fields. Any suggestions from the group at large for what sort of database engine is best suited to allowing these types of searches on a mobile platform? Specifics include Windows Mobile 6 and we'll ...
What are the main differences between search engines (DtSearch , Lucene.net, Sphinx, Google etc) that should influence the decision as to which to use to search proprietary data? The data to be searched consists of presentation-free data that is marked up with metadata in the form of name/value pairs. We’re not interested in the format...
In developing search for a site I am building, I decided to go the cheap and quick way and use Microsoft Sql Server's Full Text Search engine instead of something more robust like Lucene.Net. One of the features I would like to have, though, is google-esque relevant document snippets. I quickly found determining "relevant" snippets is m...
I understand the following elements : there is some sort of crawling (configured in central administration) when the crawling is done, there is a slight delay, after which you can have your search results displayed. But, in a document library with publishing enabled, documents that are not published don't appear in search results. Is...
In Vim I can :set wrapscan so that when I do an incremental search, the cursor jumps to the first match whether the first match is above or below the cursor. In Emacs, if I start a search via C-s, the search fails saying Failing I-search if the first match is above the cursor. If I hit C-s again it then wraps the search, saying Wrapped...
How can you find the number of occurrences of a particular character in a string using sql? Example: I want to find the number of times the letter ‘d’ appears in this string. declare @string varchar(100) select @string = 'sfdasadhfasjfdlsajflsadsadsdadsa' ...
Does anyone know if the problems that have been affecting Stack Overflow with regards to SQL Server 2008 Full Text Search performance have implications for the search in SharePoint? As far as I understand it SharePoint search uses SQL Server full text search. ...
I need to build full-text search functionality into our knowledge base system using C#. How do I start? ...
Hello, I'm trying to complete the last part of my Haskell homework and I'm stuck, my code so far: data Entry = Entry (String, String) class Lexico a where (<!), (=!), (>!) :: a -> a -> Bool instance Lexico Entry where Entry (a,_) <! Entry (b,_) = a < b Entry (a,_) =! Entry (b,_) = a == b Entry (a,_) >! Entry (b,_) = a...
I have been writting a keyword search script based on this tutorial: http://www.hackosis.com/2007/11/06/howto-simple-search-engine-with-php-and-mysql/ Like some of the commenters mentioned, the script only ends up returning results based on the last word in the search terms. So I have also tried to implement one of the suggestions from ...
The vim * star / asterisk search (:help star) is a great feature which lets you find the next occurrence of the word the cursor is over. Unfortunately it treats dollar-prefixes as part of the string, so if I press * while over the "SearchTerm" in the class name it finds "SearchTerm" in the comment, and "$this->SearchTerm", but not "$Sear...
I know I can loop over the string or build a regex or invert the set (ASCII isn't that big after all) and search for the first instance of that, but Yuck. What I'm looking for is a nice one liner. fewer features is better, LINQ is out (for me, don't ask, it's a long story) The solution I'm going with (unless I see something better) ...
Hello all. I have a list of URLs and am trying to collect their "descriptions." By description I mean what comes up, for example, if you Googled the link. For example, http://stackoverflow.com">Google: http://stackoverflow.com shows the description as A language-independent collaboratively edited question and answer site for ...
So our scenario is this: We have multiple Sharepoint sites that are created dynamically on a "as requested" basis. Basically there's a new site for each new project. Now, for every site we want to add a search clause that says that only contents with a metadata tag value equal to the sitename should be found. Quick example: There are 2 s...
We have a hosted application that manages pages of content. Each page can have a number of customized fields, and some standard fields (timestamp, user name, user email, etc). With potentially hundreds of different sites using the system -- what is an efficient way to handle filtering/searching? Picture a grid view that you want to narr...
Range intersection is a simple, but non-trivial problem. Its has been answered twice already: http://stackoverflow.com/questions/224878/find-number-range-intersection http://stackoverflow.com/questions/143552/comparing-date-ranges The first solutions is O(n) and the second solution is for a database (which is less than O(n) of cours...
Is there a way to find all nodes in a xml tree using cElementTree? The findall method works only for specified tags. ...
ArrayList <String> list = new ArrayList(); list.add("behold"); list.add("bend"); list.add("bet"); list.add("bear"); list.add("beat"); list.add("become"); list.add("begin"); There is a way to search for the regexp bea.* and get the indexes like in ArrayList.indexOf ? EDIT: returning the items is fine but I need something with more per...