Publication
Title
Space-bounded query approximation
Author
Abstract
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), identifies a part C of the data D that (i) fits 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.
Language
English
Source (journal)
Lecture notes in computer science. - Berlin, 1973, currens
Publication
Berlin : 2015
ISBN
978-3-319-23135-8; 978-3-319-23134-1
Volume/pages
9282(2015), p. 397-414
ISI
000364683000031
Full text (Publisher's DOI)
UAntwerpen
Faculty/Department
Research group
Publication type
Subject
Affiliation
Publications with a UAntwerp address
External links
Web of Science
Record
Identification
Creation 26.10.2015
Last edited 09.06.2017
To cite this reference