Sciweavers

839 search results - page 39 / 168
» Ensemble-index: a new approach to indexing large databases
Sort
View
VLDB
2000
ACM
120views Database» more  VLDB 2000»
13 years 11 months ago
Integrating the UB-Tree into a Database System Kernel
Multidimensional access methods have shown high potential for significant performance improvements in various application domains. However, only few approaches have made their way...
Frank Ramsak, Volker Markl, Robert Fenk, Martin Zi...
SIGMOD
2002
ACM
219views Database» more  SIGMOD 2002»
14 years 7 months ago
Efficient k-NN search on vertically decomposed data
Applications like multimedia retrieval require efficient support for similarity search on large data collections. Yet, nearest neighbor search is a difficult problem in high dimen...
Arjen P. de Vries, Nikos Mamoulis, Niels Nes, Mart...
ICDE
2006
IEEE
127views Database» more  ICDE 2006»
14 years 9 months ago
Indexing for Dynamic Abstract Regions
for Dynamic Abstract Regions Joxan Jaffar Roland H.C. Yap School of Computing National University of Singapore 3 Science Drive 2, 117543, Singapore {joxan, ryap}@comp.nus.edu.sg Ke...
Joxan Jaffar, Roland H. C. Yap, Kenny Qili Zhu
DATESO
2010
233views Database» more  DATESO 2010»
13 years 5 months ago
Efficient Implementation of XPath Processor on Multi-Core CPUs
Abstract. Current XPath processors use direct approach to query evaluation which is quite inefficient in some cases and usually implemented serially. This may be a problem in case ...
Martin Krulis, Jakub Yaghob
CVPR
1997
IEEE
14 years 9 months ago
Shape Indexing Using Approximate Nearest-Neighbour Search in High-Dimensional Spaces
Shape indexing is a way of making rapid associations between features detected in an image and object models that could have produced them. When model databases are large, the use...
Jeffrey S. Beis, David G. Lowe