Method of Nearest Query Processing using the Spherical Pyramid-Technique

摘要

PURPOSE: A method for processing nearest query is provided to index high-dimensional data efficiently and to process a question of a spherical type used for similar search efficiently. CONSTITUTION: A nearest query process method comprises dividing a d-dimensional data space into 2d spherical pyramids(11), dividing the divided spherical pyramids into spherical segments(13), calculating the shortest distance between a query point and the spherical pyramid so as to be inserted in an order queue according to ascending power, extracting the first element of the order queue, calculating the shortest distance between a spherical segment in the spherical pyramid and the query point when the first extracted element is a spherical pyramid, to insert the spherical segment in the queue again, and returning an object to a result of the nearest query when the first extracted element is the object.