2463 search results - page 341 / 493 » Compressing Pattern Databases |
PAKDD
2004
ACM
15 years 3 months ago
2004
ACM
Abstract. Tree structures are used extensively in domains such as computational biology, pattern recognition, XML databases, computer networks, and so on. One important problem in ...
115
click to vote
PODS
2010
ACM
15 years 3 months ago
2010
ACM
For many problems arising in the setting of graph querying (such as finding semantic associations in RDF graphs, exact and approximate pattern matching, sequence alignment, etc.)...
VLDB
2001
ACM
15 years 2 months ago
2001
ACM
In this paper we propose a new operator for advanced exploration of large multidimensional databases. The proposed operator can automatically generalize from a specific problem c...
PODS
2000
ACM
15 years 2 months ago
2000
ACM
The problem of query containment is fundamental to many aspects of database systems, including query optimization, determining independence of queries from updates, and rewriting ...
SIGMOD
2000
ACM
15 years 2 months ago
2000
ACM
For many KDD applications, such as detecting criminal activities in E-commerce, finding the rare instances or the outliers, can be more interesting than finding the common pattern...