{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T08:58:06Z","timestamp":1773392286975,"version":"3.50.1"},"reference-count":21,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/icde.2004.1320007","type":"proceedings-article","created":{"date-parts":[[2004,9,28]],"date-time":"2004-09-28T09:50:22Z","timestamp":1096365022000},"page":"313-324","source":"Crossref","is-referenced-by-count":29,"title":["Making the pyramid technique robust to query types and workloads"],"prefix":"10.1109","author":[{"given":"R.","family":"Zhang","sequence":"first","affiliation":[]},{"given":"B.C.","family":"Ooi","sequence":"additional","affiliation":[]},{"given":"K.-L.","family":"Tan","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","article-title":"A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces","author":"weber","year":"1998","journal-title":"VLDB"},{"key":"17","article-title":"The a-tree: An index structure for high-dimensional spaces using relative approximation","author":"sakurai","year":"2000","journal-title":"VLDB"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972726.18"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1145\/335168.335219"},{"key":"16","article-title":"The x-tree: An index structure for high-dimensional data","author":"berchtold","year":"1996","journal-title":"VLDB"},{"key":"13","article-title":"Hilbert r-tree: An improved r-tree using fractals","author":"kamel","year":"1994","journal-title":"VLDB"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1145\/253260.253347"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602266"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1145\/115790.115821"},{"key":"21","article-title":"Indexing the distance: An efficient method to knn processing","author":"yu","year":"2001","journal-title":"VLDB"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.1994.283046"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.1996.492202"},{"key":"2","year":"0"},{"key":"1","year":"0"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1007\/BF00962238"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276318"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2000.839456"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361007"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1145\/93597.98741"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1145\/564691.564729"},{"key":"8","article-title":"M-tree: An efficient access method for similarity search in metric spaces","author":"ciaccia","year":"1997","journal-title":"VLDB"}],"event":{"name":"Proceedings. 20th International Conference on Data Engineering","location":"Boston, MA, USA","acronym":"ICDE-04"},"container-title":["Proceedings. 20th International Conference on Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9217\/29235\/01320007.pdf?arnumber=1320007","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,14]],"date-time":"2017-03-14T12:59:44Z","timestamp":1489496384000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1320007\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/icde.2004.1320007","relation":{},"subject":[]}}