4337 search results - page 561 / 868 » Cache-Oblivious Query Processing |
178
click to vote
IDEAS
2000
IEEE
15 years 11 months ago
2000
IEEE
Most operations of the relational algebra or SQL - like projection with duplicate elimination, join, ordering, group by and aggregations - are efficiently processed using a sorted...
182
click to vote
SIGMOD
1998
ACM
15 years 10 months ago
1998
ACM
For an increasing number of modern database applications, efficient support of similarity search becomes an important task. Along with the complexity of the objects such as images...
156
click to vote
ERCIMDL
1997
Springer
15 years 10 months ago
1997
Springer
It is argued that digital libraries of the future will contain terabyte-scale collections of digital text and that full-text searching techniques will be required to operate over c...
142
click to vote
ICIAP
1997
ACM
15 years 10 months ago
1997
ACM
—A major research subject in image databases is to support efficient and effective access to images based on their visual content. In color image databases, this requires to sup...
213
click to vote
CIKM
1994
Springer
15 years 10 months ago
1994
Springer
TID hash joins are a simple and memory-efficient method for processing large join queries. They are based on standard hash join algorithms but only store TID/key pairs in the hash...