An efficient algorithm for three-component key index construction

A. B. Veretennikov

Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹûternye nauki, Tome 29 (2019) no. 1, pp. 117-132

Résumé

Proximity full-text searches in large text arrays are considered. A search query consists of several words. The search result is a list of documents containing these words. In a modern search system, documents that contain search query words that are near each other are more relevant than other documents. To solve this task, for each word in each indexed document, we need to store a record in the index. In this case, the query search time is proportional to the number of occurrences of the queried words in the indexed documents. Consequently, it is common for search systems to evaluate queries that contain frequently occurring words much more slowly than queries that contain less frequently occurring, ordinary words. For each word in the text, we use additional indexes to store information about nearby words at distances from the given word of less than or equal to $MaxDistance$, which is a parameter. This parameter can take a value of 5, 7, or even more. Three-component key indexes can be created for faster query execution. Previously, we presented the results of experiments showing that, when queries contain very frequently occurring words, the average time of the query execution with three-component key indexes is 94.7 times less than that required when using ordinary inverted indexes. In the current work, we describe a new three-component key index building algorithm. We prove the correctness of the algorithm. We present the results of experiments of the index creation depending on the value of $MaxDistance$.

Détail

Keywords: full-text search, search engines, inverted files, additional indexes, proximity search, three-component key indexes.

Bibliographie

[1] Veretennikov A. B., “Proximity full-text search with response time guarantee by means of three component keys”, Bulletin of the South Ural State University. Ser. Computational Mathematics and Software Engineering, 7:1 (2018), 60–77 (in Russian) | DOI

[2] Yan H., Shi S., Zhang F., Suel T., Wen J.-R., “Efficient term proximity search with term-pair indexes”, Proceedings of the 19th ACM International Conference on Information and Knowledge Management, CIKM'10 (Toronto, Canada, 2010), 1229–1238 | DOI | Zbl

[3] Buttcher S., Clarke C., Lushman B., “Term proximity scoring for ad-hoc retrieval on very large text collections”, Proceedings of the 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR'06 (Seattle, USA, 2006), 621–622 | DOI

[4] Rasolofo Y., Savoy J., “Term proximity scoring for keyword-based retrieval systems”, European Conference on Information Retrieval (ECIR'2003): Advances in Information Retrieval, 2003, 207–218 | DOI | Zbl

[5] Zobel J., Moffat A., “Inverted files for text search engines”, ACM Computing Surveys, 38:2 (2006), 6 | DOI

[6] Tomasic A., Garcia-Molina H., Shoens K., “Incremental updates of inverted lists for text document retrieval”, Proceedings of the 1994 ACM SIGMOD International Conference on Management of Data, SIGMOD'94 (Minneapolis, Minnesota, USA, 1994), 289–300 | DOI

[7] Brown E. W., Callan J. P., Croft W. B., “Fast incremental indexing for full-text information retrieval”, Proceedings of the 20th International Conference on Very Large Data Bases, VLDB'94 (Santiago de Chile, Chile, 1994), 192–202

[8] Luk R. W.P., “Scalable, statistical storage allocation for extensible inverted file construction”, Journal of Systems and Software, 84:7 (2011), 1082–1088 | DOI

[9] Zipf G., “Relative frequency as a determinant of phonetic change”, Harvard Studies in Classical Philology, 40 (1929), 1–95 | DOI

[10] Miller R. B., “Response time in man-computer conversational transactions”, Proceedings of the Fall Joint Computer Conference, AFIPS'68 (December 9–11, 1968, San Francisco, California), v. I, 267–277 | DOI

[11] Veretennikov A. B., “Using additional indexes for fast full-text searching phrases that contains frequently used words”, Sistemy Upravleniya i Informatsionnye Tekhnologii, 52:2 (2013), 61–66 (in Russian) | MR

[12] Veretennikov A. B., “Efficient full-text search by means of additional indexes of frequently used words”, Sistemy Upravleniya i Informatsionnye Tekhnologii, 66:4 (2016), 52–60 (in Russian)

[13] Anh V. N., de Kretser O., Moffat A., “Vector-space ranking with effective early termination”, Proceedings of the 24th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR'01 (New Orleans, Louisiana, USA, 2001), 35–42 | DOI

[14] Garcia S., Williams H. E., Cannane A., “Access-ordered indexes”, Proceedings of the 27th Australasian Conference on Computer Science, ACSC'04 (Dunedin, New Zealand, 2004), 7–14

[15] Williams H. E., Zobel J., Bahle D., “Fast phrase querying with combined indexes”, ACM Transactions on Information Systems (TOIS), 22:4 (2004), 573–594 | DOI

[16] Veretennikov A. B., “Efficient full-text proximity search by means of three component keys”, Sistemy Upravleniya i Informatsionnye Tekhnologii, 69:3 (2017), 25–32 (in Russian)

[17] Veretennikov A. B., “About a structure of easy updatable full-text indexes”, Proceedings of the International Youth School–Conference “SoProMat-2017” (Yekaterinburg, Russia, 2017), CEUR Workshop Proceedings, 1894, 30–41 (in Russian)

[18] Lu X., Moffat A., Culpepper J. S., “Efficient and effective higher order proximity modeling”, Proceedings of the 2016 ACM International Conference on the Theory of Information Retrieval, ICTIR'16 (Newark, Delaware, USA, 2016), 21–30 | DOI