Sciweavers

2850 search results - page 157 / 570
» Answering Queries using Humans, Algorithms and Databases
Sort
View
125
Voted
ICASSP
2008
IEEE
15 years 9 months ago
Fast query by example of environmental sounds via robust and efficient cluster-based indexing
There has been much recent progress in the technical infrastructure necessary to continuously characterize and archive all sounds, or more precisely auditory streams, that occur w...
Jiachen Xue, Gordon Wichern, Harvey D. Thornburg, ...
147
Voted
VLDB
2004
ACM
227views Database» more  VLDB 2004»
15 years 8 months ago
Approximate NN queries on Streams with Guaranteed Error/performance Bounds
In data stream applications, data arrive continuously and can only be scanned once as the query processor has very limited memory (relative to the size of the stream) to work with...
Nick Koudas, Beng Chin Ooi, Kian-Lee Tan, Rui Zhan...
133
Voted
ADBIS
2009
Springer
148views Database» more  ADBIS 2009»
15 years 10 months ago
On Containment of Conjunctive Queries with Negation
Abstract. We consider the problem of query containment for conjunctive queries with the safe negation property. Some necessary conditions for this problem are given. A part of the ...
Victor Felea
112
Voted
VLDB
1994
ACM
148views Database» more  VLDB 1994»
15 years 7 months ago
Cache Conscious Algorithms for Relational Query Processing
The current main memory (DRAM) access speeds lag far behind CPU speeds. Cache memory, made of static RAM, is being used in today's architectures to bridge this gap. It provid...
Ambuj Shatdal, Chander Kant, Jeffrey F. Naughton
SIGMOD
2008
ACM
127views Database» more  SIGMOD 2008»
15 years 3 months ago
Minimization of tree pattern queries with constraints
Tree pattern queries (TPQs) provide a natural and easy formalism to query tree-structured XML data, and the efficient processing of such queries has attracted a lot of attention. ...
Ding Chen, Chee Yong Chan