189 search results - page 5 / 38 » Approximating predicates and expressive queries on probabili... |
ICDE
1994
IEEE
14 years 21 days ago
1994
IEEE
In applications like nancial trading, scheduling, manufacturing and process control, time based predicates in queries and rules are very important. There is also a need to de ne ...
ICDE
2010
IEEE
14 years 8 months ago
2010
IEEE
Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...
ICDE
2010
IEEE
14 years 8 months ago
2010
IEEE
Abstract-- This paper introduces a deterministic approximation algorithm with error guarantees for computing the probability of propositional formulas over discrete random variable...
SIGMOD
2005
ACM
14 years 8 months ago
2005
ACM
Many analysis and monitoring applications require the repeated execution of expensive modeling functions over streams of rapidly changing data. These applications can often be exp...
ICDE
2010
IEEE
14 years 1 months ago
2010
IEEE
—This paper presents IQP - a novel approach to bridge the gap between usability of keyword search and expressiveness of database queries. IQP enables a user to start with an arbi...