What are optimal approaches for infix substring search indexes when backed by an ordered key-value store?
up vote
0
down vote
favorite
I need to quickly substring search up to 500 million unique strings, each less than 256 chars in length. This needs to support substring matching ("bcd" in "abcde"); and I'll constantly be adding new/existing strings to the index.
What approaches to this problem may be best suited to taking advantage of the ordered nature of my backing key-value store (think leveldb, for instance)?
algorithm search indexing full-text-indexing
add a comment |
up vote
0
down vote
favorite
I need to quickly substring search up to 500 million unique strings, each less than 256 chars in length. This needs to support substring matching ("bcd" in "abcde"); and I'll constantly be adding new/existing strings to the index.
What approaches to this problem may be best suited to taking advantage of the ordered nature of my backing key-value store (think leveldb, for instance)?
algorithm search indexing full-text-indexing
add a comment |
up vote
0
down vote
favorite
up vote
0
down vote
favorite
I need to quickly substring search up to 500 million unique strings, each less than 256 chars in length. This needs to support substring matching ("bcd" in "abcde"); and I'll constantly be adding new/existing strings to the index.
What approaches to this problem may be best suited to taking advantage of the ordered nature of my backing key-value store (think leveldb, for instance)?
algorithm search indexing full-text-indexing
I need to quickly substring search up to 500 million unique strings, each less than 256 chars in length. This needs to support substring matching ("bcd" in "abcde"); and I'll constantly be adding new/existing strings to the index.
What approaches to this problem may be best suited to taking advantage of the ordered nature of my backing key-value store (think leveldb, for instance)?
algorithm search indexing full-text-indexing
algorithm search indexing full-text-indexing
asked Nov 11 at 11:31
Loki
4,05241833
4,05241833
add a comment |
add a comment |
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Stack Overflow!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53248294%2fwhat-are-optimal-approaches-for-infix-substring-search-indexes-when-backed-by-an%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown