{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:22:44Z","timestamp":1759638164003,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":13,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,3,21]],"date-time":"2011-03-21T00:00:00Z","timestamp":1300665600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,3,21]]},"DOI":"10.1145\/1938551.1938584","type":"proceedings-article","created":{"date-parts":[[2011,2,8]],"date-time":"2011-02-08T13:21:09Z","timestamp":1297171269000},"page":"256-267","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Detecting and exploiting near-sortedness for efficient relational query evaluation"],"prefix":"10.1145","author":[{"given":"Sagi","family":"Ben-Moshe","sequence":"first","affiliation":[{"name":"Technion"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yaron","family":"Kanza","sequence":"additional","affiliation":[{"name":"Technion"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eldar","family":"Fischer","sequence":"additional","affiliation":[{"name":"Technion"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arie","family":"Matsliah","sequence":"additional","affiliation":[{"name":"Technion"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mani","family":"Fischer","sequence":"additional","affiliation":[{"name":"HP Labs"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carl","family":"Staelin","sequence":"additional","affiliation":[{"name":"HP Labs"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,3,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.v31:3"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1692"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1142\/9789812562494_0014"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509977"},{"key":"e_1_3_2_1_5_1","volume-title":"Database Systems","author":"Garcia-Molina H.","year":"2009","unstructured":"H. Garcia-Molina , J. D. Ullman , and J. Widom . Database Systems . Prentice Hall , New Jersey , 2009 . H. Garcia-Molina, J. D. Ullman, and J. Widom. Database Systems. Prentice Hall, New Jersey, 2009."},{"key":"e_1_3_2_1_6_1","volume-title":"Addison Wesley","author":"Knuth D. E.","year":"1998","unstructured":"D. E. Knuth . The art of Computer Programming . Addison Wesley , third edition, 1998 . D. E. Knuth. The art of Computer Programming. Addison Wesley, third edition, 1998."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276346"},{"key":"e_1_3_2_1_8_1","volume-title":"An open-source tpc-c implementation for global performance measurement of computer systems","author":"Llanos D. R.","year":"2006","unstructured":"D. R. Llanos . Tpcc-uva : An open-source tpc-c implementation for global performance measurement of computer systems . 2006 . ISSN 0163-5808. D. R. Llanos. Tpcc-uva: An open-source tpc-c implementation for global performance measurement of computer systems. 2006. ISSN 0163-5808."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2006.03.002"},{"key":"e_1_3_2_1_10_1","volume-title":"Handbook of Randomized Computing","author":"Ron D.","year":"2001","unstructured":"D. Ron . Property testing (a tutorial) . In Handbook of Randomized Computing . Kluwer Press , 2001 . D. Ron. Property testing (a tutorial). In Handbook of Randomized Computing. Kluwer Press, 2001."},{"key":"e_1_3_2_1_11_1","first-page":"1095","volume-title":"International Congress of Mathematicians","author":"Rubinfeld R.","year":"2006","unstructured":"R. Rubinfeld . Sublinear time algorithms . In International Congress of Mathematicians , volume III , pages 1095 -- 1110 . EMS, 2006 . R. Rubinfeld. Sublinear time algorithms. In International Congress of Mathematicians, volume III, pages 1095--1110. EMS, 2006."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45198-3_26"},{"key":"e_1_3_2_1_13_1","volume-title":"Technical Report HPL-2002-352","author":"Staelin C.","year":"2002","unstructured":"C. Staelin . Disk I\/O in Linux . Technical Report HPL-2002-352 , Hewlett-Packard Laboratories , 2002 . C. Staelin. Disk I\/O in Linux. Technical Report HPL-2002-352, Hewlett-Packard Laboratories, 2002."}],"event":{"name":"EDBT\/ICDT '11: EDBT\/ICDT '11 joint conference","acronym":"EDBT\/ICDT '11","location":"Uppsala Sweden"},"container-title":["Proceedings of the 14th International Conference on Database Theory"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1938551.1938584","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1938551.1938584","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:52:55Z","timestamp":1750243975000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1938551.1938584"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3,21]]},"references-count":13,"alternative-id":["10.1145\/1938551.1938584","10.1145\/1938551"],"URL":"https:\/\/doi.org\/10.1145\/1938551.1938584","relation":{},"subject":[],"published":{"date-parts":[[2011,3,21]]},"assertion":[{"value":"2011-03-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}