{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:20:11Z","timestamp":1742912411672,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030602895"},{"type":"electronic","value":"9783030602901"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-60290-1_35","type":"book-chapter","created":{"date-parts":[[2020,10,13]],"date-time":"2020-10-13T21:02:30Z","timestamp":1602622950000},"page":"457-472","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Pipelined Query Processing Using Non-volatile Memory SSDs"],"prefix":"10.1007","author":[{"given":"Xinyu","family":"Liu","sequence":"first","affiliation":[]},{"given":"Yu","family":"Pan","sequence":"additional","affiliation":[]},{"given":"Wenxiu","family":"Fang","sequence":"additional","affiliation":[]},{"given":"Rebecca J.","family":"Stones","sequence":"additional","affiliation":[]},{"given":"Gang","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Yusen","family":"Li","sequence":"additional","affiliation":[]},{"given":"Xiaoguang","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,10,14]]},"reference":[{"issue":"2","key":"35_CR1","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1002\/spe.948","volume":"40","author":"VN Anh","year":"2010","unstructured":"Anh, V.N., Moffat, A.: Index compression using 64-bit words. Softw. Pract. Exp. 40(2), 131\u2013147 (2010)","journal-title":"Softw. Pract. Exp."},{"issue":"8","key":"35_CR2","first-page":"470","volume":"4","author":"N Ao","year":"2011","unstructured":"Ao, N., et al.: Efficient parallel lists intersection and index compression algorithms using graphics processing units. PVLDB 4(8), 470\u2013481 (2011)","journal-title":"PVLDB"},{"key":"35_CR3","doi-asserted-by":"crossref","unstructured":"Broder, A.Z., Carmel, D., Herscovici, M., Soffer, A., Zien, J.Y.: Efficient query evaluation using a two-level retrieval process. In: Proceedings of CIKM. pp. 426\u2013434 (2003)","DOI":"10.1145\/956863.956944"},{"key":"35_CR4","volume-title":"Information Retrieval-Implementing and Evaluating Search Engines","author":"S B\u00fcttcher","year":"2010","unstructured":"B\u00fcttcher, S., Clarke, C.L.A., Cormack, G.V.: Information Retrieval-Implementing and Evaluating Search Engines. MIT Press, Cambridge (2010)"},{"key":"35_CR5","first-page":"1","volume":"7","author":"BB Cambazoglu","year":"2015","unstructured":"Cambazoglu, B.B., Baeza-Yates, R.A.: Scalability challenges in web search engines. Synth. Lect. Inf. Concepts Retr. Serv. 7, 1\u2013138 (2015)","journal-title":"Synth. Lect. Inf. Concepts Retr. Serv."},{"issue":"3","key":"35_CR6","doi-asserted-by":"crossref","first-page":"15:1","DOI":"10.1145\/2516633.2516637","volume":"7","author":"BB Cambazoglu","year":"2013","unstructured":"Cambazoglu, B.B., Kayaaslan, E., Jonassen, S., Aykanat, C.: A term-based inverted index partitioning model for efficient distributed query processing. TWEB 7(3), 15:1\u201315:23 (2013)","journal-title":"TWEB"},{"key":"35_CR7","doi-asserted-by":"crossref","unstructured":"Cutting, D.R., Pedersen, J.O.: Optimizations for dynamic inverted index maintenance. In: Proceedings of SIGIR, pp. 405\u2013411 (1990)","DOI":"10.1145\/96749.98245"},{"key":"35_CR8","doi-asserted-by":"crossref","unstructured":"Ding, S., Suel, T.: Faster top-k document retrieval using block-max indexes. In: Proceedings of SIGIR, pp. 993\u20131002 (2011)","DOI":"10.1145\/2009916.2010048"},{"key":"35_CR9","doi-asserted-by":"crossref","unstructured":"Eisenman, A., et al.: Reducing DRAM footprint with NVM in Facebook. In: Proceedings of EuroSys, pp. 42:1\u201342:13 (2018)","DOI":"10.1145\/3190508.3190524"},{"key":"35_CR10","unstructured":"Eisenman, A., et al.: Bandana: using non-volatile memory for storing deep learning models. CoRR arxiv:1811.05922 (2018)"},{"issue":"1","key":"35_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/spe.2203","volume":"45","author":"D Lemire","year":"2015","unstructured":"Lemire, D., Boytsov, L.: Decoding billions of integers per second through vectorization. Softw. Pract. Exp. 45(1), 1\u201329 (2015)","journal-title":"Softw. Pract. Exp."},{"key":"35_CR12","doi-asserted-by":"crossref","unstructured":"Liu, X., Peng, Z.: An efficient random access inverted index for information retrieval. In: Proceedings of WWW, pp. 1153\u20131154 (2010)","DOI":"10.1145\/1772690.1772850"},{"issue":"1","key":"35_CR13","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1023\/A:1013002601898","volume":"3","author":"A Moffat","year":"2000","unstructured":"Moffat, A., Stuiver, L.: Binary interpolative coding for effective index compression. Inf. Retr. 3(1), 25\u201347 (2000)","journal-title":"Inf. Retr."},{"key":"35_CR14","doi-asserted-by":"crossref","unstructured":"Ottaviano, G., Tonellotto, N., Venturini, R.: Optimal space-time tradeoffs for inverted indexes. In: Proceedings of WSDM, pp. 47\u201356 (2015)","DOI":"10.1145\/2684822.2685297"},{"key":"35_CR15","doi-asserted-by":"crossref","unstructured":"Risvik, K.M., Chilimbi, T.M., Tan, H., Kalyanaraman, K., Anderson, C.: Maguro, a system for indexing and searching over very large text collections. In: Proceedings of WSDM, pp. 727\u2013736 (2013)","DOI":"10.1145\/2433396.2433486"},{"issue":"3","key":"35_CR16","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1002\/asi.4630270302","volume":"27","author":"SE Robertson","year":"1976","unstructured":"Robertson, S.E., Jones, K.S.: Relevance weighting of search terms. JASIS 27(3), 129\u2013146 (1976)","journal-title":"JASIS"},{"key":"35_CR17","doi-asserted-by":"crossref","unstructured":"Stepanov, A.A., Gangolli, A.R., Rose, D.E., Ernst, R.J., Oberoi, P.S.: SIMD-based decoding of posting lists. In: Proceedings of CIKM, pp. 317\u2013326 (2011)","DOI":"10.1145\/2063576.2063627"},{"issue":"6","key":"35_CR18","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1016\/0306-4573(95)00020-H","volume":"31","author":"HR Turtle","year":"1995","unstructured":"Turtle, H.R., Flood, J.: Query evaluation: strategies and optimizations. Inf. Process. Manag. 31(6), 831\u2013850 (1995)","journal-title":"Inf. Process. Manag."},{"key":"35_CR19","doi-asserted-by":"crossref","unstructured":"Wang, J., Lo, E., Yiu, M.L., Tong, J., Wang, G., Liu, X.: The impact of solid state drive on search engine cache management. In: Proceedings of SIGIR, pp. 693\u2013702 (2013)","DOI":"10.1145\/2484028.2484046"},{"key":"35_CR20","unstructured":"Xia, F., Jiang, D., Xiong, J., Sun, N.: HIKV: a hybrid index key-value store for DRAM-NVM memory systems. In: Proceedings of USENIX, pp. 349\u2013362 (2017)"},{"key":"35_CR21","unstructured":"Xu, J., Swanson, S.: NOVA: a log-structured file system for hybrid volatile\/non-volatile main memories. In: Proceedings of FAST, pp. 323\u2013338 (2016)"},{"key":"35_CR22","doi-asserted-by":"crossref","unstructured":"Yan, H., Ding, S., Suel, T.: Inverted index compression and query processing with optimized document ordering. In: Proceedings of WWW, pp. 401\u2013410 (2009)","DOI":"10.1145\/1526709.1526764"},{"key":"35_CR23","doi-asserted-by":"crossref","unstructured":"Zhang, J., Long, X., Suel, T.: Performance of compressed inverted list caching in search engines. In: Proceedings of WWW, pp. 387\u2013396 (2008)","DOI":"10.1145\/1367497.1367550"},{"key":"35_CR24","doi-asserted-by":"crossref","unstructured":"Zhang, R., Sun, P., Tong, J., Stones, R.J., Wang, G., Liu, X.: Compact snippet caching for flash-based search engines. In: Proceedings of SIGIR, pp. 1015\u20131018 (2015)","DOI":"10.1145\/2766462.2767764"},{"key":"35_CR25","doi-asserted-by":"crossref","unstructured":"Zukowski, M., H\u00e9man, S., Nes, N., Boncz, P.A.: Super-scalar RAM-CPU cache compression. In: Proceedings of ICDE (2006)","DOI":"10.1109\/ICDE.2006.150"}],"container-title":["Lecture Notes in Computer Science","Web and Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-60290-1_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T21:42:44Z","timestamp":1723758164000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-60290-1_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030602895","9783030602901"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-60290-1_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"14 October 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APWeb-WAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asia-Pacific Web (APWeb) and Web-Age Information Management (WAIM) Joint International Conference on Web and Big Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tianjin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 August 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 August 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apwebwaim2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.tjudb.cn\/apwebwaim2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Microsoft CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"259","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":"68","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":"37","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":"26% - 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":"4.6","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)"}},{"value":"Due to the COVID-19 pandemic the conference was organized as a fully online conference.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}