Rectangle 27 1

View columns are not part of full text index. You have to use field names for your full text search.

In your example it means that instead of $14 you have to use the fieldnames from your column formula @If(nomprov="";cifprov;nomprov)):

...
+ " OR (Field nomprov = *" + sessionScope.searchNumfac + "*)"
+ " OR (Field cifprov = *" + sessionScope.searchNumfac + "*)";

Note: there is only one FTIndex per nsf. So a view.ftsearch first does a db.ftsearch and then compares the result with the view selection formula. Can be nastily slow. Would a getentriesbykey be an option?

Thanks a lot, I understand it now. As for the getentriesbykey, are you referring to getAllEntriesByKey()? According to what I have read, the columns by which the search is done must be sorted on the view. Is that correct? If so, I think I cannot use it because I want to search by some columns that are not sorted.

XPages full text searching and $* columns - Stack Overflow

xpages
Rectangle 27 19

Technically you can do full text search with MongoDB, but you're missing out on a lot that a full text search provider has to offer. I love MongoDB, but I'd couple it with a full text search provider (such as Lucene or Sphinx) if time to implementation is at all a concern. I think MongoDB's convenient ability to index word arrays is better left to tagging and searching based on tagging than full text search.

Search (Information Retrieval) isn't just about grabbing any documents that match, if you want your search results to have any relevance at all you're going to need something along the lines of TF-IDF, phrase matching (words in a sequence score higher) or any number of other IR techniques to improve search precision. If you use MongoDB you'll need to implement it all from scratch.

If you really want to implement it all from scratch but not bother with the raw storage side of things, MongoDB is pretty close to the best DB store that you could implement it on top of (can't think of many others), but that still doesn't make it a great option.

java - Is MongoDB a valid alternative to relational db + lucene? - Sta...

java lucene mongodb relational-database
Rectangle 27 10

If you want to use full text indexing you need to make sure your table's underlying engine is MyISAM. You can change this using ALTER TABLE tweets ENGINE = MYISAM;

by the way, how can I know its current table type?

mysql full text search error - Stack Overflow

mysql full-text-search mysql-error-1214
Rectangle 27 9

What am I going to build my next app on? Probably Postgres. Will I use NoSQL? Maybe. I might also use Hadoop and Hive. I might keep everything in flat files. Maybe Ill start hacking on Maglev. Ill use whatever is best for the job. If I need reporting, I wont be using any NoSQL. If I need caching, Ill probably use Tokyo Tyrant. If I need ACIDity, I wont use NoSQL. If I need a ton of counters, Ill use Redis. If I need transactions, Ill use Postgres. If I have a ton of a single type of documents, Ill probably use Mongo. If I need to write 1 billion objects a day, Id probably use Voldemort. If I need full text search, Id probably use Solr. If I need full text search of volatile data, Id probably use Sphinx.

mysql - When to use MongoDB - Stack Overflow

mysql mongodb database-design relational-database database
Rectangle 27 9

What am I going to build my next app on? Probably Postgres. Will I use NoSQL? Maybe. I might also use Hadoop and Hive. I might keep everything in flat files. Maybe Ill start hacking on Maglev. Ill use whatever is best for the job. If I need reporting, I wont be using any NoSQL. If I need caching, Ill probably use Tokyo Tyrant. If I need ACIDity, I wont use NoSQL. If I need a ton of counters, Ill use Redis. If I need transactions, Ill use Postgres. If I have a ton of a single type of documents, Ill probably use Mongo. If I need to write 1 billion objects a day, Id probably use Voldemort. If I need full text search, Id probably use Solr. If I need full text search of volatile data, Id probably use Sphinx.

mysql - When to use MongoDB - Stack Overflow

mysql mongodb database-design relational-database database
Rectangle 27 15

If you just want the node closest to the text you're searching for, you could use this:

$('*:contains("my text"):last');
<p> blah blah <strong>my <em>text</em></strong></p>

Using the above selector will find the <strong> tag, since that's the last tag which contains that entire string.

@bzlm: well it didn't necessarily specify that he wanted to find multiple occurrences.

Aha. Is there a way to make it work for multiple occurrences? I think it's a more elegant solution than the ones involving recursive node type checking etc.

the only way i could think to get the all the nodes, but not all the ancestors up the line would be to loop through the result, removing all parents, though you could have problems, eg: <p>my text <b>my text</b></p> -- removing the ancestors of the <b> tag would lose the other match

Find text string using jQuery? - Stack Overflow

jquery text
Rectangle 27 3

Use Google desktop to index and full text search your source files.

language agnostic - How do you search through your own libraries of so...

language-agnostic
Rectangle 27 3

Use Google desktop to index and full text search your source files.

language agnostic - How do you search through your own libraries of so...

language-agnostic
Rectangle 27 3

You can't use full text search alone for this - it searches only for words. Here are a few different alternatives you could use:

You can use a full text search to quickly find candidate rows and then afterwords use a LIKE as you are already doing to filter out any false matches from the full text search.

  • You can normalize your database - store only one keyword per row. INSERT INTO `table1` (`id`, `tag`) VALUES (2222, 'keyword'), (2223, 'word is not big'), (2224, 'keyword3'), (2225, 'my keys'), (2226, 'hello'), -- // 2226 has three rows with one keyword in each. (2226, 'keyword3'), (2226, 'thanks'), (2227, 'hello'), -- etc...

This is a usually used as a join table against the main row of information in another table. It associates multiple tags with a single ID value. This is how storing lists of items per row is done in SQL.

php - Full text search - tag system problem - Stack Overflow

php mysql full-text-search
Rectangle 27 58

I am surprised that there isn't more information posted about Solr. Solr is quite similar to Sphinx but has more advanced features (AFAIK as I haven't used Sphinx -- only read about it).

Solr also provides the following additional features:

  • Multiple cores (think of these as separate databases with their own configuration and own indexes)
  • Highlighting of keywords (fairly easy to do in application code if you have regex-fu; however, why not let a specialized tool do a better job for you)
  • Update index via XML or delimited file
  • Communicate with the search server via HTTP (it can even return Json, Native PHP/Ruby/Python)
  • Index directly from the database with custom queries
  • Fast indexing (compare to MySQL full-text search indexing times) -- Lucene uses a binary inverted index format.
  • Boosting (custom rules for increasing relevance of a particular keyword or phrase, etc.)
  • Fielded searches (if a search user knows the field he/she wants to search, they narrow down their search by typing the field, then the value, and ONLY that field is searched rather than everything -- much better user experience)

BTW, there are tons more features; however, I've listed just the features that I have actually used in production. BTW, out of the box, MySQL supports #1, #3, and #11 (limited) on the list above. For the features you are looking for, a relational database isn't going to cut it. I'd eliminate those straight away.

Also, another benefit is that Solr (well, Lucene actually) is a document database (e.g. NoSQL) so many of the benefits of any other document database can be realized with Solr. In other words, you can use it for more than just search (i.e. Performance). Get creative with it :)

Sphinx too about Supports replication Multiple cores Boolean searches Highlighting of keywords Update index via XML -or delimited file- PDF, Word document indexing (via xml) Facets Stop words, synonyms, etc. Index directly from the database with custom queries Auto-suggest Fast indexing Boosting Fielded searches About Dynamic fields Aggregate fields Cache Autowarming I just don't know

Comparison of full text search engine - Lucene, Sphinx, Postgresql, My...

mysql postgresql full-text-search lucene sphinx
Rectangle 27 2

Although you can use regular expressions, you won't get good performance on full text search because a contains query such as /text/ cannot use an index.

If you are considering full text search on any large scale please consider MongoDB's Multi Key Search feature.

As of MongoDB v3.2 you can also use a text index.

mongoose - 'SQL 'like' statement in mongodb - Stack Overflow

mongodb mongoose
Rectangle 27 2

Although you can use regular expressions, you won't get good performance on full text search because a contains query such as /text/ cannot use an index.

If you are considering full text search on any large scale please consider MongoDB's Multi Key Search feature.

As of MongoDB v3.2 you can also use a text index.

mongoose - 'SQL 'like' statement in mongodb - Stack Overflow

mongodb mongoose
Rectangle 27 1

The full text index for this database is in use

Based on my experience this will occur for a while (maybe a few seconds) when the indexer task starts to index the database. If your users are not very demanding they can just try again and it will probably work.

But in many cases you want to minimize the errors the users get and will have to handle this error nicely. I've built my own FTSearch method which waits a bit and tries again until the error is not received. This will show as slowness to the user instead of error.

That's interesting - thanks. I'll have to see what the results are while the indexer task is starting.

Are there reasons why FTSearch would not be a suitable alternative to ...

xpages
Rectangle 27 2

CCK provides filters to the Views module, so you could use a view to at least come close to what you want (I don't know if a full text search is possible using this approach).

drupal.org itself uses Apache Solr Search Intergration. Apache Solr Search Intergration requires Apache Solr. If you do not do not have the means to set up Apache Solr (or do not want to for some other reasons), you can use an instance of Apache Solr provided by Acquia (called acquia search).

search on cck created content type on Drupal - Stack Overflow

drupal drupal-modules cck
Rectangle 27 9

What you want is a full context, not just the branch... which is generally out of scope for a version control tool. The best way to do that is to use multiple repositories.

Don't worry about the inefficiency of that though... Make your second repository a clone of the first. Git will automatically use links to avoid having multiple copies on disk.

Here's a hack to give you want you want

Since you have separate obj directories, you could modify your Makefiles to make the base location dynamic using something like this:

OBJBASE = `git branch --no-color 2> /dev/null | sed -e '/^[^*]/d' -e 's/* \(.*\)/\1\//'`
OBJDIR = "$(OBJBASE).obj"
# branch master: OBJBASE == "master/", OBJDIR == "master/.obj"
# non-git checkout: OBJBASE == "", OBJDIR == ".obj"

That will but your branch name into OBJBASE, which you can use to build your actual objdir location from. I'll leave it to you to modify it to fit your environment and make it friendly to non-git users of your Makefiles.

git and C++ workflow, how to handle object and archive files? - Stack ...

c++ git workflow
Rectangle 27 9

What you want is a full context, not just the branch... which is generally out of scope for a version control tool. The best way to do that is to use multiple repositories.

Don't worry about the inefficiency of that though... Make your second repository a clone of the first. Git will automatically use links to avoid having multiple copies on disk.

Here's a hack to give you want you want

Since you have separate obj directories, you could modify your Makefiles to make the base location dynamic using something like this:

OBJBASE = `git branch --no-color 2> /dev/null | sed -e '/^[^*]/d' -e 's/* \(.*\)/\1\//'`
OBJDIR = "$(OBJBASE).obj"
# branch master: OBJBASE == "master/", OBJDIR == "master/.obj"
# non-git checkout: OBJBASE == "", OBJDIR == ".obj"

That will but your branch name into OBJBASE, which you can use to build your actual objdir location from. I'll leave it to you to modify it to fit your environment and make it friendly to non-git users of your Makefiles.

git and C++ workflow, how to handle object and archive files? - Stack ...

c++ git workflow
Rectangle 27 1

After enabling Full Text search on my SQL 2005 server, I am using the following stored procedure to search for text.

ALTER PROCEDURE [dbo].[GetSimilarIssues] 
(
 @InputSearch varchar(255)
)
AS
BEGIN
-- SET NOCOUNT ON added to prevent extra result sets from
-- interfering with SELECT statements.
SET NOCOUNT ON;

DECLARE @SearchText varchar(500);

SELECT @SearchText = '"' + @InputSearch + '*"'

SELECT  PostId, Summary, [Description], 
Created
FROM Issue

WHERE FREETEXT (Summary, @SearchText);
END

What is the SQL used to do a search similar to "Related Questions" on ...

sql search text
Rectangle 27 1

If you are listing multiple fields in the match() operator and use Boolean mode and innodb table engine, then you need to have a multi-column fulltext index in place that covers the fields, as MySQL documentation on Boolean Full-Text Searches says:

InnoDB tables require a FULLTEXT index on all columns of the MATCH() expression to perform boolean queries. Boolean queries against a MyISAM search index can work even without a FULLTEXT index, although a search executed in this fashion would be quite slow.

full text search - MySQL FULLTEXT cant find index - Stack Overflow

mysql full-text-search fulltext-index
Rectangle 27 11

On web development you need to separate content, style and behavior. Describe why this is done and what different technologies you use in which layer. Every acronym should be written in full text on first time use. (10 p)

Describe what happens in a Web Browser (step by step) when a web page is transferred on the internet from a Web server through HyperText Transfer Protocol to a Client. Consider all the different technologies you have used in this course. (10 p)

java - Looking for a question that combines the understanding of few w...

java javascript html jsp servlets
Rectangle 27 8

The approach presented by John Coleman is what the interviewer was hoping for, in all probability. If you are willing to go quite a bit more complicated, you can increase expected skip length: Call the target value k. Start with the first element's value v at position p and call the difference k-v dv with absolute value av. To speed negative searches, have a peek at the last element as the other value u at position o: if dvdu is negative, k is present (if any occurrence of k is acceptable, you may narrow down the index range here the way binary search does). If av+au is greater than the length of the array, k is absent. (If dvdu is zero, v or u equals k.) Omitting index validity: Probe the ("next") position where the sequence might return to v with k in the middle: o = p + 2*av. If dvdu is negative, find k (recursively?) from p+av to o-au; if it is zero, u equals k at o. If du equals dv and the value in the middle isn't k, or au exceeds av, or you fail to find k from p+av to o-au, let p=o; dv=du; av=au; and keep probing. (For a full flash-back to '60ies texts, view with Courier. My "1st 2nd thought" was to use o = p + 2*av - 1, which precludes du equals dv.)

c - Efficient way to search an element - Stack Overflow

c algorithm sorting search