Sciweavers

8 search results - page 1 / 2
» Fast contextual preference scoring of database tuples
Sort
View
76
Voted
EDBT
2008
ACM
151views Database» more  EDBT 2008»
15 years 10 months ago
Fast contextual preference scoring of database tuples
To provide users with only relevant data from the huge amount of available information, personalization systems utilize preferences to allow users to express their interest on spe...
Kostas Stefanidis, Evaggelia Pitoura
ICDE
2010
IEEE
243views Database» more  ICDE 2010»
15 years 10 months ago
Probabilistic Contextual Skylines
The skyline query returns the most interesting tuples according to a set of explicitly defined preferences among attribute values. This work relaxes this requirement, and allows us...
Anastasios Arvanitis, Dimitris Sacharidis, Timos K...
111
Voted
ICDT
1997
ACM
108views Database» more  ICDT 1997»
15 years 2 months ago
Incorporating User Preferences in Multimedia Queries
A “scoring rule” is an assignment of a value to every tuple (of varying sizes). This paper is concerned with the issue of how to modify a scoring rule to apply to the case whe...
Ronald Fagin, Edward L. Wimmers
SIGMOD
2006
ACM
238views Database» more  SIGMOD 2006»
15 years 10 months ago
Continuous monitoring of top-k queries over sliding windows
Given a dataset P and a preference function f, a top-k query retrieves the k tuples in P with the highest scores according to f. Even though the problem is well-studied in convent...
Kyriakos Mouratidis, Spiridon Bakiras, Dimitris Pa...
SIGMOD
2001
ACM
108views Database» more  SIGMOD 2001»
15 years 10 months ago
PREFER: A System for the Efficient Execution of Multi-parametric Ranked Queries
Users often need to optimize the selection of objects by appropriately weighting the importance of multiple object attributes. Such optimization problems appear often in operation...
Vagelis Hristidis, Nick Koudas, Yannis Papakonstan...