552 search results - page 80 / 111 » Efficient Algorithms for Processing XPath Queries |
DEXA
2006
Springer
15 years 3 months ago
2006
Springer
The composition of services that are indexed in a large-scale service directory often involves many complex queries issued by the service composition algorithm to the directory. Th...
180
click to vote
SIGMOD
2009
ACM
16 years 14 hour ago
2009
ACM
This paper addresses the problem of monitoring the k nearest neighbors to a dynamically changing path in road networks. Given a destination where a user is going to, this new quer...
202
click to vote
ICDE
2006
IEEE
16 years 1 months ago
2006
IEEE
In this paper, we investigate a new approach to process queries in data stream applications. We show that reference locality characteristics of data streams could be exploited in ...
117
click to vote
SIGMOD
2010
ACM
14 years 6 months ago
2010
ACM
We propose and study a new ranking problem in versioned databases. Consider a database of versioned objects which have different valid instances along a history (e.g., documents i...
ICDE
2010
IEEE
15 years 11 months ago
2010
IEEE
Estimation via sampling out of highly selective join queries is well known to be problematic, most notably in online aggregation. Without goal-directed sampling strategies, samples...