Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with query
Search options not deleted
user 36079
Database and dataset queries, using existing query features with well identified criteria. If the criteria to find the data are unclear, the [search] tag is preferred.
2
votes
Is all permutations of a string a good way to index full text search?
The most common indexes are balanced trees, where finding a partial match at the beginning is easy. A filesystem is not a good backing structure for any index because of the high overhead (I understan …
- 151