2001 search results - page 66 / 401 » Indexing in a Hypertext Database |
VLDB
1999
ACM
14 years 1 months ago
1999
ACM
Today’s object-relational DBMSs (ORDBMSs) are designed to support novel application domains by providing an extensible architecture, supplemented by domain-specific database ex...
BTW
2009
Springer
14 years 7 days ago
2009
Springer
Abstract: Efficient content-based similarity search in large multimedia databases requires efficient query processing algorithms for many practical applications. Especially in hi...
SIGMOD
2005
ACM
14 years 9 months ago
2005
ACM
Information filtering has become a key technology for modern information systems. The goal of an information filter is to route messages to the right recipients (possibly none) ac...
DILS
2005
Springer
14 years 2 months ago
2005
Springer
The ability to perform genome-wide and cross-genome data analyses can dramatically reduce the time required for new biological discoveries. This raises important issues in bioinfor...
SSDBM
2003
IEEE
14 years 2 months ago
2003
IEEE
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existin...