1018 search results - page 64 / 204 » On the minimization of XPath queries |
187
click to vote
VLDB
2009
ACM
16 years 1 months ago
2009
ACM
We consider the problem of using sampling to estimate the result of an aggregation operation over a subset-based SQL query, where a subquery is correlated to an outer query by a NO...
111
click to vote
PODS
2001
ACM
16 years 1 months ago
2001
ACM
The need to search for complex and recurring patterns in database sequences is shared by many applications. In this paper, we discuss how to express and support efficiently sophis...
111
click to vote
DEXA
2009
Springer
15 years 8 months ago
2009
Springer
With the trend of cloud computing, data and computing are moved away from desktop and are instead provided as a service from the cloud. Data-as-a-service enables access to a wealth...
87
Voted
VLDB
1999
ACM
15 years 5 months ago
1999
ACM
The problem of nding the best answers to a query quickly, rather than nding all answers, is of increasing importance as relational databases are applied in multimedia and decision...
252
click to vote
SIGMOD
2005
ACM
16 years 1 months ago
2005
ACM
Given a set of objects P and a query point q, a k nearest neighbor (k-NN) query retrieves the k objects in P that lie closest to q. Even though the problem is well-studied for sta...