Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

ADBIS
2015
Springer

favoriteEmaildiscussreport

24views Database» more ADBIS 2015»

Space-Bounded Query Approximation

8 years 18 days ago

Space-Bounded Query Approximation

Download win.ua.ac.be

When dealing with large amounts of data, exact query answering is not always feasible. We propose a query approximation method that, given an upper bound on the amount of data that can be used (i.e., for which query evaluation is still feasible), identiﬁes a part C of the data D that (i) ﬁts in the available space budget; and (ii) provides accurate query results. That is, for a given query Q, the query result Q(C) is close to the exact answer Q(D). In this paper, we present the theoretical framework underlying our query approximation method and provide an experimental validation of the approach.

Boris Cule, Floris Geerts, Reuben Ndindi

Real-time Traffic

ADBIS 2015 | Database |

claim paper

Related Content

» A Note on Randomized Streaming Space Bounds for the Longest Increasing Subsequence Problem

» Relaxed space bounding for moving objects a case for the buddy tree

» Spaceefficient approximate Voronoi diagrams

» Colored Range Queries and Document Retrieval

» An Improved Data Stream Summary The CountMin Sketch and Its Applications

» Matching Subsequences in Trees

» Maintaining variance and kmedians over data stream windows

» Space and timeefficient deterministic algorithms for biased quantiles over data streams

» Approximate Shortest Distance Computing A QueryDependent Local Landmark Scheme

» Faster Approximate Distance Queries and Compact Routing in Sparse Graphs

Post Info
More Details (n/a)

Added	13 Apr 2016
Updated	13 Apr 2016
Type	Journal
Year	2015
Where	ADBIS
Authors	Boris Cule, Floris Geerts, Reuben Ndindi

Comments (0)