591 search results - page 62 / 119 » The complexity of XPath query evaluation |
IPM
2006
13 years 8 months ago
2006
Similarity calculations and document ranking form the computationally expensive parts of query processing in ranking-based text retrieval. In this work, for these calculations, 11...
SIGMOD
2011
ACM
12 years 11 months ago
2011
ACM
Considering a broad definition for service contracts (beyond web services and software, e.g. airline tickets and insurance policies), we tackle the challenges of building a high ...
DOLAP
1999
ACM
14 years 1 months ago
1999
ACM
We consider a system in which many users run queries to examine subsets of a large object set. The object set is partitioned into files on tape. A single subset of objects will b...
PRIS
2004
13 years 10 months ago
2004
Similarity search in time series databases is an important research direction. Several methods have been proposed in order to provide algorithms for efficient query processing in t...
EDBT
2010
ACM
14 years 3 months ago
2010
ACM
Although keyword query enables inexperienced users to easily search XML database with no specific knowledge of complex structured query languages or XML data schemas, the ambigui...