Sciweavers

52 search results - page 8 / 11
» Optimization of continuous queries with shared expensive fil...
Sort
View
INFOCOM
2006
IEEE
14 years 1 months ago
Theory and Network Applications of Dynamic Bloom Filters
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
Deke Guo, Jie Wu, Honghui Chen, Xueshan Luo
CVDB
2005
ACM
13 years 9 months ago
Optimizing progressive query-by-example over pre-clustered large image databases
The typical mode for querying in an image content-based information system is query-by-example, which allows the user to provide an image as a query and to search for similar imag...
Anicet Kouomou Choupo, Laure Berti-Equille, Annie ...
CLUSTER
2008
IEEE
13 years 9 months ago
Efficient one-copy MPI shared memory communication in Virtual Machines
Efficient intra-node shared memory communication is important for High Performance Computing (HPC), especially with the emergence of multi-core architectures. As clusters continue ...
Wei Huang, Matthew J. Koop, Dhabaleswar K. Panda
FODO
1993
Springer
110views Algorithms» more  FODO 1993»
13 years 11 months ago
Storage System Architectures for Continuous Media Data
Abstract. Data storage systems are being called on to manage continuous media data types, such as digital audio and video. There is a demand by applications for \constrained-latenc...
David Maier, Jonathan Walpole, Richard Staehli
IDEAS
2008
IEEE
80views Database» more  IDEAS 2008»
14 years 1 months ago
Improved count suffix trees for natural language data
With more and more natural language text stored in databases, handling respective query predicates becomes very important. Optimizing queries with predicates includes (sub)string ...
Guido Sautter, Cristina Abba, Klemens Böhm