Sciweavers

893 search results - page 83 / 179
» Relational link-based ranking
Sort
View
SIGMOD
2002
ACM
112views Database» more  SIGMOD 2002»
14 years 9 months ago
Minimal probing: supporting expensive predicates for top-k queries
This paper addresses the problem of evaluating ranked top-? queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries...
Kevin Chen-Chuan Chang, Seung-won Hwang
EDBT
2010
ACM
210views Database» more  EDBT 2010»
13 years 11 months ago
Keyword search for data-centric XML collections with long text fields
Users who are unfamiliar with database query languages can search XML data sets using keyword queries. Current approaches for supporting such queries are either for textcentric XM...
Arash Termehchy, Marianne Winslett
CIKM
2006
Springer
13 years 11 months ago
Voting for candidates: adapting data fusion techniques for an expert search task
In an expert search task, the users' need is to identify people who have relevant expertise to a topic of interest. An expert search system predicts and ranks the expertise o...
Craig Macdonald, Iadh Ounis
BMCBI
2010
154views more  BMCBI 2010»
13 years 9 months ago
Candidate gene prioritization by network analysis of differential expression using machine learning approaches
Background: Discovering novel disease genes is still challenging for diseases for which no prior knowledge - such as known disease genes or disease-related pathways - is available...
Daniela Nitsch, Joana P. Gonçalves, Fabian ...
WWW
2010
ACM
14 years 2 months ago
Keyword search over key-value stores
Key-value stores (KVSs) are the most prevalent storage systems for large scale web services. As they do not have the structural complexities of RDBMSs, they are more efficient. In...
Arash Termehchy, Marianne Winslett