Proximity Full-Text Searches of Frequently Occurring Words with a Response Time Guarantee

  • A. B. VeretennikovEmail author
Conference paper
Part of the Springer Proceedings in Mathematics & Statistics book series (PROMS, volume 318)


Full-text search engines are important tools for information retrieval. In a proximity full-text search, a document is relevant if it contains query terms near each other, especially if the query terms are frequently occurring 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. A search algorithm for the case when the query consists of high-frequently occurring words is discussed. In addition, we present results of experiments with different values of MaxDistance to evaluate the search speed dependence on the value of MaxDistance. These results show that the average time of the query execution with our indexes is 94.7–45.9 times (depending on the value of MaxDistance) less than that with standard inverted files when queries that contain high-frequently occurring words are evaluated.


Full-text search Search engines Inverted indexes Additional indexes Proximity search Term proximity Information retrieval 



The work was supported by Act 211 Government of the Russian Federation, contract no. 02.A03.21.0006.


  1. 1.
    Anh, V.N., de Kretser, O., Moffat, A.: Vector-Space ranking with effective early termination. In: SIGIR 2001 Proceedings of the 24th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, New Orleans, Louisiana, USA, pp. 35–42 (2001).
  2. 2.
    Bahle, D., Williams, H.E., Zobel, J.: Efficient phrase querying with an auxiliary index. In: SIGIR 2002 Proceedings of the 25th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Tampere, Finland, pp. 215–221 (2002).
  3. 3.
    Buttcher, S., Clarke, C., Lushman, B.: Term proximity scoring for ad-hoc retrieval on very large text collections. In: SIGIR 2006 Proceedings of the 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 621–622 (2006).
  4. 4.
    Garcia, S., Williams, H.E., Cannane, A.: Access-Ordered indexes. In: ACSC 2004 Proceedings of the 27th Australasian Conference on Computer Science, Dunedin, New Zealand, pp. 7–14 (2004)Google Scholar
  5. 5.
    Jansen, B.J., Spink, A., Saracevic, T.: Real life, real users and real needs: a study and analysis of user queries on the Web. Inf. Process. Manag. 36(2), 207–227 (2000). Scholar
  6. 6.
    Miller, R.B.: Response time in man-computer conversational transactions. AFIPS Fall Joint Computer Conference, San Francisco, California 33, 267–277 (1968). Scholar
  7. 7.
    Rasolofo, Y., Savoy, J.: Term proximity scoring for keyword-based retrieval systems. In: European Conference on Information Retrieval (ECIR) 2003: Advances in Information Retrieval, pp. 207–218 (2003). Scholar
  8. 8.
    Schenkel, R., Broschart, A., Hwang, S., Theobald, M., Weikum, G.: Efficient text proximity search. In: String Processing and Information Retrieval, 14th International Symposium, SPIRE 2007. Lecture Notes in Computer Science, vol. 4726, Santiago de Chile, Oct 29–31, pp. 287–299. Springer, Heidelberg (2007).
  9. 9.
    Tomasic, A., Garcia-Molina, H., Shoens, K.: Incremental updates of inverted lists for text document retrieval. In: SIGMOD ’94 Proceedings of the 1994 ACM SIGMOD International Conference on Management of Data, Minneapolis, Minnesota, 24–27 May 1994, pp. 289–300 (1994).
  10. 10.
    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, 7(1), 60–77 (2018). In Russian.
  11. 11.
    Veretennikov, A.B.: About phrases search in full-text index. Control Syst. Inf. Tech. 48(2.1), 125–130 (2012). In RussianGoogle Scholar
  12. 12.
    Veretennikov, A.B.: Using additional indexes for fast full-text searching phrases that contains frequently used words. Control Syst. Inf. Technol. 52(2), 61–66 (2013). In RussianMathSciNetGoogle Scholar
  13. 13.
    Veretennikov, A.B.: Efficient full-text search by means of additional indexes of frequently used words. Control Syst. Inf. Technol. 66(4), 52–60 (2016). In RussianGoogle Scholar
  14. 14.
    Veretennikov, A.B.: Creating additional indexes for fast full-text searching phrases that contains frequently used words. Control Syst. Inf. Technol. 63(1), 27–33 (2016). In RussianGoogle Scholar
  15. 15.
    Veretennikov, A.B.: About a structure of easy updatable full-text indexes. In: Proceedings of the 48th International Youth School-Conference “Modern Problems in Mathematics and its Applications”, CEUR-WS, 1894, pp. 30–41 (2017). In RussianGoogle Scholar
  16. 16.
    Veretennikov, A.B.: Efficient full-text proximity search by means of three component keys. Control Syst. Inf. Technol. 69(3), 25–32 (2017). In RussianGoogle Scholar
  17. 17.
    Williams, H.E., Zobel, J., Bahle, D.: Fast phrase querying with combined indexes. ACM Trans. Inf. Syst. (TOIS) 22(4), 573–594 (2004). Scholar
  18. 18.
    Williams, J.W.J.: Algorithm 232—Heapsort. Commun. ACM 7(6), 347–348 (1964)Google Scholar
  19. 19.
    Yan, H., Shi, S., Zhang, F., Suel, T., Wen, J.-R.: Efficient term proximity search with term-pair indexes. In: CIKM 2010 Proceedings of the 19th ACM International Conference on Information and Knowledge Management, Toronto, ON, Canada, pp. 1229–1238 (2010).
  20. 20.
    Zipf, G.: Relative frequency as a determinant of phonetic change. Harv. Stud. Class. Philol. 40, 1–95 (1929). Scholar
  21. 21.
    Zobel, J., Moffat, A.: Inverted files for text search engines. ACM Comput. Surv. 38(2) (2006). Article 6. Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  1. 1.Ural Federal UniversityYekaterinburgRussia
  2. 2.Chair of Calculation Mathematics and Computer Science, INSMYekaterinburgRussia

Personalised recommendations