Sciweavers

37 search results - page 1 / 8
» Faster Algorithms for Finding Missing Patterns
Sort
View
SODA
1998
ACM
157views Algorithms» more  SODA 1998»
13 years 6 months ago
Approximate String Matching: A Simpler Faster Algorithm
We give two algorithms for finding all approximate matches of a pattern in a text, where the edit distance between the pattern and the matching text substring is at most k. The fir...
Richard Cole, Ramesh Hariharan
DEXA
2006
Springer
136views Database» more  DEXA 2006»
13 years 8 months ago
Faster Twig Pattern Matching Using Extended Dewey ID
Finding all the occurrences of a twig pattern in an XML database is a core operation for efficient evaluation of XML queries. Recently, Lu et al. [7] proposed the TJFast algorithm ...
Chung Keung Poon, Leo Yuen
ICDM
2002
IEEE
148views Data Mining» more  ICDM 2002»
13 years 9 months ago
SLPMiner: An Algorithm for Finding Frequent Sequential Patterns Using Length-Decreasing Support Constraint
Over the years, a variety of algorithms for finding frequent sequential patterns in very large sequential databases have been developed. The key feature in most of these algorith...
Masakazu Seno, George Karypis
AMW
2009
13 years 5 months ago
Using Patterns for Faster and Scalable Rewriting of Conjunctive Queries
Abstract. Rewriting of conjunctive queries using views has many applications in database and data integration. We investigate ways to improve performance of rewriting and propose a...
Ali Kiani, Nematollaah Shiri