Sciweavers

431 search results - page 25 / 87
» KPYR: An Efficient Indexing Method
Sort
View
VLDB
1997
ACM
141views Database» more  VLDB 1997»
14 years 26 days ago
Efficient User-Adaptable Similarity Search in Large Multimedia Databases
Efficient user-adaptable similarity search more and more increases in its importance for multimedia and spatial database systems. As a general similarity model for multi-dimension...
Thomas Seidl, Hans-Peter Kriegel
DEXA
2008
Springer
155views Database» more  DEXA 2008»
13 years 10 months ago
NM-Tree: Flexible Approximate Similarity Search in Metric and Non-metric Spaces
So far, an efficient similarity search in multimedia databases has been carried out by metric access methods (MAMs), where the utilized similarity measure had to satisfy the metric...
Tomás Skopal, Jakub Lokoc
CORR
2010
Springer
138views Education» more  CORR 2010»
13 years 8 months ago
On building minimal automaton for subset matching queries
We address the problem of building an index for a set D of n strings, where each string location is a subset of some finite integer alphabet of size , so that we can answer effici...
Kimmo Fredriksson
VLDB
2005
ACM
177views Database» more  VLDB 2005»
14 years 9 months ago
Indexing mobile objects using dual transformations
With the recent advances in wireless networks, embedded systems and GPS technology, databases that manage the location of moving objects have received increased interest. In this ...
George Kollios, Dimitris Papadopoulos, Dimitrios G...
DEXA
2008
Springer
117views Database» more  DEXA 2008»
13 years 10 months ago
Space-Partitioning-Based Bulk-Loading for the NSP-Tree in Non-ordered Discrete Data Spaces
Properly-designed bulk-loading techniques are more efficient than the conventional tuple-loading method in constructing a multidimensional index tree for a large data set. Although...
Gang Qian, Hyun-Jeong Seok, Qiang Zhu, Sakti Prama...