Sciweavers

386 search results - page 42 / 78
» Probabilistic Ranking of Database Query Results
Sort
View
WWW
2004
ACM
14 years 9 months ago
Affinity rank: a new scheme for efficient web search
Maximizing only the relevance between queries and documents will not satisfy users if they want the top search results to present a wide coverage of topics by a few representative...
Yi Liu, Benyu Zhang, Zheng Chen, Michael R. Lyu, W...
ICDT
2009
ACM
166views Database» more  ICDT 2009»
14 years 9 months ago
A compositional framework for complex queries over uncertain data
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
Christoph Koch, Michaela Götz
DASFAA
2009
IEEE
134views Database» more  DASFAA 2009»
14 years 3 months ago
Selectivity Estimation for Exclusive Query Translation in Deep Web Data Integration
In Deep Web data integration, some Web database interfaces express exclusive predicates of the form Qe = Pi(Pi ∈ P1, P2, . . . , Pm), which permits only one predicate to be selec...
Fangjiao Jiang, Weiyi Meng, Xiaofeng Meng
SIGMOD
2007
ACM
225views Database» more  SIGMOD 2007»
14 years 9 months ago
From complete to incomplete information and back
Incomplete information arises naturally in numerous data management applications. Recently, several researchers have studied query processing in the context of incomplete informat...
Lyublena Antova, Christoph Koch, Dan Olteanu
SSDBM
2008
IEEE
177views Database» more  SSDBM 2008»
14 years 3 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