Sciweavers

132 search results - page 1 / 27
» Preference query evaluation over expensive attributes
Sort
View
CIKM
2010
Springer
13 years 3 months ago
Preference query evaluation over expensive attributes
Most database systems allow query processing over attributes that are derived at query runtime (e.g., user-defined functions and remote data calls to web services), making them e...
Justin J. Levandoski, Mohamed F. Mokbel, Mohamed E...
ICDE
2005
IEEE
128views Database» more  ICDE 2005»
14 years 6 months ago
Exploiting Correlated Attributes in Acquisitional Query Processing
Sensor networks and other distributed information systems (such as the Web) must frequently access data that has a high per-attribute acquisition cost, in terms of energy, latency...
Amol Deshpande, Carlos Guestrin, Wei Hong, Samuel ...
SIGMOD
2001
ACM
108views Database» more  SIGMOD 2001»
14 years 5 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...
SIGMOD
2002
ACM
112views Database» more  SIGMOD 2002»
14 years 5 months ago
Minimal probing: supporting expensive predicates for top-k queries
This paper addresses the problem of evaluating ranked top-? queries with expensive predicates. As major DBMSs now all support expensive user-defined predicates for Boolean queries...
Kevin Chen-Chuan Chang, Seung-won Hwang
PVLDB
2008
104views more  PVLDB 2008»
13 years 4 months ago
Efficient skyline querying with variable user preferences on nominal attributes
Current skyline evaluation techniques assume a fixed ordering on the attributes. However, dynamic preferences on nominal attributes are more realistic in known applications. In or...
Raymond Chi-Wing Wong, Ada Wai-Chee Fu, Jian Pei, ...