Sciweavers

38 search results - page 3 / 8
» Tree Signatures and Unordered XML Pattern Matching
Sort
View
DEXA
2005
Springer
117views Database» more  DEXA 2005»
13 years 11 months ago
Efficient Processing of Ordered XML Twig Pattern
Finding all the occurrences of a twig pattern in an XML database is a core operation for efficient evaluation of XML queries. Holistic twig join algorithm has showed its superiorit...
Jiaheng Lu, Tok Wang Ling, Tian Yu, Changqing Li, ...
DBPL
2007
Springer
158views Database» more  DBPL 2007»
13 years 9 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
APSEC
2002
IEEE
13 years 10 months ago
Embedding XML Processing Toolkit on General Purpose Programming Language
Many methods for XML processing have been proposed in the last few years. One popular approach is to process XML documents by using existing programming languages. Another popular...
Tetsuo Kamina, Tetsuo Tamai
IDEAS
2007
IEEE
146views Database» more  IDEAS 2007»
14 years 2 days ago
Approximate Structural Matching over Ordered XML Documents
There is an increasing need for an XML query engine that not only searches for exact matches to a query but also returns “query-like” structures. We have designed and develope...
Nitin Agarwal, Magdiel Galan Oliveras, Yi Chen
PAKDD
2004
ACM
186views Data Mining» more  PAKDD 2004»
13 years 11 months ago
CMTreeMiner: Mining Both Closed and Maximal Frequent Subtrees
Abstract. Tree structures are used extensively in domains such as computational biology, pattern recognition, XML databases, computer networks, and so on. One important problem in ...
Yun Chi, Yirong Yang, Yi Xia, Richard R. Muntz