Sciweavers

481 search results - page 14 / 97
» Approximate XML Query Answers
Sort
View
DOLAP
2005
ACM
13 years 9 months ago
Providing probabilistically-bounded approximate answers to non-holistic aggregate range queries in OLAP
A novel framework for providing probabilistically-bounded approximate answers to non-holistic aggregate range queries in OLAP is presented in this paper. Such a framework allows u...
Alfredo Cuzzocrea
SIGMOD
1998
ACM
121views Database» more  SIGMOD 1998»
14 years 3 days ago
New Sampling-Based Summary Statistics for Improving Approximate Query Answers
In large data recording and warehousing environments, it is often advantageous to provide fast, approximate answers to queries, whenever possible. Before DBMSs providing highly-ac...
Phillip B. Gibbons, Yossi Matias
VLDB
2000
ACM
155views Database» more  VLDB 2000»
13 years 11 months ago
ICICLES: Self-Tuning Samples for Approximate Query Answering
Approximate query answering systems provide very fast alternatives to OLAP systems when applications are tolerant to small errors in query answers. Current sampling-based approach...
Venkatesh Ganti, Mong-Li Lee, Raghu Ramakrishnan
JIIS
2008
95views more  JIIS 2008»
13 years 7 months ago
Approximate schemas, source-consistency and query answering
We use the Edit distance with Moves on words and trees and say that two regular (tree) languages are -close if every word (tree) of one language is -close to the other. A transduc...
Michel de Rougemont, Adrien Vieilleribière
SIGMOD
1999
ACM
101views Database» more  SIGMOD 1999»
14 years 6 days ago
Join Synopses for Approximate Query Answering
In large data warehousing environments, it is often advantageous to provide fast, approximate answers to complex aggregate queries based on statistical summaries of the full data....
Swarup Acharya, Phillip B. Gibbons, Viswanath Poos...