613 search results - page 46 / 123 » Query Evaluation on a Database Given by a Random Graph |
127
Voted
ICDE
2010
IEEE
16 years 3 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...
208
Voted
GIS
2006
ACM
16 years 4 months ago
2006
ACM
This paper presents a query optimizer module based on cost estimation that chooses the best filtering step algorithm to perform a specific spatial join operation. A set of express...
152
Voted
WWW
2011
ACM
14 years 10 months ago
2011
ACM
The ability to aggregate huge volumes of queries over a large population of users allows search engines to build precise models for a variety of query-assistance features such as ...
110
Voted
HT
1991
ACM
15 years 7 months ago
1991
ACM
In order to combine hypertext with database facilities, we show how to extract an effective storage structure from given instance relationships. The schema of the structure recogn...
130
Voted
ICPR
2008
IEEE
15 years 10 months ago
2008
IEEE
Given a bipartite graph of collaborative ratings, the task of recommendation and rating prediction can be modeled with graph kernels. We interpret these graph kernels as the inver...