1445 search results - page 118 / 289 » XPath query containment |
161
click to vote
SIGMOD
2005
ACM
15 years 10 months ago
2005
ACM
Many analysis and monitoring applications require the repeated execution of expensive modeling functions over streams of rapidly changing data. These applications can often be exp...
102
click to vote
DBISP2P
2005
Springer
15 years 3 months ago
2005
Springer
We propose a novel approach for de ning and querying a super-peer within a schema-based super-peer network organized into a two-level architecture: the low level, called the peer l...
IEEEMSP
2002
IEEE
15 years 2 months ago
2002
IEEE
Music query-by-humming is a challenging problem since the humming query inevitably contains much variation and inaccuracy. Many of the previous methods, which adopt note segmentat...
SIGMOD
1996
ACM
15 years 2 months ago
1996
ACM
Object-Relational and Object-Oriented DBMSs allow users to invoke time-consuming ("expensive") methods in their queries. When queries containing these expensive methods a...
APWEB
2006
Springer
15 years 1 months ago
2006
Springer
The goal of distributed information retrieval is to support effective searching over multiple document collections. For efficiency, queries should be routed to only those collectio...