Sciweavers

385 search results - page 14 / 77
» Probabilistic ranking over relations
Sort
View
SIGMOD
2007
ACM
229views Database» more  SIGMOD 2007»
14 years 7 months ago
Spark: top-k keyword query in relational databases
With the increasing amount of text data stored in relational databases, there is a demand for RDBMS to support keyword queries over text data. As a search result is often assemble...
Yi Luo, Xuemin Lin, Wei Wang 0011, Xiaofang Zhou
ERCIMDL
2007
Springer
87views Education» more  ERCIMDL 2007»
14 years 1 months ago
A Model of Uncertainty for Near-Duplicates in Document Reference Networks
We introduce a model of uncertainty where documents are not uniquely identified in a reference network, and some links may be incorrect. It generalizes the probabilistic approach ...
Claudia Hess, Michel de Rougemont
SIGIR
2008
ACM
13 years 7 months ago
Efficient top-k querying over social-tagging networks
Online communities have become popular for publishing and searching content, as well as for finding and connecting to other users. User-generated content includes, for example, pe...
Ralf Schenkel, Tom Crecelius, Mouna Kacimi, Sebast...
SSDBM
2008
IEEE
177views Database» more  SSDBM 2008»
14 years 2 months ago
Prioritized Evaluation of Continuous Moving Queries over Streaming Locations
Abstract. Existing approaches to the management of streaming positional updates generally assume that all active user requests have equal importance, ignoring the possibility of an...
Kostas Patroumpas, Timos K. Sellis
ICTIR
2009
Springer
14 years 2 months ago
Modeling Expected Utility of Multi-session Information Distillation
Abstract. An open challenge in information distillation is the evaluation and optimization of the utility of ranked lists with respect to flexible user interactions over multiple ...
Yiming Yang, Abhimanyu Lad