Sciweavers

211 search results - page 22 / 43
» Ranked Query Processing in Uncertain Databases
Sort
View
PODS
2008
ACM
123views Database» more  PODS 2008»
14 years 7 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
DOLAP
2006
ACM
14 years 1 months ago
Pre-aggregation with probability distributions
Motivated by the increasing need to analyze complex, uncertain multidimensional data this paper proposes probabilistic OLAP queries that are computed using probability distributio...
Igor Timko, Curtis E. Dyreson, Torben Bach Pederse...
AMR
2005
Springer
128views Multimedia» more  AMR 2005»
14 years 1 months ago
Ranking Invariance Based on Similarity Measures in Document Retrieval
Abstract. To automatically retrieve documents or images from a database, retrieval systems use similarity measures to compare a request based on features extracted from the documen...
Jean-François Omhover, Maria Rifqi, Marcin ...
CIKM
2009
Springer
14 years 2 months ago
Enabling multi-level relevance feedback on pubmed by integrating rank learning into DBMS
Background: Finding relevant articles from PubMed is challenging because it is hard to express the user’s specific intention in the given query interface, and a keyword query ty...
Hwanjo Yu, Taehoon Kim, Jinoh Oh, Ilhwan Ko, Sungc...
ICDE
2005
IEEE
86views Database» more  ICDE 2005»
14 years 9 months ago
Personalized Queries under a Generalized Preference Model
Query Personalization is the process of dynamically enhancing a query with related user preferences stored in a user profile with the aim of providing personalized answers. The un...
Georgia Koutrika, Yannis E. Ioannidis