Publications

NumberDescriptionFileCommentFile (En)
1
Веретенников А. Б., Лукач Ю. С. CLB-деревья: новый способ индексации больших массивов текстов. Международная алгебраическая конференция: К 100-летию со дня рождения П. Г. Конторовича и 70-летию Л. Н. Шеврина. Тез. докл. Екатеринбург: Изд-во Урал. ун-та, 2005, с. 173-175.

Verlukac.pdf
2005-08-23
44 489 bytes (0,04 MB)
 
2
Веретенников А. Б., Лукач Ю. С. Еще один способ индексации больших массивов текстов. Известия Уральского государственного университета. Серия «Компьютерные науки», 2006. №43. c. 103-122. (http://proceedings.usu.ru/).
http://hdl.handle.net/10995/24550

a08.pdf
2006
324 428 bytes (0,31 MB)
VAK 1
3
Веретенников А. Б. Эффективное создание текстовых индексов. Проблемы теоретической и прикладной математики: Труды 39-й Всероссийской молодежной конференции. Екатеринбург: УрО РАН, 2008. с. 348-350. (http://kungurka.imm.uran.ru/).

kung08s348.pdf
2008-01-30
59 565 bytes (0,06 MB)
 
4
Veretennikov, A.B. Sozdanie legko obnovlyaemykh tekstovykh indeksov [Creation of text indexes that are easy to update], Elektronnye biblioteki: perspektivnye metody i tekhnologii, elektronnye kollektsii: Trudy Desyatoi Vserossiiskoi nauchnoi konferentsii «RCDL'2008» [Proceedings of RCDL 2008: Tenth Russian Scientific Conference on Electronic Libraries: Promising Methods and Technologies, Electronic Collections], Dubna, 2008, pp. 149–154.
Author introduce a new data structure for fast indexing of large volumes of texts and a software system based on this structure. The latter is more effective for inserting data into indexes than other known data structures, and is comparable with them in the data retrieval.
149_154_paper16.pdf
2008-10-07
237 684 bytes (0,23 MB)
 
5
Веретенников А. Б. Новый подход к быстрому выделению памяти в программах на C++. Проблемы теоретической и прикладной математики: Труды 37-й Региональной молодежной конференции. Екатеринбург: УрО РАН, 2006, с. 413-417.

kung06s413.pdf
2006
70 221 bytes (0,07 MB)
 
6
Веретенников А. Б. Библиотека для создания оконных интерфейсов на любых скриптовых языках в операционной системе Windows. Информационно-математические технологии в экономике, технике и образовании: Тезисы докладов Третьей международной научной конференции. Екатеринбург: УГТУ-УПИ, 2008. с. 220-221.

wso_2008.rtf
2008-11-20
62 061 bytes (0,06 MB)
 
7
Veretennikov A.B. Effektivnaya indeksatsiya tekstovykh dokumentov s ispol'zovaniem CLB-derev'ev [Effective indexing of text documents by means of CLB trees], Sistemy upravleniya i informatsionnye tekhnologii [Control systems and information technologies], 2009, no. 1.1(35), pp. 134–139, In Russian
The problems of search in the large text arrays are considered and solved us-ing the new data structure proposed earlier by author, CLB-Tree. Theoretical estimations of efficiency and results of computer experiments are given.
clb2.rtf
2008-10-31
251 212 bytes (0,24 MB)
VAK 2
8
Веретенников А. Б. Гибкий подход к проблеме поиска похожих документов. Проблемы теоретической и прикладной математики: Труды 40-й Всероссийской молодежной конференции. Екатеринбург: УрО РАН, 2009. с. 392-396.

kungurka_2009.pdf
2009-02-02
125 533 bytes (0,12 MB)
 
9
Веретенников А. Б. Сравнение эффективности CLB-дерева в 32-битных и 64-битных архитектурах. Материалы межвузовской научной конференции по проблемам информатики «СПИСОК 2009». Екатеринбург. 2009. с. 7-13. (http://spisok.usu.ru/).

CLB_SPISOK_2009.rtf
2009-03-31
152 553 bytes (0,15 MB)
 
10
Веретенников А. Б. Размышление об использовании Treap при работе с неравномерно распределенными данными. Материалы межвузовской научной конференции по проблемам информатики «СПИСОК 2009». Екатеринбург. 2009. с. 14-18

Treaps.rtf
2009-03-31
143 504 bytes (0,14 MB)
 
11
Veretennikov A. B. Programmnyi kompleks i effektivnye metody organizatsii i indeksatsii bol'shikh massivov tekstov [Software and Effective Methods for Organizing and Indexing Large Text Collections], Cand. Sci. Dissertation, Yekaterinburg, 2009. (In Russian).

diss.pdf
2009-12-11
797 876 bytes (0,76 MB)
 
12
Веретенников А. Б. Программный комплекс и эффективные методы организации и индексации больших массивов текстов. Автореферат диссертации на соискание ученой степени кандидата физико-математических наук.
http://hdl.handle.net/10995/2338

veretennikov-autoref.pdf
2009-12-11
147 667 bytes (0,14 MB)
 
13
Веретенников А. Б. О методе оптимизации создания CLB-дерева. Проблемы теоретической и прикладной математики: Тезисы 41-й Всероссийской молодежной конференции. Екатеринбург: УрО РАН, 2010. с. 429-435.

Kungurka_2010.pdf
2010-06-12
71 869 bytes (0,07 MB)
 
14
Веретенников А. Б. О платформе для электронной текстовой библиотеки. Материалы конференции «Математическое моделирование, численные методы и комплексы программ». Екатеринбург: Изд-во Урал. Ун-та, 2010. с. 30-34.

KVM.pdf
2010-06-12
79 100 bytes (0,08 MB)
 
15
Veretennikov A. B. Theoretical research of the performance of CLB-Trees // Control Systems and Information Technologies. 2010. vol. 42, no. 4.1. pp. 123-128, In Russian.
The problems of search in the large text arrays are considered and solved using the new data structure proposed earlier by author, CLB-Tree. Theoretical estimations of efficiency and proofs are given.
clb3.pdf
2011-01-10
127 770 bytes (0,12 MB)
VAK 3
16
Веретенников А.Б. Метод организации индекса коллекции XML документов. Современные проблемы математики: тезисы 42-й Всероссийской молодежной школы-конференции. Екатеринбург: Институт математики и механики УрО РАН, 2011.

Kungurka_2011.pdf
2011-02-10
54 644 bytes (0,05 MB)
 
17
Veretennikov A. B. Polnotekstovyi indeks dlya chasto obnovlyayushchikhsya bibliotek [Full-text index for frequently updated libraries], Trudy 13-i Vserossiiskoi nauchnoi konferentsii «Elektronnye biblioteki: perspektivnye metody i tekhnologii, elektronnye kollektsii» - RCDL'2011 [Proceedings of RCDL 2011: Thirteenth Russian Scientific Conference on Electronic Libraries: Promising Methods and Technologies, Electronic Collections], Voronezh: Izd. Poligr. Tsentr VGU, 2011, pp. 157–163, In Russian.
Author introduce a new data structure for fast indexing of large volumes of texts and a software system based on this structure. The latter is more effective for inserting data into indexes than other known data structures, and is comparable with them in the data retrieval. An new approach for inserting small amount of new data given.
RCDL_2011.pdf
2011-10
170 035 bytes (0,16 MB)
 
18
Veretennikov A. B. Ob optimizatsii poiska fraz i naborov slov v polnotekstovom indekse [Optimizing the search for phrases and word sets in a full-text index], Sovremennye problemy matematiki. Tezisy Mezhdunarodnoi (43-i Vserossiiskoi) molodezhnoi shkoly-konferentsii [Current Mathematical Problems: Abstracts of the Proceedings of the 43th International Russian Young Scientists’ Conference), Yekaterinburg, 2012, pp. 203–205, In Russian.

Kungurka_2012.pdf
2012-02
55 468 bytes (0,05 MB)
 
19
Veretennikov A.B. O poiske fraz i naborov slov v polnotekstovom indekse [Searching for phrases and word sets in a full-text index], Sistemy upravleniya i informatsionnye tekhnologii [Control systems and information technologies], 2012, no. 2.1(48), pp. 125–130, in Russian.
The problems of searching phrases in the large text arrays are considered and solved using additional indexes.
clb4.pdf
2012-03
140 516 bytes (0,13 MB)
VAK 4
20
Veretennikov A. B. Ispol'zovanie dopolnitel'nykh indeksov dlya bolee bystrogo polnotekstovogo poiska fraz, vklyuchayushchikh chasto vstrechayushchiesya slova [Using Additional Indexes for Fast Full-Text Searching Phrases that Contains Frequently Used Words] Sistemy upravleniya i informatsionnye tekhnologii [Control Systems and Information Technologies]. 2013. vol. 52, no. 2. pp. 61-66, In Russian.
The problems of searching phrases in the large text arrays are considered and solved using additional indexes. With additional indexes we can perform search query more than ten times faster than with standard inverted files.
clb5.pdf
2013-06
132 148 bytes (0,13 MB)
VAK 5clb5en.pdf
21
Веретенников А.Б. Создание многопанельных интерфейсов программ на скриптовых языках // Вестник компьютерных и информационных технологий. 2016. № 2 (140). С. 28-33.
Scripting languages such as JavaScript are proven to be the effective way to build Web interfaces, but have limited features to build interfaces of Desktop applications. But a method to create complex user interfaces of the Desktop applications exists. For example we are considering the dockable windows interface. A user interface usually consists of some panels. The docking framework provides a way to change layout. The user can move panels by using drag and drop from one place to another and can change size of the panels. Dockable windows are used in the Microsoft Visual Studio and Eclipse. In this paper a docking framework for scripting languages, its model and API are presented. The goal is to develop as simple and concise API as possible. An implementation of the model is provided. Model itself is not dependent on the implementation. Building user interface using scripting languages have advantages described in the paper. Scripting languages are often referred to as glue languages or ever system integration languages. They are intended for connecting components developed with other languages. With scripting languages the system business logic can be isolated from the user interface. The user interface can be rapidly developed, supported and updated.
wso_2016.pdf
2016-02
796 022 bytes (0,76 MB)
VAK 6
22
Veretennikov A.B. Sozdanie dopolnitel'nykh indeksov dlya bolee bystrogo polnotekstovogo poiska fraz, vklyuchayushchikh chasto vstrechayushchiesya slova [Creating additional indexes for fast full-text searching phrases that contains frequently used words] // Sistemy upravleniya i informatsionnye tekhnologii [Control systems and information technologies]. 2016. no. 1(63), pp. 27-33, In Russian.
The problems of searching phrases in the large text arrays are considered and solved using additional indexes. With additional indexes we can perform search query more than ten times faster than with standard inverted files. Algorithms for creating additional indexes for frequently used words are described.
clb6.pdf
2016-02
211 730 bytes (0,20 MB)
VAK 7
23
Veretennikov A. B. O primenenii dopolnitel'nykh indeksov chasto vstrechayushchikhsya slov dlya polnotekstovogo poiska [Using additional indexes frequently used words for full-text search] // Analitika i upravlenie dannymi v oblastyakh s intensivnym ispol'zovaniem dannykh. XVIII Mezhdunarodnaya konferentsiya DAMDID / RCDL’2016 [Data Analytics and Management In Data Intensive Domains XVIII International Conference DAMDID / RCDL’2016]. 2016. pp. 217-224, In Russian
Different words can occur in texts with different frequency. We describe additional indexes, intended for speeding up search in case the search query contains frequently used words. We defined several groups of words and developed different methods for each group. Index writing optimization is given. In case of search query is a set of frequently used words a search algorithm explained.
DAMDID_2016.pdf
2016-10
365 425 bytes (0,35 MB)
 
24
Veretennikov A.B. Effektivnyi polnotekstovyi poisk s ispol'zovaniem dopolnitel'nykh indeksov chasto vstrechayushchikhsya slov [Efficient Full-Text Search by Means of Additional Indexes of Frequently Used Words] Sistemy upravleniya i informatsionnye tekhnologii [Control Systems and Information Technologies]. 2016. vol. 66, no. 4. pp. 52-60, In Russian.
Searches for phrases and word sets in large text arrays by means of additional indexes are considered. Their use may reduce the query processing time by an order of magnitude in comparison with standard indexes. Several search strategies described. Results of experiments are given.
clb7.pdf
2016-12
226 456 bytes (0,22 MB)
VAK 8
25
Vyacheslav E. Kopeytsev, Alexander B. Veretennikov. On the analysis of application algorithms using drivers in Windows 7-10 operating systems. Proceedings of the 48th International Youth School-Conference ''Modern Problems in Mathematics and its Applications''. P. 8-19
http://ceur-ws.org/Vol-1894/
This article about creation of system for application monitoring using Windows Driver Foundation. It describes tracing of operations with file system, network and registry, that can help to solve a wide range of tasks, from testing and analysis of input-output models to malware analysis. The document describes the architecture of this system, the methods used to solve the tasks. Also, given examples of problems, including those not previously described, as well as their solutions, some of which have been modified and improved for application in this task.
alg2.pdf
2017-09
458 291 bytes (0,44 MB)
Scopus
26
Alexander B. Veretennikov. About a structure of easily updatable full-text indexes). Proceedings of the 48th International Youth School-Conference ''Modern Problems in Mathematics and its Applications''. P. 30-41
http://ceur-ws.org/Vol-1894/
We consider strategies of organization easy updatable associative arrays in the external memory. These arrays are used for full-text search. We study indexes with different keys: single word form, two word forms, sequence of word forms. Structure of storage depends on the size of key's data. Results of the experiments are given in the context of the proximity full-text search by means of additional indexes.
alg4.pdf
2017-09
522 112 bytes (0,50 MB)
Scopus
27
Veretennikov A. B. Efficient full-text proximity search by means of three component keys // Control systems and information technologies, 2017, no. 3(69), pp. 25–32, In Russian
Searches for phrases and word sets in large text arrays by means of additional indexes are considered. Their use may reduce the query processing time by an order of magnitude in comparison with standard indexes. A new three compo-nent key based index has described. Results of experiments are given.
clb8.pdf
2017-09
214 481 bytes (0,20 MB)
VAK 9
28
Veretennikov A. B. Proximity full-text search with response time guarantee by means of three component keys // Bulletin of the South Ural State University. Series: Computational Mathematics and Software Engineering. 2018. vol. 7, no. 1. pp. 60–77. (in Russian)
http://dx.doi.org/10.14529/cmse180105
Searches for phrases and word sets in large text arrays by means of additional indexes are considered. A search result is a list of documents that contain specified words. A document which contains the query words near each other is more important. Such a tack required to store one posting per any word occurrence in a document. Some search systems use a list of stop words and exclude any information about a stop word from the index thus reducing search quality. In our paper we store information about all words to ensure search quality and build additional indexes for most frequently used words. Use of the additional indexes may reduce the query processing time by an order of magnitude and more in comparison with standard indexes. A new three component key based index has described. Results of search experiments are given and new search algorithm is provided. The results of the experiments shows 90 times improvement of search time for a class of queries containing most frequently used words in comparison with default inverted file.
6921-16554-1-PB.pdf
2018-03
529 618 bytes (0,51 MB)
VAK 10
29
Veretennikov A.B. (2019) Proximity Full-Text Search with a Response Time Guarantee by Means of Additional Indexes. In: Arai K., Kapoor S., Bhatia R. (eds) Intelligent Systems and Applications. IntelliSys 2018. Advances in Intelligent Systems and Computing, vol 868, pp 936-954. Springer, Cham
https://doi.org/10.1007/978-3-030-01054-6_66
Full-text search engines are important tools for information retrieval. Term proximity is an important factor in relevance score measurement. In a proximity full-text search, we assume that a relevant document contains query terms near each other, especially if the query terms are frequently occurring words. A methodology for high-performance full-text query execution is discussed. We build additional indexes to achieve better efficiency. For a word that occurs in the text, we include in the indexes some information about nearby words. What types of additional indexes do we use? How do we use them? These questions are discussed in this work. We present the results of experiments showing that the average time of search query execution is 44-45 times less than that required when using ordinary inverted indexes.
This is a pre-print of a contribution “Veretennikov A.B. Proximity Full-Text Search with a Response Time Guarantee by Means of Additional Indexes” published in “Arai K., Kapoor S., Bhatia R. (eds) Intelligent Systems and Applications. IntelliSys 2018. Advances in Intelligent Systems and Computing, vol 868” published by Springer, Cham. The final authenticated version is available online at: https://doi.org/10.1007/978-3-030-01054-6_66. The work was supported by Act 211 Government of the Russian Federation, contract № 02.A03.21.0006.
IntelliSys_2018_ProximityAddInd.pdf
2018-09
332 340 bytes (0,32 MB)
SpringerLinkIntelliSys_2018_ProximityAddInd.pdf

Presentations

DescriptionFileSizeHeaderTime
Веретенников А. Б. Эффективное создание текстовых индексов. Проблемы теоретической и прикладной математики: 39-я Всероссийская молодежная конференция. (http://kungurka.imm.uran.ru/). Презентация.Kungurka_2008.ppt47 616 bytes (0,05 MB)2008-01-30
Веретенников А. Б. Создание легко обновляемых текстовых индексов. RCDL'2008. Презентация.RCDL_2008_Veretennikov.ppt 117 248 bytes (0,11 MB)2008-10-07
Веретенников А. Б. Библиотека для создания оконных интерфейсов на любых скриптовых языках в операционной системе Windows. Информационно-математические технологии в экономике, технике и образовании: Третья международная научная конференция. Екатеринбург: УГТУ-УПИ, 2008. Презентация.wso_2008.ppt 185 856 bytes (0,18 MB)2008-11-20