591 search results - page 51 / 119 » The complexity of XPath query evaluation |
EDBT
2010
ACM
14 years 3 months ago
2010
ACM
The wide adaptation of GPS and cellular technologies has created many applications that collect and maintain large repositories of data in the form of trajectories. Previous work ...
SIGMOD
1990
ACM
14 years 23 days ago
1990
ACM
The role of database knowledge 1susually limited to the evaluation of data queries In this paper we argue that when this knowledge 1sof substantial volume and complexity, there 1s...
APPROX
2008
Springer
13 years 10 months ago
2008
Springer
We study the problem of local search on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a v...
ECIR
2010
Springer
13 years 10 months ago
2010
Springer
Prior-art search is an important task in patent retrieval. The success of this task relies upon the selection of relevant search queries. Typically terms for prior-art queries are ...
PODS
2010
ACM
13 years 10 months ago
2010
ACM
We study highly expressive query languages such as datalog, fixpoint, and while-languages on probabilistic databases. We generalize these languages such that computation steps (e....