2121 search results - page 374 / 425 » Indexing Incomplete Databases |
108
click to vote
ICDE
2010
IEEE
16 years 1 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...
154
Voted
SAC
2010
ACM
15 years 8 months ago
2010
ACM
In this paper, we explore the problem of processing a novel type of location based queries, named the location based top-k query, which involves both of spatial and non-spatial sp...
119
click to vote
EDBT
2010
ACM
15 years 8 months ago
2010
ACM
Although keyword query enables inexperienced users to easily search XML database with no specific knowledge of complex structured query languages or XML data schemas, the ambigui...
122
click to vote
EDBT
2009
ACM
15 years 8 months ago
2009
ACM
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...
103
click to vote
VLDB
2007
ACM
15 years 7 months ago
2007
ACM
A top-k query retrieves the k highest scoring tuples from a data set with respect to a scoring function defined on the attributes of a tuple. The efficient evaluation of top-k q...