2724 search results - page 341 / 545 » Optimizing Queries on Files |
140
click to vote
VLDB
1991
ACM
15 years 7 months ago
1991
ACM
In this paper we present a technique to optimize queries on deductive databases that use aggregate operations such as min, max, and “largest Ic values.” Our approach is based ...
133
Voted
CORR
2008
Springer
15 years 4 months ago
2008
Springer
In this work we deal with one-round key-agreement protocols, called Merkle's Puzzles, in the random oracle model, where the players Alice and Bob are allowed to query a rando...
192
Voted
CPM
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. We consider the problem of highly space-efficient representation of separable graphs while supporting queries in constant time in the RAM with logarithmic word size. In p...
132
Voted
ICIP
2003
IEEE
16 years 5 months ago
2003
IEEE
In this paper, we evaluate and investigate two main types of relevance feedback algorithms; the Euclidean and the correlation?based approaches. In the first case, we examine heuri...
225
Voted
ICDE
2008
IEEE
16 years 5 months ago
2008
IEEE
Abstract-- We introduce join scheduling algorithms that employ a balanced network utilization metric to optimize the use of all network paths in a global-scale database federation....