Sciweavers

153 search results - page 2 / 31
» Efficient top-k processing over query-dependent functions
Sort
View
SIGMOD
2008
ACM
214views Database» more  SIGMOD 2008»
14 years 5 months ago
A graph method for keyword-based selection of the top-K databases
While database management systems offer a comprehensive solution to data storage, they require deep knowledge of the schema, as well as the data manipulation language, in order to...
Quang Hieu Vu, Beng Chin Ooi, Dimitris Papadias, A...
EDBT
2009
ACM
145views Database» more  EDBT 2009»
13 years 9 months ago
Efficient top-k count queries over imprecise duplicates
We propose efficient techniques for processing various TopK count queries on data with noisy duplicates. Our method differs from existing work on duplicate elimination in two sign...
Sunita Sarawagi, Vinay S. Deshpande, Sourabh Kasli...
PVLDB
2008
118views more  PVLDB 2008»
13 years 4 months ago
Efficient top-k processing over query-dependent functions
We study the efficient evaluation of top-k queries over data items, where the score of each item is dynamically computed by applying an item-specific function whose parameter valu...
Lin Guo, Sihem Amer-Yahia, Raghu Ramakrishnan, Jay...
PODS
2001
ACM
127views Database» more  PODS 2001»
14 years 5 months ago
Optimal Aggregation Algorithms for Middleware
Assume that each object in a database has m grades, or scores, one for each of m attributes. For example, an object can have a color grade, that tells how red it is, and a shape g...
Ronald Fagin, Amnon Lotem, Moni Naor
JMLR
2010
129views more  JMLR 2010»
13 years 4 days ago
Efficient Multioutput Gaussian Processes through Variational Inducing Kernels
Interest in multioutput kernel methods is increasing, whether under the guise of multitask learning, multisensor networks or structured output data. From the Gaussian process pers...
Mauricio Alvarez, David Luengo, Michalis Titsias, ...