Sciweavers

486 search results - page 33 / 98
» Evaluating Top-k Queries over Web-Accessible Databases
Sort
View
196
Voted
SIGMOD
2008
ACM
206views Database» more  SIGMOD 2008»
16 years 1 months ago
Ad-hoc aggregations of ranked lists in the presence of hierarchies
A variety of web sites and web based services produce textual lists at varying time granularities ranked according to several criteria. For example, Google Trends produces lists o...
Nilesh Bansal, Sudipto Guha, Nick Koudas
EDBT
2006
ACM
156views Database» more  EDBT 2006»
16 years 1 months ago
Indexing Incomplete Databases
Incomplete databases, that is, databases that are missing data, are present in many research domains. It is important to derive techniques to access these databases efficiently. We...
Guadalupe Canahuate, Michael Gibas, Hakan Ferhatos...
EDBT
2009
ACM
165views Database» more  EDBT 2009»
14 years 11 months ago
Exploiting the power of relational databases for efficient stream processing
Stream applications gained significant popularity over the last years that lead to the development of specialized stream engines. These systems are designed from scratch with a di...
Erietta Liarou, Romulo Goncalves, Stratos Idreos
SIGIR
2011
ACM
14 years 4 months ago
Picasso - to sing, you must close your eyes and draw
We study the problem of automatically assigning appropriate music pieces to a picture or, in general, series of pictures. This task, commonly referred to as soundtrack suggestion,...
Aleksandar Stupar, Sebastian Michel
PKDD
1998
Springer
123views Data Mining» more  PKDD 1998»
15 years 5 months ago
Querying Inductive Databases: A Case Study on the MINE RULE Operator
Knowledge discovery in databases (KDD) is a process that can include steps like forming the data set, data transformations, discovery of patterns, searching for exceptions to a pat...
Jean-François Boulicaut, Mika Klemettinen, ...