Sciweavers

329 search results - page 30 / 66
» Efficient Parallel Query Processing by Graph Ranking
Sort
View
FGCS
2000
81views more  FGCS 2000»
13 years 8 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
CIKM
2005
Springer
14 years 2 months ago
Concept-based interactive query expansion
Despite the recent advances in search quality, the fast increase in the size of the Web collection has introduced new challenges for Web ranking algorithms. In fact, there are sti...
Bruno M. Fonseca, Paulo Braz Golgher, Bruno P&ocir...
IR
2010
13 years 5 months ago
Statistical query expansion for sentence retrieval and its effects on weak and strong queries
The retrieval of sentences that are relevant to a given information need is a challenging passage retrieval task. In this context, the well-known vocabulary mismatch problem arises...
David E. Losada
ICDCS
2010
IEEE
13 years 5 months ago
Secure Ranked Keyword Search over Encrypted Cloud Data
As Cloud Computing becomes prevalent, sensitive information are being increasingly centralized into the cloud. For the protection of data privacy, sensitive data has to be encrypte...
Cong Wang, Ning Cao, Jin Li, Kui Ren, Wenjing Lou
PODS
2008
ACM
123views Database» more  PODS 2008»
14 years 8 months ago
Evaluating rank joins with optimal cost
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
Karl Schnaitter, Neoklis Polyzotis