{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:24:59Z","timestamp":1750307099729,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,10,29]],"date-time":"2012-10-29T00:00:00Z","timestamp":1351468800000},"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":[[2012,10,29]]},"DOI":"10.1145\/2396761.2398594","type":"proceedings-article","created":{"date-parts":[[2012,11,15]],"date-time":"2012-11-15T16:38:00Z","timestamp":1352997480000},"page":"2164-2168","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["A positional access method for relational databases"],"prefix":"10.1145","author":[{"given":"Dongzhe","family":"Ma","sequence":"first","affiliation":[{"name":"Tsinghua University, Beijing, China"}]},{"given":"Jianhua","family":"Feng","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}]},{"given":"Guoliang","family":"Li","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}]}],"member":"320","published-online":{"date-parts":[[2012,10,29]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Berkeley DB. http:\/\/www.oracle.com.  Berkeley DB. http:\/\/www.oracle.com."},{"key":"e_1_3_2_1_2_1","unstructured":"Counted B-Trees. http:\/\/www.chiark.greenend.org.uk\/~sgtatham\/algorithms\/cbtree.html.  Counted B-Trees. http:\/\/www.chiark.greenend.org.uk\/~sgtatham\/algorithms\/cbtree.html."},{"key":"e_1_3_2_1_3_1","unstructured":"Vertica. http:\/\/www.vertica.com.  Vertica. http:\/\/www.vertica.com."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376712"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/645930.672850"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1734663.1734671"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/356770.356776"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/971699.318923"},{"key":"e_1_3_2_1_10_1","volume-title":"CIDR","author":"Graefe G.","year":"2003","unstructured":"G. Graefe . Sorting and Indexing with Partitioned B-Trees . In CIDR , 2003 . G. Graefe. Sorting and Indexing with Partitioned B-Trees. In CIDR, 2003."},{"key":"e_1_3_2_1_11_1","volume-title":"Transaction Processing: Concepts and Techniques","author":"Gray J.","year":"1993","unstructured":"J. Gray and A. Reuter . Transaction Processing: Concepts and Techniques . Elsevier , 1993 . J. Gray and A. Reuter. Transaction Processing: Concepts and Techniques. Elsevier, 1993."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807227"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559878"},{"key":"e_1_3_2_1_14_1","volume-title":"Vol 3: Sorting and Searching","author":"Knuth D. E.","year":"1998","unstructured":"D. E. Knuth . The Art of Computer Programming , Vol 3: Sorting and Searching . Addison-Wesley , 1998 . D. E. Knuth. The Art of Computer Programming, Vol 3: Sorting and Searching. Addison-Wesley, 1998."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1994.2209"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002360050048"},{"key":"e_1_3_2_1_17_1","volume-title":"Principles of Distributed Database Systems","author":"\u00d6zsu M. T.","year":"1999","unstructured":"M. T. \u00d6zsu and P. Valduriez . Principles of Distributed Database Systems . Prentice-Hall, Inc. , 1999 . M. T. \u00d6zsu and P. Valduriez. Principles of Distributed Database Systems. Prentice-Hall, Inc., 1999."},{"key":"e_1_3_2_1_18_1","volume-title":"VLDB","author":"Stonebraker M.","year":"2005","unstructured":"M. Stonebraker , D. J. Abadi , A. Batkin , : A Column-Oriented DBMS . In VLDB , 2005 . M. Stonebraker, D. J. Abadi, A. Batkin, et al. C-Store: A Column-Oriented DBMS. In VLDB, 2005."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/357431.357433"},{"key":"e_1_3_2_1_20_1","unstructured":"S. Tatham. An Efficient Data Structure for A Hex Editor. http:\/\/www.chiark.greenend.org.uk\/~sgtatham\/tweak\/btree.html.  S. Tatham. An Efficient Data Structure for A Hex Editor. http:\/\/www.chiark.greenend.org.uk\/~sgtatham\/tweak\/btree.html."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/235968.233325"}],"event":{"name":"CIKM'12: 21st ACM International Conference on Information and Knowledge Management","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Maui Hawaii USA","acronym":"CIKM'12"},"container-title":["Proceedings of the 21st ACM international conference on Information and knowledge management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2396761.2398594","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2396761.2398594","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:34:50Z","timestamp":1750239290000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2396761.2398594"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,29]]},"references-count":20,"alternative-id":["10.1145\/2396761.2398594","10.1145\/2396761"],"URL":"https:\/\/doi.org\/10.1145\/2396761.2398594","relation":{},"subject":[],"published":{"date-parts":[[2012,10,29]]},"assertion":[{"value":"2012-10-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}