{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T02:19:16Z","timestamp":1773886756552,"version":"3.50.1"},"reference-count":10,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1109\/bigdata47090.2019.9006219","type":"proceedings-article","created":{"date-parts":[[2020,2,25]],"date-time":"2020-02-25T06:05:34Z","timestamp":1582610734000},"page":"1066-1071","source":"Crossref","is-referenced-by-count":20,"title":["Pyramid: A General Framework for Distributed Similarity Search on Large-scale Datasets"],"prefix":"10.1109","author":[{"given":"Shiyuan","family":"Deng","sequence":"first","affiliation":[]},{"given":"Xiao","family":"Yan","sequence":"additional","affiliation":[]},{"given":"K.W. Ng","family":"Kelvin","sequence":"additional","affiliation":[]},{"given":"Chenyu","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"James","family":"Cheng","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.379"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"ref10","article-title":"Think locally, act globally: Perfectly balanced graph partitioning","author":"sanders","year":"2012","journal-title":"arXiv preprint arXiv 1210 0477"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2014.2321376"},{"key":"ref5","article-title":"Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs","author":"malkov","year":"2018","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"ref8","article-title":"Billion-scale similarity search with gpus","author":"johnson","year":"2017","journal-title":"arXiv preprint arXiv 1702 08734"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.14778\/2556549.2556574"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1975.224297"},{"key":"ref9","first-page":"4721","article-title":"Non-metric similarity graphs for maximum inner product search","author":"morozov","year":"2018","journal-title":"Advances in neural information processing systems"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2017.2699960"}],"event":{"name":"2019 IEEE International Conference on Big Data (Big Data)","location":"Los Angeles, CA, USA","start":{"date-parts":[[2019,12,9]]},"end":{"date-parts":[[2019,12,12]]}},"container-title":["2019 IEEE International Conference on Big Data (Big Data)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8986695\/9005444\/09006219.pdf?arnumber=9006219","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,17]],"date-time":"2022-07-17T21:53:06Z","timestamp":1658094786000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9006219\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12]]},"references-count":10,"URL":"https:\/\/doi.org\/10.1109\/bigdata47090.2019.9006219","relation":{},"subject":[],"published":{"date-parts":[[2019,12]]}}}