{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:57:19Z","timestamp":1740099439289,"version":"3.37.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030235833"},{"type":"electronic","value":"9783030235840"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-23584-0_7","type":"book-chapter","created":{"date-parts":[[2019,7,3]],"date-time":"2019-07-03T10:03:41Z","timestamp":1562148221000},"page":"111-130","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Proximity Full-Text Search by Means of Additional Indexes with Multi-component Keys: In Pursuit of Optimal Performance"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3399-1889","authenticated-orcid":false,"given":"Alexander B.","family":"Veretennikov","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,4]]},"reference":[{"issue":"1","key":"7_CR1","doi-asserted-by":"publisher","first-page":"60","DOI":"10.14529\/cmse180105","volume":"7","author":"AB Veretennikov","year":"2018","unstructured":"Veretennikov, A.B.: Proximity full-text search with response time guarantee by means of three component keys. Bull. South Ural State Univ. Ser: Comput. Math. Softw. Eng. 7(1), 60\u201377 (2018). https:\/\/doi.org\/10.14529\/cmse180105 . (in Russian)","journal-title":"Bull. South Ural State Univ. Ser: Comput. Math. Softw. Eng."},{"key":"7_CR2","doi-asserted-by":"publisher","unstructured":"Buttcher, S., Clarke, C., Lushman, B.: Term proximity scoring for ad-hoc retrieval on very large text collections. In: SIGIR 2006, pp. 621\u2013622 (2006). https:\/\/doi.org\/10.1145\/1148170.1148285","DOI":"10.1145\/1148170.1148285"},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/3-540-36618-0_15","volume-title":"Lecture Notes in Computer Science","author":"Yves Rasolofo","year":"2003","unstructured":"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\u2013218 (2003). https:\/\/doi.org\/10.1007\/3-540-36618-0_15"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-540-75530-2_26","volume-title":"String Processing and Information Retrieval","author":"R Schenkel","year":"2007","unstructured":"Schenkel, R., Broschart, A., Hwang, S., Theobald, M., Weikum, G.: Efficient text proximity search. In: Ziviani, N., Baeza-Yates, R. (eds.) SPIRE 2007. LNCS, vol. 4726, pp. 287\u2013299. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75530-2_26"},{"key":"7_CR5","doi-asserted-by":"publisher","unstructured":"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, 26\u201330 October 2010, pp. 1229\u20131238 (2010). https:\/\/doi.org\/10.1145\/1871437.1871593","DOI":"10.1145\/1871437.1871593"},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/408772","volume":"40","author":"G Zipf","year":"1929","unstructured":"Zipf, G.: Relative frequency as a determinant of phonetic change. Harv. Stud. Class. Philol. 40, 1\u201395 (1929). https:\/\/doi.org\/10.2307\/408772","journal-title":"Harv. Stud. Class. Philol."},{"issue":"7","key":"7_CR7","doi-asserted-by":"publisher","first-page":"1082","DOI":"10.1016\/j.jss.2011.01.049","volume":"84","author":"RWP Luk","year":"2011","unstructured":"Luk, R.W.P.: Scalable, statistical storage allocation for extensible inverted file construction. J. Syst. Softw. 84(7), 1082\u20131088 (2011). https:\/\/doi.org\/10.1016\/j.jss.2011.01.049","journal-title":"J. Syst. Softw."},{"key":"7_CR8","doi-asserted-by":"publisher","unstructured":"Tomasic, A., Garcia-Molina, H., Shoens, K.: Incremental updates of inverted lists for text document retrieval. In: SIGMOD 1994 Proceedings of the 1994 ACM SIGMOD International Conference on Management of Data, Minneapolis, Minnesota, 24\u201327 May 1994, pp. 289\u2013300 (1994). https:\/\/doi.org\/10.1145\/191839.191896","DOI":"10.1145\/191839.191896"},{"issue":"2","key":"7_CR9","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1145\/1132956.1132959","volume":"38","author":"Justin Zobel","year":"2006","unstructured":"Zobel, J., Moffat, A.: Inverted files for text search engines. ACM Comput. Surv. 38(2), Article no. 6 (2006). https:\/\/doi.org\/10.1145\/1132956.1132959","journal-title":"ACM Computing Surveys"},{"key":"7_CR10","doi-asserted-by":"publisher","unstructured":"Miller, R.B.: Response time in man-computer conversational transactions. In: Proceedings: AFIPS Fall Joint Computer Conference. San Francisco, California, 09\u201311 December 1968, vol. 33, pp. 267\u2013277 (1968). https:\/\/doi.org\/10.1145\/1476589.1476628","DOI":"10.1145\/1476589.1476628"},{"key":"7_CR11","doi-asserted-by":"publisher","unstructured":"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, 9\u201312 September 2001, pp. 35\u201342 (2001). https:\/\/doi.org\/10.1145\/383952.383957","DOI":"10.1145\/383952.383957"},{"key":"7_CR12","unstructured":"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, 18\u201322 January 2004, pp. 7\u201314 (2004)"},{"key":"7_CR13","doi-asserted-by":"publisher","unstructured":"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, 11\u201315 August 2002, pp. 215\u2013221 (2002). https:\/\/doi.org\/10.1145\/564376.564415","DOI":"10.1145\/564376.564415"},{"issue":"4","key":"7_CR14","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1145\/1028099.1028102","volume":"22","author":"HE Williams","year":"2004","unstructured":"Williams, H.E., Zobel, J., Bahle, D.: Fast phrase querying with combined indexes. ACM Trans. Inf. Syst. (TOIS) 22(4), 573\u2013594 (2004). https:\/\/doi.org\/10.1145\/1028099.1028102","journal-title":"ACM Trans. Inf. Syst. (TOIS)"},{"key":"7_CR15","unstructured":"Veretennikov, A.B.: Proximity full-text search with a response time guarantee by means of additional indexes with multi-component keys. In: Selected Papers of the XX International Conference on Data Analytics and Management in Data Intensive Domains (DAMDID\/RCDL 2018), Moscow, Russia, 9\u201312 October 2018, pp. 123\u2013130 (2018). http:\/\/ceur-ws.org\/Vol-2277"},{"issue":"2.1","key":"7_CR16","first-page":"125","volume":"48","author":"AB Veretennikov","year":"2012","unstructured":"Veretennikov, A.B.: O poiske fraz i naborov slov v polnotekstovom indekse (About phrases search in full-text index). Control Syst. Inf. Technol. 48(2.1), 125\u2013130 (2012). (in Russian)","journal-title":"Control Syst. Inf. Technol."},{"issue":"3","key":"7_CR17","first-page":"25","volume":"69","author":"AB Veretennikov","year":"2017","unstructured":"Veretennikov, A.B.: Effektivnyi polnotekstovyi poisk s uchetom blizosti slov pri pomoshchi trekhkomponentnykh klyuchei (Efficient full-text proximity search by means of three component keys). Control Syst. Inf. Technol. 69(3), 25\u201332 (2017). (in Russian)","journal-title":"Control Syst. Inf. Technol."},{"issue":"2","key":"7_CR18","first-page":"61","volume":"52","author":"AB Veretennikov","year":"2013","unstructured":"Veretennikov, A.B.: Ispol\u2019zovanie dopolnitel\u2019nykh 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). Control Syst. Inf. Technol. 52(2), 61\u201366 (2013). (in Russian)","journal-title":"Control Syst. Inf. Technol."},{"issue":"4","key":"7_CR19","first-page":"52","volume":"66","author":"AB Veretennikov","year":"2016","unstructured":"Veretennikov, A.B.: Effektivnyi polnotekstovyi poisk s ispol\u2019zovaniem dopolnitel\u2019nykh indeksov chasto vstrechayushchikhsya slov (Efficient full-text search by means of additional indexes of frequently used words). Control Syst. Inf. Technol. 66(4), 52\u201360 (2016). (in Russian)","journal-title":"Control Syst. Inf. Technol."},{"issue":"1","key":"7_CR20","first-page":"27","volume":"63","author":"AB Veretennikov","year":"2016","unstructured":"Veretennikov, A.B.: Sozdanie dopolnitel\u2019nykh 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). Control Syst. Inf. Technol. 63(1), 27\u201333 (2016). (in Russian)","journal-title":"Control Syst. Inf. Technol."},{"key":"7_CR21","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"936","DOI":"10.1007\/978-3-030-01054-6_66","volume-title":"Intelligent Systems and Applications","author":"AB Veretennikov","year":"2019","unstructured":"Veretennikov, A.B.: Proximity full-text search with a response time guarantee by means of additional indexes. In: Arai, K., Kapoor, S., Bhatia, R. (eds.) IntelliSys 2018. AISC, vol. 868, pp. 936\u2013954. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-01054-6_66"},{"issue":"6","key":"7_CR22","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1145\/512274.512284","volume":"7","author":"JWJ Williams","year":"1964","unstructured":"Williams, J.W.J.: Algorithm 232 \u2013 Heapsort. Commun. ACM 7(6), 347\u2013348 (1964)","journal-title":"Commun. ACM"},{"issue":"2","key":"7_CR23","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/S0306-4573(99)00056-4","volume":"36","author":"BJ Jansen","year":"2000","unstructured":"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\u2013227 (2000). https:\/\/doi.org\/10.1016\/S0306-4573(99)00056-4","journal-title":"Inf. Process. Manag."}],"container-title":["Communications in Computer and Information Science","Data Analytics and Management in Data Intensive Domains"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-23584-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,9]],"date-time":"2021-01-09T15:02:52Z","timestamp":1610204572000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-23584-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030235833","9783030235840"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-23584-0_7","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"4 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DAMDID\/RCDL","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Data Analytics and Management in Data Intensive Domains","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Moscow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 October 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 October 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"damdid2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/damdid2018.frccsc.ru\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"54","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}