189 search results - page 11 / 38 » Approximating predicates and expressive queries on probabili... |
ICDT
2001
ACM
14 years 1 months ago
2001
ACM
In fast OLAP applications it is often advantageous to provide approximate answers to range queries in order to achieve very high performances. A possible solution is to inquire sum...
EDBT
2010
ACM
14 years 3 months ago
2010
ACM
There are two broad approaches to query evaluation over probabilistic databases: (1) Intensional Methods proceed by manipulating expressions over symbolic events associated with u...
DASFAA
2004
IEEE
14 years 11 days ago
2004
IEEE
For event filtering of publish/subscribe system, significant research efforts have been dedicated to techniques based on multiple one-dimensional indexes built on attributes of sub...
ICDE
2006
IEEE
14 years 10 months ago
2006
IEEE
We consider the problem of creating a sample view of a database table. A sample view is an indexed, materialized view that permits efficient sampling from an arbitrary range query...
DBPL
2007
Springer
14 years 2 months ago
2007
Springer
Annotated relational databases can be queried either by simply making the annotations explicitly available along the ordinary data, or by adapting the standard query operators so ...