Sciweavers

1861 search results - page 68 / 373
» 1.6-Bit Pattern Databases
Sort
View
149
Voted
DBPL
2007
Springer
158views Database» more  DBPL 2007»
15 years 6 months ago
Efficient Algorithms for the Tree Homeomorphism Problem
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...
Michaela Götz, Christoph Koch, Wim Martens
DBKDA
2009
IEEE
99views Database» more  DBKDA 2009»
15 years 6 months ago
An Adaptive Synchronization Policy for Harvesting OAI-PMH Repositories
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...
Noha Adly
ICDE
2007
IEEE
122views Database» more  ICDE 2007»
16 years 3 months ago
Put a Tree Pattern in Your Algebra
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...
George A. Mihaila, Jérôme Simé...
ICPADS
2006
IEEE
15 years 8 months ago
Parallel Leap: Large-Scale Maximal Pattern Mining in a Distributed Environment
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...
Mohammad El-Hajj, Osmar R. Zaïane
VLDB
2005
ACM
118views Database» more  VLDB 2005»
15 years 8 months ago
Mining Compressed Frequent-Pattern Sets
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 ...
Dong Xin, Jiawei Han, Xifeng Yan, Hong Cheng