707 search results - page 63 / 142 » Processing queries on tree-structured data efficiently |
WWW
2008
ACM
13 years 8 months ago
2008
ACM
We propose a novel Partition Path-Based (PPB) grouping strategy to store compressed XML data in a stream of blocks. In addition, we employ a minimal indexing scheme called Block S...
DAWAK
2005
Springer
14 years 2 months ago
2005
Springer
Discovery of frequent patterns is a very important data mining problem with numerous applications. Frequent pattern mining is often regarded as advanced querying where a user speci...
GIS
1999
ACM
14 years 1 months ago
1999
ACM
: The paper is concerned with the effective and efficient processing of spatiotemporal selection queries under varying degrees of approximation. Such queries may employ operators l...
ICPADS
2005
IEEE
14 years 2 months ago
2005
IEEE
Data warehouses store large volumes of data according to a multidimensional model with dimensions representing different axes of analysis. OLAP systems (OnLine Analytical Processi...
SIGMOD
2004
ACM
14 years 8 months ago
2004
ACM
Dynamic plan migration is concerned with the on-the-fly transition from one continuous query plan to a semantically equivalent yet more efficient plan. Migration is important for ...