4955 search results - page 145 / 991 » Multiple Pattern Databases |
131
Voted
CIKM
2008
Springer
15 years 4 months ago
2008
Springer
Query processing techniques for XML data have focused mainly on tree-pattern queries (TPQs). However, the need for querying XML data sources whose structure is very complex or not...
209
click to vote
ICDE
2007
IEEE
16 years 3 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...
120
Voted
ICPADS
2006
IEEE
15 years 8 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...
119
click to vote
VLDB
2005
ACM
15 years 8 months ago
2005
ACM
A major challenge in frequent-pattern mining is the sheer size of its mining results. In many cases, a high min sup threshold may discover only commonsense patterns but a low one ...
125
click to vote
VLDB
1999
ACM
15 years 6 months ago
1999
ACM
Discovering sequential patterns is an important problem in data mining with a host of application domains including medicine, telecommunications, and the World Wide Web. Conventio...