Sciweavers

386 search results - page 14 / 78
» Probabilistic Ranking of Database Query Results
Sort
View
SIGMOD
2006
ACM
110views Database» more  SIGMOD 2006»
14 years 9 months ago
Supporting ad-hoc ranking aggregates
This paper presents a principled framework for efficient processing of ad-hoc top-k (ranking) aggregate queries, which provide the k groups with the highest aggregates as results....
Chengkai Li, Kevin Chen-Chuan Chang, Ihab F. Ilyas
VLDB
2004
ACM
98views Database» more  VLDB 2004»
14 years 2 months ago
Top-k Query Evaluation with Probabilistic Guarantees
Top-k queries based on ranking elements of multidimensional datasets are a fundamental building block for many kinds of information discovery. The best known general-purpose algor...
Martin Theobald, Gerhard Weikum, Ralf Schenkel
BTW
2007
Springer
292views Database» more  BTW 2007»
14 years 1 months ago
Effective and Efficient Indexing for Large Video Databases
Abstract: Content based multimedia retrieval is an important topic in database systems. An emerging and challenging topic in this area is the content based search in video data. A ...
Christian Böhm, Peter Kunath, Alexey Pryakhin...
SIGMOD
2011
ACM
219views Database» more  SIGMOD 2011»
12 years 11 months ago
Context-sensitive ranking for document retrieval
We study the problem of context-sensitive ranking for document retrieval, where a context is defined as a sub-collection of documents, and is specified by queries provided by do...
Liang Jeff Chen, Yannis Papakonstantinou
ICDE
2009
IEEE
178views Database» more  ICDE 2009»
13 years 6 months ago
Efficient Query Evaluation over Temporally Correlated Probabilistic Streams
Many real world applications such as sensor networks and other monitoring applications naturally generate probabilistic streams that are highly correlated in both time and space. ...
Bhargav Kanagal, Amol Deshpande