662 search results - page 13 / 133 » Approximate Queries and Representations for Large Data Seque... |
SIGMOD
2004
ACM
14 years 8 months ago
2004
ACM
Subsequence similarity matching in time series databases is an important research area for many applications. This paper presents a new approximate approach for automatic online s...
SSDBM
2003
IEEE
14 years 1 months ago
2003
IEEE
The growing interest in genomic research has caused an explosive growth in the size of DNA databases making it increasely challenging to perform searches on them. In this paper, w...
SIGMOD
1998
ACM
14 years 3 days ago
1998
ACM
In large data recording and warehousing environments, it is often advantageous to provide fast, approximate answers to queries, whenever possible. Before DBMSs providing highly-ac...
KR
1992
Springer
13 years 12 months ago
1992
Springer
While the task of answering queries from an arbitrary propositional theory is intractable in general, it can typicallybe performed e ciently if the theory is Horn. This suggests t...
BNCOD
2003
13 years 9 months ago
2003
There are two aspects to the work being presented here. The first is a novel persistent index structure for genomic data, a prototype of which has been completed. The second, usin...