14 search results - page 2 / 3 » Sorting And Indexing With Partitioned B-Trees |
CORR
2010
Springer
13 years 6 days ago
2010
Springer
LRM-Trees are an elegant way to partition a sequence of values into sorted consecutive blocks, and to express the relative position of the first element of each block within a prev...
EDBT
2008
ACM
14 years 5 months ago
2008
ACM
Due to the well-known dimensionality curse problem, search in a high-dimensional space is considered as a "hard" problem. In this paper, a novel symmetrical encoding-bas...
ICDE
2007
IEEE
13 years 11 months ago
2007
IEEE
Similarity search usually encounters a serious problem in the high dimensional space, known as the “curse of dimensionality”. In order to speed up the retrieval efficiency, p...
ICDE
2004
IEEE
14 years 6 months ago
2004
IEEE
The effectiveness of many existing high-dimensional indexing structures is limited to specific types of queries and workloads. For example, while the Pyramid technique and the iMi...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
This paper proposes an efficient technique for partitioning large biometric database during identification. In this technique feature vector which comprises of global and local de...