Sciweavers

250 search results - page 4 / 50
» Tree pattern query minimization
Sort
View
ICDM
2002
IEEE
167views Data Mining» more  ICDM 2002»
13 years 12 months ago
From Path Tree To Frequent Patterns: A Framework for Mining Frequent Patterns
In this paper, we propose a new framework for mining frequent patterns from large transactional databases. The core of the framework is of a novel coded prefix-path tree with two...
Yabo Xu, Jeffrey Xu Yu, Guimei Liu, Hongjun Lu
IEICET
2008
67views more  IEICET 2008»
13 years 7 months ago
Learning of Finite Unions of Tree Patterns with Internal Structured Variables from Queries
We consider the polynomial time learnability of finite unions of ordered tree patterns with internal structured variables, in the query learning model of Angluin (1988). An ordered...
Satoshi Matsumoto, Takayoshi Shoudai, Tomoyuki Uch...
EDBT
2006
ACM
106views Database» more  EDBT 2006»
14 years 7 months ago
DPTree: A Distributed Pattern Tree Index for Partial-Match Queries in Peer-to-Peer Networks
Abstract. Partial-match queries return data items that contain a subset of the query keywords and order the results based on the statistical properties of the matched keywords. The...
Dyce Jing Zhao, Dik Lun Lee, Qiong Luo
EDBT
2002
ACM
129views Database» more  EDBT 2002»
14 years 7 months ago
Schema-Driven Evaluation of Approximate Tree-Pattern Queries
Abstract. We present a simple query language for XML, which supports hierarchical, Boolean-connected query patterns. The interpretation of a query is founded on cost-based query tr...
Torsten Schlieder
FCT
2001
Springer
13 years 11 months ago
Polynomial Time Algorithms for Finding Unordered Tree Patterns with Internal Variables
Many documents such as Web documents or XML files have tree structures. A term tree is an unordered tree pattern consisting of internal variables and tree structures. In order to ...
Takayoshi Shoudai, Tomoyuki Uchida, Tetsuhiro Miya...