2463 search results - page 143 / 493 » Compressing Pattern Databases |
134
Voted
WWW
2005
ACM
15 years 6 months ago
2005
ACM
In this paper, we propose an approach to materialize XML data warehouses based on the frequent query patterns discovered from historical queries issued by users. The schemas of in...
125
click to vote
DBPL
2007
Springer
15 years 4 months ago
2007
Springer
Tree pattern matching is a fundamental problem that has a wide range of applications in Web data management, XML processing, and selective data dissemination. In this paper we deve...
DBKDA
2009
IEEE
15 years 4 months ago
2009
IEEE
Metadata harvesting requires timely propagation of up-to-date information from thousands of Repositories over a wide area network. It is desirable to keep the data as fresh as poss...
190
click to vote
ICDE
2007
IEEE
16 years 1 months ago
2007
IEEE
To address the needs of data intensive XML applications, a number of efficient tree pattern algorithms have been proposed. Still, most XQuery compilers do not support those algori...
106
click to vote
ICPADS
2006
IEEE
15 years 6 months ago
2006
IEEE
When computationally feasible, mining extremely large databases produces tremendously large numbers of frequent patterns. In many cases, it is impractical to mine those datasets d...