{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T12:41:23Z","timestamp":1781613683172,"version":"3.54.5"},"reference-count":31,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"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,2]]},"DOI":"10.1109\/bigcomp.2019.8679353","type":"proceedings-article","created":{"date-parts":[[2019,4,5]],"date-time":"2019-04-05T03:03:38Z","timestamp":1554433418000},"page":"1-8","source":"Crossref","is-referenced-by-count":2,"title":["P-Index: A Novel Index Based on Prime Factorization for Similarity Search"],"prefix":"10.1109","author":[{"given":"Jianquan","family":"Liu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shoji","family":"Nishimura","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Takuya","family":"Araki","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-010-0303-2"},{"key":"ref30","first-page":"38","article-title":"Ueber einen Mittelwertsatz","author":"h\u00f6lder","year":"1889","journal-title":"Gött Nachr"},{"key":"ref10","first-page":"437","article-title":"An efficient algorithm for reverse furthest neighbors query with metric index","author":"liu","year":"2010","journal-title":"DEXA"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2011.130"},{"key":"ref12","first-page":"60","article-title":"An efficient algorithm for arbitrary reverse furthest neighbor queries","author":"liu","year":"2012","journal-title":"APWeb"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/971697.602266"},{"key":"ref14","first-page":"507","article-title":"The r+-tree: A dynamic index for multi-dimensional objects","author":"sellis","year":"1987","journal-title":"VLDB"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/93597.98741"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/BF00288933"},{"key":"ref17","first-page":"559","article-title":"On lines and planes of closest fit to systems of points in space","volume":"2","author":"pearson","year":"1901","journal-title":"Philosophical Magazine"},{"key":"ref18","year":"1966","journal-title":"A Computer Oriented Geodetic Data Base and a New Technique in File Sequencing"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/BF01199431"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497441"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3035934"},{"key":"ref3","first-page":"69","article-title":"Efficient similarity search in sequence databases","author":"agrawal","year":"1993","journal-title":"FODO"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/MDM.2011.41"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/320248.320255"},{"key":"ref5","first-page":"563","article-title":"Quality and efficiency in high dimensional nearest neighbor search","author":"tao","year":"2009","journal-title":"SIGMOD Conference"},{"key":"ref29","first-page":"145","article-title":"An extension of a certain theorem in inequalities","volume":"xvii","author":"rogers","year":"1887","journal-title":"MESS"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453970"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142531"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1348246.1348248"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.62"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2004.1315035"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/373626.373678"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453861"},{"key":"ref21","first-page":"194","article-title":"A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces","author":"weber","year":"1998","journal-title":"VLDB"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-004-0149-6"},{"key":"ref26","first-page":"263","article-title":"Integrating the ub-tree into a database system kernel","author":"ramsak","year":"2000","journal-title":"VLDB"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.49"}],"event":{"name":"2019 IEEE International Conference on Big Data and Smart Computing (BigComp)","location":"Kyoto, Japan","start":{"date-parts":[[2019,2,27]]},"end":{"date-parts":[[2019,3,2]]}},"container-title":["2019 IEEE International Conference on Big Data and Smart Computing (BigComp)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8671661\/8678915\/08679353.pdf?arnumber=8679353","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,15]],"date-time":"2022-07-15T03:09:31Z","timestamp":1657854571000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8679353\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/bigcomp.2019.8679353","relation":{},"subject":[],"published":{"date-parts":[[2019,2]]}}}