Veretennikov Alexander Borisovich

Candidate of physics and mathematics (~Ph.D).

Research: search engines, full-text indexing.

Areas of interest: scripting languages, web applications development, information storage and management, enterprise content management, information management.

Ural Federal University, Chair of Calculation Mathematics and Computer Science, Associate Professor.

Mail: alexander@veretennikov.ru

https://www.linkedin.com/in/alexander-veretennikov

https://www.instagram.com/veretennikovab

https://www.youracclaim.com/users/alexander-veretennikov

Alexander is the author of 36 scientific papers (12 VAK) in total.

Selected Publications (partial list, important items are colored) are following:

Number Description File (Original) Comment File (En)
14
Veretennikov A.B. Relevance ranking for proximity full-text search based on additional indexes with multi-component keys, Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp'yuternye Nauki, 2021, vol. 31, issue 1, pp. 132-148.
https://doi.org/10.35634/vm210110
21-01-10.pdf
2021
379 152 bytes (0.36 MB)
Ru
Scopus, Web of Science, VAK
21-01-10-En.pdf
En
13
Veretennikov A.B. Selection of Optimal Parameters in the Fast K-Word Proximity Search Based on Multi-component Key Indexes. Supplementary Proceedings of the XXII International Conference on Data Analytics and Management in Data Intensive Domains (DAMDID/RCDL 2020), Voronezh, Russia, October 13-16, 2020, P. 336-350
http://ceur-ws.org/Vol-2790/
VeretennikovAB_2020_DAMDID.pdf
2020-10
768 334 bytes (0.73 MB)
En
CEUR, Scopus
VeretennikovAB_2020_DAMDID.pdf
En
12
Veretennikov A.B. (2021) An Improved Algorithm for Fast K-Word Proximity Search Based on Multi-component Key Indexes. In: Arai K., Kapoor S., Bhatia R. (eds) Intelligent Systems and Applications. IntelliSys 2020. Advances in Intelligent Systems and Computing, vol 1251. Springer, Cham.
https://doi.org/10.1007/978-3-030-55187-2_37
VeretennikovAB_2020_Intellisys.pdf
2020-09
702 094 bytes (0.67 MB)
En
SpringerLink, Scopus
VeretennikovAB_2020_Intellisys.pdf
En
11
Veretennikov A.B. (2020) Proximity Full-Text Searches of Frequently Occurring Words with a Response Time Guarantee. In: Pinelas S., Kim A., Vlasov V. (eds) Mathematical Analysis With Applications. CONCORD-90 2018. Springer Proceedings in Mathematics & Statistics, vol 318. Springer, Cham
https://doi.org/10.1007/978-3-030-42176-2_37
VeretennikovAB_2018_CONCORD.pdf
2020-05
218 535 bytes (0.21 MB)
En
SpringerLink, Scopus
VeretennikovAB_2018_CONCORD.pdf
En
10
Veretennikov A.B. (2019) Proximity Full-Text Search by Means of Additional Indexes with Multi-component Keys: In Pursuit of Optimal Performance. In: Manolopoulos Y., Stupnikov S. (eds) Data Analytics and Management in Data Intensive Domains. DAMDID/RCDL 2018. Communications in Computer and Information Science, vol 1003. Springer, Cham.
https://doi.org/10.1007/978-3-030-23584-0_7
VeretennikovAB_2019_DAMDID.pdf
2019-06
1 137 849 bytes (1.09 MB)
En
SpringerLink, Scopus
VeretennikovAB_2019_DAMDID.pdf
En
9
Veretennikov A.B. An efficient algorithm for three-component key index construction, Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp'yuternye Nauki, 2019, vol. 29, issue 1, pp. 117-132.
http://vm.udsu.ru/issues/archive/issue/2019-1-11
19-01-11.pdf
2019
808 051 bytes (0.77 MB)
Ru
Scopus, Web of Science, VAK
19-01-11-En.pdf
En
8
Veretennikov A.B. Proximity full-text search with a response time guarantee by means of additional indexes with multi-component keys. Selected Papers of the XX International Conference on Data Analytics and Management in Data Intensive Domains (DAMDID/RCDL 2018), Moscow, Russia, October 9-12 2018, 123-130 (2018)
http://ceur-ws.org/Vol-2277
DAMDID_2018.pdf
2018-10
2 102 603 bytes (2.01 MB)
En
CEUR, Scopus
DAMDID_2018.pdf
En
7
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
IntelliSys_2018_ProximityAddInd.pdf
2018-09
332 340 bytes (0.32 MB)
En
SpringerLink, Scopus
IntelliSys_2018_ProximityAddInd.pdf
En
6
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
6921-16554-1-PB.pdf
2018-03
529 618 bytes (0.51 MB)
Ru
VAK
5
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
clb8.pdf
2017-09
214 481 bytes (0.20 MB)
Ru
VAK
4
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/
alg4.pdf
2017-09
522 112 bytes (0.50 MB)
Ru
CEUR, Scopus
alg4en.pdf
En
3
Veretennikov A.B. Efficient Full-Text Search by Means of Additional Indexes of Frequently Used Words. Control Systems and Information Technologies. 2016. vol. 66, no. 4. pp. 52-60, In Russian.
clb7.pdf
2016-12
226 456 bytes (0.22 MB)
Ru
VAK
2
Veretennikov A.B. Creating additional indexes for fast full-text searching phrases that contains frequently used words. Control systems and information technologies. 2016. no. 1(63), pp. 27-33, In Russian.
clb6.pdf
2016-02
211 730 bytes (0.20 MB)
Ru
VAK
1
Veretennikov A. B. Using Additional Indexes for Fast Full-Text Searching Phrases that Contains Frequently Used Words. Control Systems and Information Technologies. 2013. vol. 52, no. 2. pp. 61-66, In Russian.
clb5.pdf
2013-06
132 148 bytes (0.13 MB)
Ru
VAK
clb5en.pdf
En