Multidimensional Search
Most algorithms and data structures for searching a dataset are based on the classical binary search algorithm, and generalizations such as the k-d tree or range tree work by interleaving the binary search algorithm over the separate coordinates and treating each spatial coordinate as an independent search constraint. These data structures are well-suited for range query problems asking for every point that satisfies and .
A limitation of these multidimensional search structures is that they are only defined for searching over objects that can be treated as vectors. They aren't applicable for the more general case in which the algorithm is given only a collection of objects and a function for measuring the distance or similarity between two objects. If, for example, someone were to create a function that returns a value indicating how similar one image is to another, a natural algorithmic problem would be to take a dataset of images and find the ones that are similar according to the function to a given query image.
Read more about this topic: Metric Tree
Famous quotes containing the word search:
“Adolescents are travelers, far from home with no native land, neither children nor adults. They are jet-setters who fly from one country to another with amazing speed. Sometimes they are four years old, an hour later they are twenty-five. They don’t really fit anywhere. There’s a yearning for place, a search for solid ground.”
—Mary Pipher (20th century)