Sciweavers

792 search results - page 90 / 159
» Computing Iceberg Queries Efficiently
Sort
View
JUCS
2008
156views more  JUCS 2008»
13 years 10 months ago
Efficient k-out-of-n Oblivious Transfer Schemes
Abstract: Oblivious transfer is an important cryptographic protocol in various security applications. For example, in on-line transactions, a k-out-of-n oblivious transfer scheme a...
Cheng-Kang Chu, Wen-Guey Tzeng
SAC
2008
ACM
13 years 9 months ago
Selectivity estimation in spatial networks
Modern applications requiring spatial network processing pose many interesting query optimization challenges. In many cases, query processing depends on the corresponding graph si...
Eleftherios Tiakas, Apostolos N. Papadopoulos, Ale...
VLDB
1987
ACM
104views Database» more  VLDB 1987»
14 years 1 months ago
Magic Functions: A Technique to Optimize Extended Datalog Recursive Programs
Severalmethodshavebeenproposedto compile recursive Datalog programs. The most well-known perform a rewriting of rules using MAGIC or PROBLEM predicates in order to push selections...
Georges Gardarin
SAC
2008
ACM
13 years 9 months ago
XBird/D: distributed and parallel XQuery processing using remote proxy
In this paper, we focus on an aspect of distributed XQuery processing that involves data exchanges between processor elements. We first address problems of distributed XML query p...
Makoto Yui, Jun Miyazaki, Shunsuke Uemura, Hirokaz...
NSDI
2004
13 years 11 months ago
Efficient Routing for Peer-to-Peer Overlays
Most current peer-to-peer lookup schemes keep a small amount of routing state per node, typically logarithmic in the number of overlay nodes. This design assumes that routing info...
Anjali Gupta, Barbara Liskov, Rodrigo Rodrigues