Horizontably Scalable LSM-tree Based Index for Full-Text Search Boolean Queries
Let there be a set of objects, where each object is characterized by Boolean features. Let logical query or Boolean query denote a query to find objects characterized by a Boolean function by features, for example, “documents with all words ...and any words ...and without words ...”. The terms “obje...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | Russian |
| Published: |
The Fund for Promotion of Internet media, IT education, human development «League Internet Media»
2022-03-01
|
| Series: | Современные информационные технологии и IT-образование |
| Subjects: | |
| Online Access: | http://sitito.cs.msu.ru/index.php/SITITO/article/view/848 |