Sciweavers

386 search results - page 11 / 78
» Probabilistic Ranking of Database Query Results
Sort
View
SIGMOD
2007
ACM
160views Database» more  SIGMOD 2007»
14 years 9 months ago
Supporting ranking and clustering as generalized order-by and group-by
The Boolean semantics of SQL queries cannot adequately capture the "fuzzy" preferences and "soft" criteria required in non-traditional data retrieval applicati...
Chengkai Li, Min Wang, Lipyeow Lim, Haixun Wang, K...
PODS
2008
ACM
250views Database» more  PODS 2008»
14 years 9 months ago
Approximating predicates and expressive queries on probabilistic databases
We study complexity and approximation of queries in an expressive query language for probabilistic databases. The language studied supports the compositional use of confidence com...
Christoph Koch
VLDB
2007
ACM
229views Database» more  VLDB 2007»
14 years 3 months ago
Sum-Max Monotonic Ranked Joins for Evaluating Top-K Twig Queries on Weighted Data Graphs
In many applications, the underlying data (the web, an XML document, or a relational database) can be seen as a graph. These graphs may be enriched with weights, associated with t...
Yan Qi 0002, K. Selçuk Candan, Maria Luisa ...
WWW
2009
ACM
14 years 9 months ago
Answering approximate queries over autonomous web databases
To deal with the problem of empty or too little answers returned from a Web database in response to a user query, this paper proposes a novel approach to provide relevant and rank...
Xiangfu Meng, Z. M. Ma, Li Yan
TKDE
2011
330views more  TKDE 2011»
13 years 3 months ago
Effective Navigation of Query Results Based on Concept Hierarchies
— Search queries on biomedical databases, such as PubMed, often return a large number of results, only a small subset of which is relevant to the user. Ranking and categorization...
Abhijith Kashyap, Vagelis Hristidis, Michalis Petr...