Sciweavers

42 search results - page 4 / 9
» A unified approach to ranking in probabilistic databases
Sort
View
HIM
1997
Springer
162views Multimedia» more  HIM 1997»
13 years 11 months ago
Probabilistic Logical Information Retrieval for Content, Hypertext, and Database Querying
Classical retrieval models support content-oriented searching for documents using a set of words as data model. However, in hypertext and database applications we want to consider...
Thomas Rölleke, Markus Blömer
WWW
2008
ACM
14 years 7 months ago
A unified framework for name disambiguation
Name ambiguity problem has been a challenging issue for a long history. In this paper, we intend to make a thorough investigation of the whole problem. Specifically, we formalize ...
Jie Tang, Jing Zhang, Duo Zhang, Juanzi Li
SIGIR
2008
ACM
13 years 6 months ago
Discriminative probabilistic models for passage based retrieval
The approach of using passage-level evidence for document retrieval has shown mixed results when it is applied to a variety of test beds with different characteristics. One main r...
Mengqiu Wang, Luo Si
ICDE
2007
IEEE
134views Database» more  ICDE 2007»
14 years 8 months ago
Efficient Top-k Query Evaluation on Probabilistic Data
Modern enterprise applications are forced to deal with unreliable, inconsistent and imprecise information. Probabilistic databases can model such data naturally, but SQL query eva...
Christopher Re, Nilesh N. Dalvi, Dan Suciu
SIGMOD
2006
ACM
114views Database» more  SIGMOD 2006»
14 years 6 months ago
Ordering the attributes of query results
There has been a great deal of interest in the past few years on ranking of results of queries on structured databases, including work on probabilistic information retrieval, rank...
Gautam Das, Vagelis Hristidis, Nishant Kapoor, S. ...