Sciweavers

109 search results - page 15 / 22
» Optimization Using Tuple Subsumption
Sort
View
PVLDB
2010
92views more  PVLDB 2010»
13 years 5 months ago
Proximity Rank Join
We introduce the proximity rank join problem, where we are given a set of relations whose tuples are equipped with a score and a real-valued feature vector. Given a target feature...
Davide Martinenghi, Marco Tagliasacchi
ICDE
2009
IEEE
182views Database» more  ICDE 2009»
14 years 9 months ago
Adaptive Parallelization of Queries over Dependent Web Service Calls
We have developed a system to process database queries over composed data providing web services. The queries are transformed into execution plans containing an operator that invok...
Manivasakan Sabesan, Tore Risch
SIGMOD
2011
ACM
176views Database» more  SIGMOD 2011»
12 years 10 months ago
Sharing work in keyword search over databases
An important means of allowing non-expert end-users to pose ad hoc queries — whether over single databases or data integration systems — is through keyword search. Given a set...
Marie Jacob, Zachary G. Ives
WSDM
2012
ACM
259views Data Mining» more  WSDM 2012»
12 years 2 months ago
Learning recommender systems with adaptive regularization
Many factorization models like matrix or tensor factorization have been proposed for the important application of recommender systems. The success of such factorization models dep...
Steffen Rendle
SIGMOD
2007
ACM
179views Database» more  SIGMOD 2007»
14 years 7 months ago
How to barter bits for chronons: compression and bandwidth trade offs for database scans
Two trends are converging to make the CPU cost of a table scan a more important component of database performance. First, table scans are becoming a larger fraction of the query p...
Allison L. Holloway, Vijayshankar Raman, Garret Sw...