作者: Nimrod Megiddo , Uri Shaft
DOI:
关键词:
摘要: A method for determining k nearest-neighbors to a query point in database which an ordering is defined data set P of database, the being based on l one-dimensional codes C1, . , C1. single relation R created has attributes index-id, point-id and value. An entry (j,i,C.sub.ej (pi)) included each pi EP, where index-id equals j, i, value C.sub.ej (pi). B-tree index combination attribute attribute. received Q having One tuple generated j=1, l, j (q). distance d selected. The compared point. candidate selected when comparison less than d. Lower bounds are calculated cube plurality cubes that represent minimum between any Lastly, points as