Incremental updates based on graph theory for consumer electronic devices

Abstract

This paper presents a method for incremental updating on consumer electronic devices, called differential compression based on Dijkstra algorithm (DDIFF). It describes the similarities between the old and new versions as a directed weighted graph. In the graph, the shortest path between the start and end vertices corresponds to the minimal delta. As a result, the delta-encoding problem is reduced to the single-source shortest path problem. Experiments show that the proposed method is feasible, and average data transmission saving is as high as 69.3%. In comparison with the existing methods, DDIFF constructs the minimal patch, and the patch costs less time to apply 1 .

Virtual-Blind-Road Following-Based Wearable Navigation Device for Blind People

“…This PoI-graph was utilized in this paper as the global map. There are many PoI-graph based way-finding algorithms, such as Dijkstra [30], A* [1] [12], D* [31], etc. However, this is not the focus of this paper.…”

Research on Incremental Updating

“…Obviously, the difference with the subsequent development of the algorithm comparison algorithm is not worth mentioning, because of the large and rough differences information it acquired, nor the differential results for compression. Later, the incremental updating algorithm is mostly refined to the byte level and uses compression algorithm similar to ZivLempel to compress the difference results [18], which greatly improves the compression ratio of the algorithm.…”

“…It is defined as the minimum number of edits required for a sequence to change to another sequence, and a shortest path found on the edit graph indicate a differencing result. DDIFF algorithm [18] proposed by Gui-qiang Ni, Zhi-long Chen [18] also uses the concept of edit graph. Compared to LCS, the edit distance can better describe the difference between the sequences, and output smaller difference information.…”

Delta compression optimisation for UAV‐enabled mobile edge caching

“…storing the previous offset and discarding the current one once a collision happens. Agarwal describes the hash suffix array delta (hsadelta) algorithm [26, 27], which combines the suffix technique with the hash method. The hsadelta algorithm finds the best matches for every offset of version file and performs similar compression to a simple greedy algorithm.…”