383 search results - page 65 / 77 » Join operations in temporal databases |
PODS
2005
ACM
15 years 9 months ago
2005
ACM
We study the satisfiability problem associated with XPath in the presence of DTDs. This is the problem of determining, given a query p in an XPath fragment and a DTD D, whether or...
DASFAA
2008
IEEE
15 years 4 months ago
2008
IEEE
Twig pattern matching (TPM) is the core operation of XML query processing. Existing approaches rely on either efficient data structures or novel labeling/indexing schemes to reduce...
DBISP2P
2005
Springer
15 years 3 months ago
2005
Springer
Structured peer-to-peer systems rely on replication as a basic means to provide fault-tolerance in presence of high churn. Most select replicas using either multiple hash functions...
VLDB
2005
ACM
15 years 3 months ago
2005
ACM
We present DITN, a new method of parallel querying based on dynamic outsourcing of join processing tasks to non-dedicated, heterogeneous computers. In DITN, partitioning is not th...
SIGMOD
1999
ACM
15 years 1 months ago
1999
ACM
Query processing in data integration occurs over network-bound, autonomous data sources. This requires extensions to traditional optimization and execution techniques for three re...