164 search results - page 6 / 33 » Reverse Top-k Queries |
SPIRE
2005
Springer
14 years 25 days ago
2005
Springer
Output-sensitive data structures result from preprocessing n items and are capable of reporting the items satisfying an on-line query in O(t(n) + ℓ) time, where t(n) is the cost ...
VLDB
1999
ACM
13 years 11 months ago
1999
ACM
In many applications, users specify target values for certain attributes, without requiring exact matches to these values in return. Instead, the result to such queries is typical...
IDEAS
2007
IEEE
14 years 1 months ago
2007
IEEE
There is an increasing need for an XML query engine that not only searches for exact matches to a query but also returns “query-like” structures. We have designed and develope...
ICDE
2010
IEEE
14 years 7 months ago
2010
IEEE
Rank-aware query processing has become essential for many applications that return to the user only the top-k objects based on the individual user's preferences. Top-k queries...
ICDE
2007
IEEE
14 years 8 months ago
2007
IEEE
Traditionally, query processing gets a query and a database instance as input and returns the result of the query for that particular database instance. Reverse query processing (...