Sciweavers

621 search results - page 9 / 125
» Efficient algorithms for minimizing tree pattern queries
Sort
View
SOFSEM
2004
Springer
14 years 1 months ago
Tree Signatures and Unordered XML Pattern Matching
We propose an efficient approach for finding relevant XML data twigs defined by unordered query tree specifications. We use the tree signatures as the index structure and find...
Pavel Zezula, Federica Mandreoli, Riccardo Martogl...
ICDE
2004
IEEE
120views Database» more  ICDE 2004»
14 years 9 months ago
Minimization and Group-By Detection for Nested XQueries
We describe and evaluate a query minimization technique that applies to XQueries, which are nested, perform arbitrary joins, and freely mix bag and set semantics. These features c...
Alin Deutsch, Yannis Papakonstantinou, Yu Xu
WEBDB
2010
Springer
167views Database» more  WEBDB 2010»
14 years 1 months ago
Tree patterns with Full Text Search
Tree patterns with full text search form the core of both XQuery Full Text and the NEXI query language. On such queries, users expect a relevance-ranked list of XML elements as an...
Maria-Hendrike Peetz, Maarten Marx
WWW
2007
ACM
14 years 8 months ago
Mining contiguous sequential patterns from web logs
Finding Contiguous Sequential Patterns (CSP) is an important problem in Web usage mining. In this paper we propose a new data structure, UpDown Tree, for CSP mining. An UpDown Tre...
Jinlin Chen, Terry Cook
TKDE
2008
94views more  TKDE 2008»
13 years 8 months ago
DryadeParent, An Efficient and Robust Closed Attribute Tree Mining Algorithm
In this paper, we present a new tree mining algorithm, DRYADEPARENT, based on the hooking principle first introduced in DRYADE. In the experiments, we demonstrate that the branchin...
Alexandre Termier, Marie-Christine Rousset, Mich&e...