2121 search results - page 175 / 425 » Indexing Incomplete Databases |
290
click to vote
ICDE
1997
IEEE
16 years 7 months ago
1997
IEEE
Many emerging data mining applications require a similarity join between points in a high-dimensional domain. We present a new algorithm that utilizes a new index structure, calle...
175
click to vote
SSDBM
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract. We propose an original solution for the general reverse k-nearest neighbor (RkNN) search problem in Euclidean spaces. Compared to the limitations of existing methods for ...
144
click to vote
SISAP
2008
IEEE
16 years 23 days ago
2008
IEEE
Distance permutation indexes support fast proximity searching in high-dimensional metric spaces. Given some fixed reference sites, for each point in a database the index stores a...
147
click to vote
ISMIR
2005
Springer
15 years 12 months ago
2005
Springer
Audio search algorithms have reached a degree of speed and accuracy that allows them to search efficiently within large databases of audio. For speed, algorithms generally depend...
148
click to vote
VLDB
2005
ACM
15 years 12 months ago
2005
ACM
Existing work for query processing over graph data models often relies on pre-computing the transitive closure or path indexes. In this paper, we propose a family of stack-based a...