486 search results - page 24 / 98 » Evaluating Top-k Queries over Web-Accessible Databases |
220
click to vote
ICDE
2008
IEEE
16 years 2 months ago
2008
IEEE
We introduce a novel query type defined over streaming moving object data, namely, the Continuous Motion Pattern (CMP) Queries. A motion pattern is defined as a sequence of distin...
218
click to vote
SIGMOD
2006
ACM
16 years 1 months ago
2006
ACM
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...
148
click to vote
DASFAA
2010
IEEE
15 years 5 months ago
2010
IEEE
This paper studies a new query on uncertain data, called k-selection query. Given an uncertain dataset of N objects, where each object is associated with a preference score and a p...
188
click to vote
SIGMOD
2007
ACM
16 years 1 months ago
2007
ACM
Partial evaluation has recently proven an effective technique for evaluating Boolean XPath queries over a fragmented tree that is distributed over a number of sites. What left ope...
107
Voted
CIKM
2004
Springer
15 years 6 months ago
2004
Springer
We explore join optimizations in the presence of both timebased constraints (sliding windows) and value-based constraints (punctuations). We present the first join solution named...