853 search results - page 18 / 171 » Similarity Indexing with the SS-tree |
ADBIS
1997
Springer
15 years 1 months ago
1997
Springer
Recent work on client-server data-shipping OODBs has demonstratedthe usefulnessof localdatacachingat clientsites. In addition to data caching, index caching can provide substantia...
85
Voted
SBBD
2001
14 years 11 months ago
2001
There are several auxiliary pre-computed access structures that allow faster answers by reading less base data. Examples are materialized views, join indexes, B-tree and bitmap in...
SIGMOD
2004
ACM
15 years 9 months ago
2004
ACM
Increasing popularity of XML in recent years has generated much interest in query processing over graph-structured data. To support efficient evaluation of path expressions, many ...
CIKM
2010
Springer
14 years 8 months ago
2010
Springer
Current Information Retrieval systems use inverted index structures for efficient query processing. Due to the extremely large size of many data sets, these index structures are u...
67
Voted
DASFAA
2005
IEEE
15 years 3 months ago
2005
IEEE
We have observed in recent years a growing interest in similarity search on large collections of biological sequences. Contributing to the interest, this paper presents a method fo...