1429 search results - page 200 / 286 » Efficient processing of XPath queries using indexes |
SIGMOD
2008
ACM
14 years 9 months ago
2008
ACM
A method for approximate subsequence matching is introduced, that significantly improves the efficiency of subsequence matching in large time series data sets under the dynamic ti...
VLDB
2005
ACM
14 years 2 months ago
2005
ACM
This paper presents the design of a read-optimized relational DBMS that contrasts sharply with most current systems, which are write-optimized. Among the many differences in its d...
ICDE
2005
IEEE
14 years 10 months ago
2005
IEEE
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...
APWEB
2004
Springer
14 years 2 months ago
2004
Springer
We propose a template-based runtime invalidation approach for maintaining cache consistency in database-generated web contents. In our approach, the invalidator sits between a web...
WWW
2008
ACM
14 years 10 months ago
2008
ACM
This paper studies the problem of unified ranked retrieval of heterogeneous XML documents and Web data. We propose an effective search engine called Sailer to adaptively and versa...