Sciweavers

3368 search results - page 221 / 674
» The Complexity of Query Reliability
Sort
View
FGCS
2000
81views more  FGCS 2000»
15 years 6 months ago
Managing the operator ordering problem in parallel databases
This paper focuses on parallel query optimization. We consider the operator problem and introduce a new class of execution strategies called Linear-Oriented Bushy Trees (LBTs). Co...
Harald Kosch
PVLDB
2008
122views more  PVLDB 2008»
15 years 6 months ago
Identifying robust plans through plan diagram reduction
Estimates of predicate selectivities by database query optimizers often differ significantly from those actually encountered during query execution, leading to poor plan choices a...
Harish D., Pooja N. Darera, Jayant R. Haritsa
PVLDB
2008
107views more  PVLDB 2008»
15 years 6 months ago
XTreeNet: democratic community search
We describe XTreeNet, a distributed query dissemination engine which facilitates democratization of publishing and efficient data search among members of online communities with p...
Emiran Curtmola, Alin Deutsch, Dionysios Logotheti...
CIKM
2010
Springer
15 years 4 months ago
Research proposal for distributed deep web search
This proposal identifies two main problems related to deep web search, and proposes a step by step solution for each of them. The first problem is about searching deep web content...
Kien-Tsoi T. E. Tjin-Kam-Jet
ICALP
2003
Springer
15 years 11 months ago
Oracle Circuits for Branching-Time Model Checking
A special class of oracle circuits with tree-vector form is introduced. It is shown that they can be evaluated in deterministic polynomial-time with a polylog number of adaptive qu...
Ph. Schnoebelen