Confirmed users
471
edits
No edit summary |
|||
Line 265: | Line 265: | ||
hash only if they were deleted in the delta, and always including the newer | hash only if they were deleted in the delta, and always including the newer | ||
version). | version). | ||
= Dataset Representation = | |||
Sync efficiency is improved when the native datastore maintains a stable ID | |||
for each entry, and modifies entries in place. With IDs, modifying the name | |||
of a bookmark can be distinguished from deleting the bookmark and adding one | |||
with the same URI but different name. This will also improve the fidelity of | |||
merge operations: it is clear how to merge one change (that modifies the | |||
bookmark's name) with another (that moves it to a different folder). | |||
This section details how various browser native datastores are organized, and | |||
how they should be transformed into a set of key-value pairs. | |||
With luck, a simple "take the latest value for each key" merge algorithm | |||
should give good results. But some datatypes may be improved with more | |||
sophisticated approaches, also described here. | |||
== Bookmarks == | |||
== Passwords == | |||
== Open Tabs == |