Sciweavers

483 search results - page 17 / 97
» Evaluating Top-k Selection Queries
Sort
View
BDA
2001
13 years 9 months ago
Rewriting and Evaluating Tree Queries with XPath
A Community Web portal is a set of tools for a community of people who want to share information on a certain domain via the Web. The backbone of this system is an ontology which ...
Bernd Amann, Catriel Beeri, Irini Fundulaki, Miche...
ICDE
2009
IEEE
115views Database» more  ICDE 2009»
14 years 9 months ago
Efficient Evaluation of Multiple Preference Queries
Consider multiple users searching for a hotel room, based on size, cost, distance to the beach, etc. Users may have variable preferences expressed by different weights on the attri...
Leong Hou U, Nikos Mamoulis, Kyriakos Mouratidis
RIAO
2007
13 years 9 months ago
Selecting Automatically the Best Query Translations
In order to search corpora written in two or more languages, the simplest and most efficient approach is to translate the query submitted into the required language(s). To achieve...
Pierre-Yves Berger, Jacques Savoy
SBBD
2003
101views Database» more  SBBD 2003»
13 years 9 months ago
Cherry Picking: A Semantic Query Processing Strategy for the Evaluation of Expensive Predicates
A common requirement of many scientific applications is the ability to process queries involving expensive predicates corresponding to user programs. Optimizing such queries is ha...
Fabio Porto, Eduardo Sany Laber, Patrick Valduriez
SEBD
1996
94views Database» more  SEBD 1996»
13 years 9 months ago
Efficient Algorithm for determining the Optimal Execution Strategy for Path Queries in OODBS
Abstract. To select an optimal query evaluation strategy for a path query in an object-oriented database system one has to exploit the available index structures on the path. In a ...
Weimin Chen, Karl Aberer