Please use this identifier to cite or link to this item:
Title: Approximate web database snapshots
Authors: Leong, HV 
Chan, A
Ngai, G 
Keywords: Quality of snapshot
Consistent snapshot
Approximate snapshot
Temporal divergence
Issue Date: 2015
Publisher: Institute of Electrical and Electronics Engineers
Source: 2015 IEEE 39th Annual Computer Software and Applications Conference (COMPSAC), Taichung, Taiwan, 1-5 July 2015, p. 367-376 How to cite?
Abstract: The amount of data stored in databases is increasing at a tremendous rate. They are oftentimes stored over the web to be accessed by various clients. One useful and interesting query to a collection of databases is to capture a consistent snapshot of a set of interested attributes across the databases. While traditional snapshot algorithms for a distributed database could be adopted, they are mainly designed for database recovery and are costly to execute. We need efficient algorithms to return good-enough snapshots for querying purposes, in the absence of a consistent but costly snapshot as defined in distributed systems. In this paper, we propose the notion of an approximate consistent snapshot by considering and minimizing the deviation of the collected snapshot covering the interested attributes from a reference absolute snapshot. There are several variations of this kind of approximate snapshots. We propose effective algorithms to capture such snapshots in a collection of databases and then conduct performance evaluation on their efficiency. We believe that this notion of approximate consistency would be useful in practical situations.
ISBN: 978-1-4673-6564-2 (electronic)
978-1-4673-6563-5 (USB)
DOI: 10.1109/COMPSAC.2015.144
Appears in Collections:Conference Paper

View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

Last Week
Last month
Citations as of Aug 12, 2018

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.