The infinite distance in the determination of the nearest Euclidean M-neighbours in the K-D-B tree.
Octavio Santana SuárezG. RodriguezMargarita Díaz RocaA. PlacidoPublished in: TAI (1989)
Keyphrases
- b tree
- euclidean distance
- index structure
- r tree
- data structure
- main memory
- concurrency control
- distance measure
- relational database systems
- distance function
- nearest neighbor
- join algorithms
- indexing techniques
- neural network
- query point
- tree structure
- spatial databases
- main memory databases
- access path
- dimensionality reduction
- data points
- similarity measure
- euclidean metric
- arbitrary length
- similarity search
- multi dimensional
- file organizations
- flash memory
- data sets