621 search results - page 68 / 125 » Efficient algorithms for minimizing tree pattern queries |
VLDB
1991
ACM
13 years 11 months ago
1991
ACM
We propose a two-pha.se algorithm for physical database design. In phase one the algorithm, for each logical query, losesrules to determine characteristics of a physical design (s...
KDD
1997
ACM
14 years 3 days ago
1997
ACM
Theproblemof efficiently and accurately locating patterns of interest in massivetimeseries data sets is an important and non-trivial problemin a wide variety of applications, incl...
COLING
2010
13 years 2 months ago
2010
The Varro toolkit is a system for identifying and counting a major class of regularity in treebanks and annotated natural language data in the form of treestructures: frequently r...
ICDCS
2005
IEEE
14 years 1 months ago
2005
IEEE
Directories have become an important component of the enterprise security and identity management middleware. This paper describes a novel filter based replication model for Light...
ICDE
2010
IEEE
14 years 7 months ago
2010
IEEE
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...