Sciweavers

1038 search results - page 41 / 208
» Space-Bounded Query Approximation
Sort
View
SIGMOD
2006
ACM
121views Database» more  SIGMOD 2006»
15 years 5 months ago
Derby/S: a DBMS for sample-based query answering
Although approximate query processing is a prominent way to cope with the requirements of data analysis applications, current database systems do not provide integrated and compre...
Anja Klein, Rainer Gemulla, Philipp Rösch, Wo...
ICDT
2001
ACM
153views Database» more  ICDT 2001»
15 years 4 months ago
Estimating Range Queries Using Aggregate Data with Integrity Constraints: A Probabilistic Approach
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...
Francesco Buccafurri, Filippo Furfaro, Domenico Sa...
ICDE
2008
IEEE
166views Database» more  ICDE 2008»
16 years 1 months ago
A Clustered Index Approach to Distributed XPath Processing
Supporting top-k queries over distributed collections of schemaless XML data poses two challenges. While XML supports expressive query languages such as XPath and XQuery, these la...
Georgia Koloniari, Evaggelia Pitoura
ICDE
2006
IEEE
164views Database» more  ICDE 2006»
16 years 1 months ago
New Sampling-Based Estimators for OLAP Queries
One important way in which sampling for approximate query processing in a database environment differs from traditional applications of sampling is that in a database, it is feasi...
Ruoming Jin, Leonid Glimcher, Chris Jermaine, Gaga...
VLDB
1998
ACM
111views Database» more  VLDB 1998»
15 years 4 months ago
Filtering with Approximate Predicates
Approximate predicates can be used to reduce the number of comparisons made by expensive, complex predicates. For example, to check if a point is within a region (expensive predic...
Narayanan Shivakumar, Hector Garcia-Molina, Chandr...