167 search results - page 22 / 34 » Threshold Similarity Queries in Large Time Series Databases |
ICDE
2010
IEEE
15 years 9 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...
KDD
2004
ACM
15 years 10 months ago
2004
ACM
Given a user-specified minimum correlation threshold and a market basket database with N items and T transactions, an all-strong-pairs correlation query finds all item pairs with...
VLDB
1997
ACM
15 years 1 months ago
1997
ACM
This paper presents a region splitting strategy for physical database design of multidimensional le organizations. Physical database design is the process of determining the optim...
BMCBI
2008
14 years 9 months ago
2008
Background: Similarity inference, one of the main bioinformatics tasks, has to face an exponential growth of the biological data. A classical approach used to cope with this data ...
164
click to vote
SIGMOD
2009
ACM
15 years 10 months ago
2009
ACM
When a database query has a large number of results, the user can only be shown one page of results at a time. One popular approach is to rank results such that the "best&quo...