description: techniques for searching a single computer-stored document or a collection in a full text database
43 results
by Lars Wirzenius · 15 Jun 2012 · 32pp · 10,468 words
at least once. (“Be prepared to write a prototype, since you’ll make one anyway.”) For digital files, having a computer that can quickly do full text searches helps a lot. Indeed, you may be tempted to rely on search only, and if that works for you, great. However, there are files for
…
which full text search won’t work, such as images, audio, and video. Thus, it is probably best to put your digital, archived files in folders named using the
…
GSM prepaid/ Talk: Debconf 2010/ Three GSM prepaid/ Having only a single level of archive folders makes it easier to look for them manually, when full-text search is not available or isn’t good enough. If you create folders within folders, searching manually becomes at least an order of magnitude harder. Create
by Hans-Jurgen Schonig · 14 Oct 2014
B-trees gist: This is an index type for geometric searches (GIS data) and for KNN-search gin: This is an index type optimized for Full-Text Search (FTS) sp-gist: This is a space-partitioned gist As we mentioned before, each type of index serves different purposes. We highly encourage you to
…
query explain analyze statement / Tweaking work_mem explain commandusing / Understanding the concept of execution plans F Fedora 20 / Installing PostgreSQL on Red-Hat-based systems Full-Text Search (FTS) / Dealing with different types of indexes G generate_series functionabout / Preparing the data gin index typeabout / Dealing with different types of indexes gist index
by Addy Osmani · 21 Jul 2012 · 420pp · 79,867 words
the right thing. Collection.setFilter(filterFields, filterWords) - filter the current view. Filtering supports multiple words without any specific order, so you’ll basically get a full-text search ability. Also, you can pass it only one field from the model, or you can pass an array with fields and all of them will
by Miguel Grinberg · 12 May 2014 · 420pp · 61,808 words
Flask-Assets: Merging, minifying, and compiling of CSS and JavaScript assets Flask-OAuth: Authentication against OAuth providers Flask-OpenID: Authentication against OpenID providers Flask-WhooshAlchemy: Full-text search for Flask-SQLAlchemy models based on Whoosh Flask-KVsession: Alternative implementation of user sessions that use server-side storage If the functionality that you need
by Benjamin Bengfort, Rebecca Bilbro and Tony Ojeda · 10 Jun 2018 · 125pp · 27,675 words
we think of data management, the first thought is a database. Databases are certainly valuable tools in building language aware data products, and many provide full-text search functionality and other types of indexing. However, consider the fact that most databases are constructed to retrieve or update only a couple of rows per
by Tiago Macedo and Fred Oliveira · 26 Jul 2011 · 82pp · 17,229 words
data structure that stores mappings of words (or other content) to their locations in a file, document, database, etc. This is generally used to implement full text search, but it requires previous indexing of the documents to be searched. In this recipe, we’ll use Redis as the storage backend for a
…
full-text search implementation. Solution Our implementation will use one set per word, containing document IDs. In order to allow fast searches, we’ll index all the documents
by Jeff Geerling · 9 Oct 2015 · 313pp · 75,583 words
-devops, in the drupal directory. Real-world playbook: Ubuntu Apache Tomcat server with Solr Apache Solr is a fast and scalable search server optimized for full-text search, word highlighting, faceted search, fast indexing, and more. It’s a very popular search server, and it’s pretty easy to install and configure using
by Eric O'Neill · 1 Mar 2019 · 299pp · 88,375 words
my ACS manual as he passed my desk. “I still have my old access from the State Department that gives me full clearance through a full-text search. The account they gave us here doesn’t have full access.” He dropped the manual into my trash can. “An oversight I am certain they
…
whiteboard. “All the Russians have to do is recruit someone at the FBI with ACS access, feed him a name, and have the mole conduct full-text searches.” He jammed a finger against the 65A, smearing it across the whiteboard. “All that comes back is a 65A and a bucketload of x’s
…
to stop myself from punching him in the mouth. I swiveled my chair to the FBI NET computer and logged into ACS. I used the full-text search to enter a few names of targets I had ghosted into the system. ACS covered most of the information with x’s—but not everything
…
connection. All the Russians have to do is recruit someone at the FBI with ACS access, feed him a name, and have the mole conduct full-text searches. Why would a spy reveal such an enormous flaw? I conducted a few additional searches and then sat back with my hands steepled over my
by William Poundstone · 4 Jan 2012 · 260pp · 77,007 words
higher level of abstraction than Microsoft. “Google uses Bayesian filtering the way Microsoft uses the ‘if’ statement,” he said. That’s true. Google also uses full-text-search-of-the-entire-Internet the way Microsoft uses little tables that list what error IDs correspond to which help text. Look at how Google does
by Pieter Hintjens · 11 Mar 2013 · 349pp · 114,038 words
long to print and sites like Yahoo! organized them into categories. Then the category list got too large to keep updated, and Lycos invented the full-text search. This was too slow, so Digital Equipment Corporation built a natty search engine called Altavista to show how to do it properly. The results for
by Glyn Moody · 26 Sep 2022 · 295pp · 66,912 words
by Michael Snoyman · 22 Apr 2012 · 485pp · 74,211 words
by Sharon Bertsch McGrayne · 16 May 2011 · 561pp · 120,899 words
by Matt Copperwaite and Charles Leifer · 26 Nov 2015
by Toby Segaran · 17 Dec 2008 · 519pp · 102,669 words
by Pedro Gairifo Santos · 7 Nov 2011 · 353pp · 104,146 words
by Regina Obe and Leo Hsu · 5 Jul 2012 · 205pp · 47,169 words
by Unknown
by Rafal Kuc and Marek Rogozinski · 14 Aug 2013 · 480pp · 99,288 words
by Viktor Mayer-Schönberger · 1 Jan 2009 · 263pp · 75,610 words
by Simon Riggs and Hannu Krosing · 23 Oct 2010 · 360pp · 96,275 words
by Siva Vaidhyanathan · 1 Jan 2010 · 281pp · 95,852 words
by Gordon Bell and Jim Gemmell · 15 Feb 2009 · 291pp · 77,596 words
by Andrew Cumming and Gordon Russell · 28 Nov 2006 · 696pp · 111,976 words
by Tom White · 29 May 2009 · 933pp · 205,691 words
by Olivier Cure and Guillaume Blin · 10 Dec 2014
by Eric Redmond, Jim Wilson and Jim R. Wilson · 7 May 2012 · 713pp · 93,944 words
by Frank Zammetti · 7 Jul 2009 · 602pp · 207,965 words
by Jeff Forcier
by Ian F. Darwin · 9 Apr 2012 · 960pp · 140,978 words
by Stephane Faroult and Peter Robson · 2 Mar 2006 · 480pp · 122,663 words
by Unknown
by Jessica Livingston · 14 Aug 2008 · 468pp · 233,091 words
by Matt Behrens · 24 Jan 2015
by Anthony T. Holdener · 25 Jan 2008 · 982pp · 221,145 words
by Martin Kleppmann · 16 Mar 2017 · 1,237pp · 227,370 words
by W. Curtis Preston · 9 Feb 2009 · 1,266pp · 278,632 words
by Gary Price, Chris Sherman and Danny Sullivan · 2 Jan 2003 · 481pp · 121,669 words
by Martin Kleppmann · 17 Apr 2017
by Unknown · 13 Jan 2012 · 470pp · 109,589 words
by Matthew A. Russell · 15 Jan 2011 · 541pp · 109,698 words
by Doug Turnbull and John Berryman · 30 Apr 2016 · 593pp · 118,995 words
by Trey Grainger and Timothy Potter · 14 Sep 2014 · 1,085pp · 219,144 words