1018 search results - page 107 / 204 » On the minimization of XPath queries |
102
click to vote
PVLDB
2010
15 years 2 days ago
2010
We consider the problem of efficiently finding the top-k answers for join queries over web-accessible databases. Classical algorithms for finding top-k answers use branch-and-b...
141
click to vote
WWW
2006
ACM
16 years 2 months ago
2006
ACM
An important issue arising from Peer-to-Peer applications is how to accurately and efficiently retrieve a set of K best matching data objects from different sources while minimizi...
123
click to vote
SIGMOD
2004
ACM
16 years 1 months ago
2004
ACM
We define a framework for static optimization of sliding window conjunctive queries over infinite streams. When computational resources are sufficient, we propose that the goal of...
111
click to vote
ICDE
2010
IEEE
15 years 11 months ago
2010
IEEE
— Many applications require sorting a table over multiple sort orders: generation of multiple reports from a table, evaluation of a complex query that involves multiple instances...
135
click to vote
VLDB
2007
ACM
15 years 7 months ago
2007
ACM
Many enterprises nowadays use business processes, based on the BPEL standard, to achieve their goals. These are complex, often distributed, processes. Monitoring the execution of ...