184 search results - page 10 / 37 » Cache-oblivious data structures for orthogonal range searchi... |
ALGORITHMICA
2004
14 years 11 months ago
2004
Query answers from on-line databases can easily be corrupted by hackers or malicious database publishers. Thus it is important to provide mechanisms which allow clients to trust th...
MICAI
2004
Springer
15 years 5 months ago
2004
Springer
A number of problems in computer science can be solved efficiently with the so called memory based or kernel methods. Among this problems (relevant to the AI community) are multime...
VLDB
1998
ACM
15 years 3 months ago
1998
ACM
We propose and evaluate two indexing schemes for improving the efficiency of data retrieval in high-dimensional databases that are incomplete. These schemes are novel in that the ...
115
click to vote
SSDBM
2009
IEEE
15 years 6 months ago
2009
IEEE
High-dimensional indexing has been very popularly used for performing similarity search over various data types such as multimedia (audio/image/video) databases, document collectio...
110
click to vote
SODA
2004
ACM
15 years 1 months ago
2004
ACM
We consider the problem of storing an ordered dictionary data structure over a distributed set of nodes. In contrast to traditional sequential data structures, distributed data st...