65 search results - page 5 / 13 » Efficient Memory Bound Puzzles Using Pattern Databases |
SIGMOD
1996
ACM
13 years 11 months ago
1996
ACM
Finding useful patterns in large datasets has attracted considerable interest recently, and one of the most widely st,udied problems in this area is the identification of clusters...
WWW
2008
ACM
14 years 7 months ago
2008
ACM
In this paper, we formalize the problem of Basic Graph Pattern (BGP) optimization for SPARQL queries and main memory graph implementations of RDF data. We define and analyze the c...
ICDE
2006
IEEE
14 years 8 months ago
2006
IEEE
Existing techniques to mine periodic patterns in time series data are focused on discovering full-cycle periodic patterns from an entire time series. However, many useful partial ...
KDD
2004
ACM
14 years 7 months ago
2004
ACM
Mining frequent structural patterns from graph databases is an interesting problem with broad applications. Most of the previous studies focus on pruning unfruitful search subspac...
ICDE
2006
IEEE
14 years 8 months ago
2006
IEEE
Streaming XPath evaluation algorithms must record a potentially exponential number of pattern matches when both predicates and descendant axes are present in queries, and the XML ...