662 search results - page 78 / 133 » Approximate Queries and Representations for Large Data Seque... |
ICDE
2010
IEEE
14 years 7 months ago
2010
IEEE
A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicate...
ICASSP
2010
IEEE
13 years 8 months ago
2010
IEEE
Handling large amounts of data, such as large image databases, requires the use of approximate nearest neighbor search techniques. Recently, Hamming embedding methods such as spec...
CIKM
1999
Springer
14 years 5 hour ago
1999
Springer
On-line analytical processing (OLAP) requires e cient processing of complex decision support queries over very large databases. It is well accepted that pre-computed data cubes ca...
BTW
2009
Springer
13 years 11 months ago
2009
Springer
Abstract: Efficient content-based similarity search in large multimedia databases requires efficient query processing algorithms for many practical applications. Especially in hi...
SIGMOD
2002
ACM
14 years 7 months ago
2002
ACM
Recent work has demonstrated the effectiveness of the wavelet decomposition in reducing large amounts of data to compact sets of wavelet coefficients (termed "wavelet synopse...