logo
calendar6 Dekabr 2019
view37
Main language:Uzbek

Algorithms and methods for indexing and compression in intelligent data search

Field of Science:
pdf

5de9f3cf507aa.pdf

PDF

Hisoblash va amaliy matematika muammolari

Hisoblash va amaliy matematika muammolari

Publish Articlesee more

ARTICLE ANNOTATION

quote
The paper shows the algorithms and methods for indexing, compression index in the intellectual search, in cases when it is not determined by the data structure. The author tells about the relationship of indexing devices hardware, indexing blocks to sort through, BSBI algorithm, indexing with one shift in the ROM, SPIMI algorithm, distributed indexing, MapReduce algorithm, dynamic indexing, algorithm logarithmic association, other indexing and the basis of security in indexing methods for SIIs. Also, describes laws Heaps and Zipf, compression indexes and files, estimated number of terms and modeling of distributed terms, static characteristics of terms and compression dictionary, saving on parts and front compression, encoding length with bytes and  – coding, as well methods their use in SII based on a study of mutual comparisons of features and recommendations for use.

AUTHORS

B.Mo'minov

Toshkent axborot texnologiyalari universiteti

Tags

# информация# термин# term# ma’lumot# ma’lumotlarni izlash# termin# indekslash# blokli va taqsimlangan indekslas# Dinamik indekslash# indekslarni siqish# uzunlik orqali baytli kodlash# VB algoritmi# information retrieval# data# indexing# distributed indexing# block indexing# dynamic indexing# compression index# sorted files compression coding# VB algorithm# поиск данных# индексация# распределённая индексация# блочная индексация# динамическая индексация# сжатие индексов# кодирование по длине с байтами# алгоритм VB

OTHER ARTICLES IN THIS JOURNAL

Rate Article

0
0 ratings
5
4
3
2
1

Article Identifiers

ROI:

https://eroi.uz/11.0007/A1219-0022

DOI:

Not Available

References

BSBI Algorithm. SlideWiki. [Электрон ресурс]. URL: http://slidewiki.org/deck/396 bsbi-algorithm.

Buttcher, S. Cormack. Information Retrieval: Implementing and Evaluating Search Engines / Stefan Buttcher, Charles L. A. Clarke, and Gordon V. - MIT Press, 2010. - 606 р.

Charles L. A. Clarke, Gordon V. Cormack. Dynamic Inverted Indexes for a Distributed Full-Text Retrieval System // MultiText Pro ject Technical Report MT-95-01. – University of Waterloo, Waterloo, Ontario N2L 3G1, Canada, 1995. – Pp. 556.

Cutting, D., Pedersen, J. Optimizations for dynamic inverted index maintenance / Jean-Luc Vidick. – NY, USA: ACM New York, 1990. – Vol. 2(30). - Pp. 405-411.

MapReduce – Algorithm. Tutorials point simply easy learning. [Электрон ресурс]. URL: http://www.tutorialspoint.com/map_reduce/map_reduce_ algorithm

Scoping SIG. Tokenization Taskforce PCI Security Standards Council. Info Supplement: PCI DSS Tokenization Guidelines. - 2011. - 23 р.

Трифонов А.А. Алгоритмы построения инвертированного индекса для коллекции текстовых данных // Известия высших учебных заведений. Поволжский регион. Технические науки. - 2013. - № 3 (27). – С. 52- 61.

Ralf Lammel. Google's MapReduce Programming Model – Revisited. "Data Programmability Team Microsoft Corp. Redmond, WA, USA. 2010. – Pp. 42.

Grossman, Frieder, Goharian. IR Basics of Inverted Index. – Google, Inc, 2002. – Pp. 274.

Single-pass in-memory indexing. The Stanford Natural Language Processing Group. e-Library. [Электрон ресурс]. URL: http://nlp.stanford.edu/ /htmledition/single-pass-in-memory-indexing-1.html

Skillicorn D. B. and Talia D. Models and languages for parallel computation. // ACM Computing Surveys. 1998. – Vol. 30(2). – Pp. 123-169.

Eric W. Brown. Execution Performance Issues in Full-Text Information Retrieval. Technical Report 95-81. – University of Massachusetts Amherst: Computer Science Department, 1996. - 179 р.

Thomas Hofmann. Probabilistic latent semantic indexing. In Proc. of the SKjHR99, Berkley, CA, USA, 1999. – Pp. 50-57.