Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases
During the last decade, multimedia databases have become increasingly important in many
application areas such as medicine, CAD, geography, and molecular biology. An important …
application areas such as medicine, CAD, geography, and molecular biology. An important …
Feature-based similarity search in 3D object databases
The development of effective content-based multimedia search systems is an important
research issue due to the growing amount of digital audio-visual information. In the case of …
research issue due to the growing amount of digital audio-visual information. In the case of …
[图书][B] Similarity search: the metric space approach
The area of similarity searching is a very hot topic for both research and c-mercial
applications. Current data processing applications use data with c-siderably less structure …
applications. Current data processing applications use data with c-siderably less structure …
What is the nearest neighbor in high dimensional spaces?
Nearest neighbor search in high dimensional spaces is an interesting and important
problem which is relevant for a wide variety of novel database applications. As recent results …
problem which is relevant for a wide variety of novel database applications. As recent results …
3D shape histograms for similarity search and classification in spatial databases
M Ankerst, G Kastenmüller, HP Kriegel… - Advances in Spatial …, 1999 - Springer
Classification is one of the basic tasks of data mining in modern database applications
including molecular biology, astronomy, mechanical engineering, medical imaging or …
including molecular biology, astronomy, mechanical engineering, medical imaging or …
[图书][B] Experience management: foundations, development methodology, and internet-based applications
R Bergmann - 2002 - Springer
The central task for experience management is the retrieval of reusable experience. This
retrieval task requires additional knowledge besides the experience itself. It requires …
retrieval task requires additional knowledge besides the experience itself. It requires …
Optimal multi-step k-nearest neighbor search
T Seidl, HP Kriegel - Proceedings of the 1998 ACM SIGMOD …, 1998 - dl.acm.org
For an increasing number of modern database applications, efficient support of similarity
search becomes an important task. Along with the complexity of the objects such as images …
search becomes an important task. Along with the complexity of the objects such as images …
The pyramid-technique: Towards breaking the curse of dimensionality
S Berchtold, C Böhm, HP Kriegal - Proceedings of the 1998 ACM …, 1998 - dl.acm.org
In this paper, we propose the Pyramid-Technique, a new indexing method for high-
dimensional data spaces. The Pyramid-Technique is highly adapted to range query …
dimensional data spaces. The Pyramid-Technique is highly adapted to range query …
Nearest and reverse nearest neighbor queries for moving objects
R Benetis, CS Jensen, G Karĉiauskas, S Ŝaltenis - The VLDB Journal, 2006 - Springer
With the continued proliferation of wireless communications and advances in positioning
technologies, algorithms for efficiently answering queries about large populations of moving …
technologies, algorithms for efficiently answering queries about large populations of moving …
[PDF][PDF] MindReader: Querying databases through multiple examples
Y Ishikawa, R Subramanya, C Faloutsos - 1998 - kilthub.cmu.edu
Users often can not easily express their queries. For example, in a multimedia/image by
content setting, the user might want photographs with sunsets; in current systems, like QBIC …
content setting, the user might want photographs with sunsets; in current systems, like QBIC …