. "In ambito informatico, una struttura dati persistente \u00E8 una struttura dati che quando viene modificata conserva sempre la versione precedente di se stessa: tali strutture dati sono di fatto immutabili in quanto le operazioni fatte su di esse non aggiornano in modo visibile la struttura in essere portando invece alla creazione di una nuova struttura aggiornata. Una struttura dati persistente non \u00E8 da intendersi come una struttura dati memorizzata su una memoria persistente (permanente) come pu\u00F2 essere un disco rigido: si tratta di un diverso significato del termine persistente."@it . "Estructuras de datos persistentes"@es . . . . . . . . . . . . . . . . . . . "\u6C38\u7D9A\u30C7\u30FC\u30BF\u69CB\u9020"@ja . . . . "En computaci\u00F3n, una estructura de datos persistente es una estructura de datos que siempre preserva sus versiones anteriores, despu\u00E9s de ser modificada. Este tipo de estructura son , ya que sus operaciones no modifican la estructura actual, sino que crean una nueva estructura modificada. (Este art\u00EDculo utiliza el t\u00E9rmino Persistencia de datos para referirse a datos obsoletos; no confundir con el significado de almacenamiento de informaci\u00F3n en un medio persistente, como un disco duro.) Una estructura es parcialmente persistente si se puede acceder a todas sus versiones, pero solo se puede modificar la \u00FAltima. Una estructura es completamente persistente si todas las versiones pueden ser accedidas y modificadas. Si tambi\u00E9n existe la posibilidad de mezclar dos versiones de la estructura, se dice que esta es confluently persistent. Las estructuras que no son persistentes son llamadas transitorias.\u200B Este tipo de estructuras son comunes particularmente en programaci\u00F3n l\u00F3gica y programaci\u00F3n funcional. En un lenguaje de programaci\u00F3n puramente funcional todos los datos son inmutables, as\u00ED que todas las estructuras son completamente persistentes.\u200B La persistencia se puede lograr simplemente copiando las estructuras completas, pero esto puede ser muy ineficiente en cuanto a c\u00E1lculos del CPU y consumo de memoria RAM, debido a que generalmente solo se hacen peque\u00F1os cambios. Lo mejor ser\u00EDa explotar la similitud que existe entre la nueva versi\u00F3n y sus versiones anteriores, y compartir parte de su estructura con ellas, como por ejemplo, utilizar algunos sub-\u00E1rboles que no se modificaron para el caso de las estructuras formadas por \u00E1rboles. De todas formas, debido a que r\u00E1pidamente se vuelve no factible determinar cuantas versiones anteriores comparten partes en com\u00FAn con la estructura actual y a que a veces se hace necesario descartar versiones anteriores, es necesario contar con recolector de basura."@es . . . . . . . . . . . "\u5728\u8BA1\u7B97\u673A\u7F16\u7A0B\u4E2D\uFF0C\u53EF\u6301\u4E45\u5316\u6570\u636E\u7ED3\u6784\uFF08Persistent data structure\uFF09\u662F\u4E00\u79CD\u80FD\u591F\u5728\u4FEE\u6539\u4E4B\u540E\u5176\u4FDD\u7559\u5386\u53F2\u7248\u672C\uFF08\u5373\u53EF\u4EE5\u5728\u4FDD\u7559\u539F\u6765\u6570\u636E\u7684\u57FA\u7840\u4E0A\u8FDB\u884C\u4FEE\u6539\u2014\u2014\u6BD4\u5982\u589E\u6DFB\u3001\u5220\u9664\u3001\u8D4B\u503C\uFF09\u7684\u6570\u636E\u7ED3\u6784\u3002\u8FD9\u79CD\u6570\u636E\u7ED3\u6784\u5B9E\u9645\u4E0A\u662F\u4E0D\u53EF\u53D8\u5BF9\u8C61\uFF0C\u56E0\u4E3A\u76F8\u5173\u64CD\u4F5C\u4E0D\u4F1A\u76F4\u63A5\u4FEE\u6539\u88AB\u4FDD\u5B58\u7684\u6570\u636E\uFF0C\u800C\u662F\u4F1A\u5728\u539F\u7248\u672C\u4E0A\u4EA7\u751F\u4E00\u4E2A\u65B0\u5206\u652F\u3002\u8FD9\u4E2A\u672F\u8BED\u662F\u57281986\u5E74Driscoll\u3001Sarnak\u3001Sleator\u548CTarjans\u7684\u6587\u7AE0\u4E2D\u63D0\u51FA\u7684\u3002 \u5982\u679C\u4E00\u4E2A\u6570\u636E\u7ED3\u6784\u5305\u62EC\u5F53\u524D\u7248\u672C\u5728\u5185\u7684\u6240\u6709\u5386\u53F2\u7248\u672C\u90FD\u53EF\u4EE5\u88AB\u8BBF\u95EE\uFF0C\u4F46\u53EA\u6709\u5F53\u524D\u7248\u672C\u53EF\u4EE5\u88AB\u4FEE\u6539\uFF0C\u90A3\u4E48\u8BE5\u6570\u636E\u7ED3\u6784\u5C31\u662F\u90E8\u5206\u53EF\u6301\u4E45\u5316\u6570\u636E\u7ED3\u6784\u3002\u5982\u679C\u8BE5\u6570\u636E\u7ED3\u6784\u7684\u6240\u6709\u7248\u672C\u90FD\u53EF\u4EE5\u88AB\u67E5\u8BE2\u6216\u4FEE\u6539\uFF0C\u90A3\u4E48\u8FD9\u79CD\u6570\u636E\u7ED3\u6784\u5C31\u662F\u5B8C\u5168\u53EF\u6301\u4E45\u5316\u6570\u636E\u7ED3\u6784\u3002\u5982\u679C\u5B58\u5728\u80FD\u591F\u521B\u5EFA\u57FA\u4E8E\u4E24\u4E2A\u5386\u53F2\u7248\u672C\u7684\u65B0\u7248\u672C\uFF08\u5373\u5408\u5E76\u4E24\u4E2A\u7248\u672C meld \uFF08\u6D47\u94F8\uFF08\uFF1F\uFF09\u6DF7\u5408\uFF08\uFF1F\uFF09\uFF09\u6216 merge \uFF08\u5408\u5E76\uFF09\u64CD\u4F5C\uFF09\uFF0C\u90A3\u4E48\u8FD9\u79CD\u6570\u636E\u7ED3\u6784\u5C31\u662F\u53EF\u6C47\u5408\u7684\u53EF\u6301\u4E45\u5316\u6570\u636E\u7ED3\u6784\u3002\u4E0D\u53EF\u6301\u4E45\u5316\u7684\u6570\u636E\u7ED3\u6784\u88AB\u79F0\u4E3A\u77ED\u6682\u6027\u6570\u636E\u7ED3\u6784\u3002 \u8FD9\u4E9B\u7C7B\u578B\u7684\u6570\u636E\u7ED3\u6784\u5728\u903B\u8F91\u7F16\u7A0B\u548C\u51FD\u6570\u5F0F\u7F16\u7A0B\u4E4B\u4E2D\u975E\u5E38\u5E38\u89C1\u3002"@zh . . . . . . "662889"^^ . . . . "Structure de donn\u00E9es persistante"@fr . . . "Struttura dati persistente"@it . . "En informatique, une structure de donn\u00E9es persistante est une structure de donn\u00E9es qui pr\u00E9serve ses versions ant\u00E9rieures lorsqu'elle est modifi\u00E9e ; une telle structure est immuable, car ses op\u00E9rations ne la modifient pas en place (de mani\u00E8re visible) mais renvoient au contraire de nouvelles structures."@fr . . . . . . . . . . . "\u5728\u8BA1\u7B97\u673A\u7F16\u7A0B\u4E2D\uFF0C\u53EF\u6301\u4E45\u5316\u6570\u636E\u7ED3\u6784\uFF08Persistent data structure\uFF09\u662F\u4E00\u79CD\u80FD\u591F\u5728\u4FEE\u6539\u4E4B\u540E\u5176\u4FDD\u7559\u5386\u53F2\u7248\u672C\uFF08\u5373\u53EF\u4EE5\u5728\u4FDD\u7559\u539F\u6765\u6570\u636E\u7684\u57FA\u7840\u4E0A\u8FDB\u884C\u4FEE\u6539\u2014\u2014\u6BD4\u5982\u589E\u6DFB\u3001\u5220\u9664\u3001\u8D4B\u503C\uFF09\u7684\u6570\u636E\u7ED3\u6784\u3002\u8FD9\u79CD\u6570\u636E\u7ED3\u6784\u5B9E\u9645\u4E0A\u662F\u4E0D\u53EF\u53D8\u5BF9\u8C61\uFF0C\u56E0\u4E3A\u76F8\u5173\u64CD\u4F5C\u4E0D\u4F1A\u76F4\u63A5\u4FEE\u6539\u88AB\u4FDD\u5B58\u7684\u6570\u636E\uFF0C\u800C\u662F\u4F1A\u5728\u539F\u7248\u672C\u4E0A\u4EA7\u751F\u4E00\u4E2A\u65B0\u5206\u652F\u3002\u8FD9\u4E2A\u672F\u8BED\u662F\u57281986\u5E74Driscoll\u3001Sarnak\u3001Sleator\u548CTarjans\u7684\u6587\u7AE0\u4E2D\u63D0\u51FA\u7684\u3002 \u5982\u679C\u4E00\u4E2A\u6570\u636E\u7ED3\u6784\u5305\u62EC\u5F53\u524D\u7248\u672C\u5728\u5185\u7684\u6240\u6709\u5386\u53F2\u7248\u672C\u90FD\u53EF\u4EE5\u88AB\u8BBF\u95EE\uFF0C\u4F46\u53EA\u6709\u5F53\u524D\u7248\u672C\u53EF\u4EE5\u88AB\u4FEE\u6539\uFF0C\u90A3\u4E48\u8BE5\u6570\u636E\u7ED3\u6784\u5C31\u662F\u90E8\u5206\u53EF\u6301\u4E45\u5316\u6570\u636E\u7ED3\u6784\u3002\u5982\u679C\u8BE5\u6570\u636E\u7ED3\u6784\u7684\u6240\u6709\u7248\u672C\u90FD\u53EF\u4EE5\u88AB\u67E5\u8BE2\u6216\u4FEE\u6539\uFF0C\u90A3\u4E48\u8FD9\u79CD\u6570\u636E\u7ED3\u6784\u5C31\u662F\u5B8C\u5168\u53EF\u6301\u4E45\u5316\u6570\u636E\u7ED3\u6784\u3002\u5982\u679C\u5B58\u5728\u80FD\u591F\u521B\u5EFA\u57FA\u4E8E\u4E24\u4E2A\u5386\u53F2\u7248\u672C\u7684\u65B0\u7248\u672C\uFF08\u5373\u5408\u5E76\u4E24\u4E2A\u7248\u672C meld \uFF08\u6D47\u94F8\uFF08\uFF1F\uFF09\u6DF7\u5408\uFF08\uFF1F\uFF09\uFF09\u6216 merge \uFF08\u5408\u5E76\uFF09\u64CD\u4F5C\uFF09\uFF0C\u90A3\u4E48\u8FD9\u79CD\u6570\u636E\u7ED3\u6784\u5C31\u662F\u53EF\u6C47\u5408\u7684\u53EF\u6301\u4E45\u5316\u6570\u636E\u7ED3\u6784\u3002\u4E0D\u53EF\u6301\u4E45\u5316\u7684\u6570\u636E\u7ED3\u6784\u88AB\u79F0\u4E3A\u77ED\u6682\u6027\u6570\u636E\u7ED3\u6784\u3002 \u8FD9\u4E9B\u7C7B\u578B\u7684\u6570\u636E\u7ED3\u6784\u5728\u903B\u8F91\u7F16\u7A0B\u548C\u51FD\u6570\u5F0F\u7F16\u7A0B\u4E4B\u4E2D\u975E\u5E38\u5E38\u89C1\u3002"@zh . . . . . "En informatique, une structure de donn\u00E9es persistante est une structure de donn\u00E9es qui pr\u00E9serve ses versions ant\u00E9rieures lorsqu'elle est modifi\u00E9e ; une telle structure est immuable, car ses op\u00E9rations ne la modifient pas en place (de mani\u00E8re visible) mais renvoient au contraire de nouvelles structures. Une structure est partiellement persistante si seule sa version la plus r\u00E9cente peut \u00EAtre modifi\u00E9e, les autres n'\u00E9tant accessibles qu'en lecture. La structure est dite totalement persistante si chacune de ses versions peut \u00EAtre lue ou modifi\u00E9e. S'il existe une op\u00E9ration permettant la fusion de deux versions ant\u00E9rieures, la structure est dite confluente. Les structures qui ne sont pas persistantes sont dites \u00E9ph\u00E9m\u00E8res."@fr . . . . . . . . . . . . "Trwa\u0142a struktura danych albo czysto funkcyjna struktura danych \u2013 struktura danych, kt\u00F3ra zawsze zachowuje swoje poprzednie wersje, kiedy s\u0105 modyfikowane. Takie struktury danych s\u0105 w efekcie niezmienne, jako \u017Ce operacje na nich nie powoduj\u0105 zmiany samej struktury, lecz powoduj\u0105 powstanie nowej, uaktualnionej jej wersji. Trwa\u0142a struktura danych nie jest struktur\u0105 danych sk\u0142adowan\u0105 na trwa\u0142ym no\u015Bniku danych, takim jak dysk; jest to inne i niepowi\u0105zane znaczenie s\u0142owa \"trwa\u0142y\". Struktura danych jest cz\u0119\u015Bciowo trwa\u0142a, je\u015Bli wszystkie jej wersje mog\u0105 by\u0107 odczytane, ale tylko najnowsza wersja mo\u017Ce by\u0107 modyfikowana.Struktura danych jest ca\u0142kowicie trwa\u0142a, je\u015Bli wszystkie jej wersje mog\u0105 by\u0107 odczytane i modyfikowane.Struktura danych jest zbie\u017Cnie trwa\u0142a (ang. confluently persistent), je\u015Bli istnieje operacja mieszania lub scalania, kt\u00F3re mog\u0105 stworzy\u0107 now\u0105 wersj\u0119 na podstawie dw\u00F3ch poprzednich wersji.Struktury, kt\u00F3re nie s\u0105 trwa\u0142e, s\u0105 ulotne. Te typy struktur danych s\u0105 szczeg\u00F3lnie cz\u0119ste w programowaniu logicznym i funkcyjnym. W programowaniu czysto funkcyjnym wszystkie dane s\u0105 niezmienne i przez to struktury danych staj\u0105 si\u0119 automatycznie ca\u0142kowicie trwa\u0142e. Trwa\u0142e struktury danych mog\u0105 by\u0107 tak\u017Ce tworzone przez aktualizacj\u0119 danych w miejscu, przez co mog\u0105 one by\u0107 szybsze lub zajmowa\u0107 mniej miejsca ni\u017C ich czysto funkcyjne odpowiedniki. Trwa\u0142o\u015B\u0107 mo\u017Ce by\u0107 osi\u0105gana przez proste kopiowanie, ale jest to nieefektywne czasowo i zajmuje za du\u017Co miejsca, poniewa\u017C wi\u0119kszo\u015B\u0107 operacji wykonuje tylko drobne zmiany w tych strukturach danych. Lepszym sposobem jest wykorzystanie podobie\u0144stwa pomi\u0119dzy nowymi i starymi wersjami do wsp\u00F3\u0142dzielenia struktur pomi\u0119dzy nimi, np. u\u017Cycie tego samego poddrzewa w strukturach drzewa. Poniewa\u017C przy takim post\u0119powaniu szybko dochodzimy do sytuacji, \u017Ce istniej\u0105 liczne starsze wersje i jest wtedy konieczne okre\u015Blenie, kt\u00F3re cz\u0119\u015Bci wsp\u00F3lnej struktury s\u0105 wsp\u00F3\u0142dzielone przez te wersje, wi\u0119c po\u017C\u0105dane jest istnienie w \u015Brodowisku zarz\u0105dzania pami\u0119ci\u0105 typu garbage collection. Wtedy mo\u017Cna \u0142atwo pozby\u0107 si\u0119 starszych, niepotrzebnych wersji. By\u0107 mo\u017Ce najprostsz\u0105 trwa\u0142\u0105 struktur\u0105 danych jest lista jednokierunkowa, w kt\u00F3rym ka\u017Cdy obiekt (ogniwo tej listy) posiada wska\u017Anik do nast\u0119pnego obiektu listy. Jest to struktura trwa\u0142a, poniewa\u017C mo\u017Cemy wzi\u0105\u0107 ogon listy, tzn. ostatnie k obiekt\u00F3w i dodawa\u0107 nowe obiekty na przodzie tego ogona. Wtedy ten ogon nie b\u0119dzie powielony; b\u0119dzie wsp\u00F3\u0142dzielony pomi\u0119dzy star\u0105 i now\u0105 list\u0105. Dop\u00F3ki zawarto\u015B\u0107 ogona pozostanie niezmienna, to wsp\u00F3\u0142dzielenie b\u0119dzie niewidoczne dla programu. Wiele cz\u0119sto u\u017Cywanych struktur danych bazuj\u0105cych na wska\u017Anikach, takich jak drzewa czerwono-czarne i kolejki, mog\u0105 by\u0107 \u0142atwo zmienionych na wersje trwa\u0142e. Na przyk\u0142ad, odpowiednikiem tablicy mo\u017Ce by\u0107 , struktura danych stworzona w 2002 przez ."@pl . . . . . . . . . . . . . . "In computing, a persistent data structure or not ephemeral data structure is a data structure that always preserves the previous version of itself when it is modified. Such data structures are effectively immutable, as their operations do not (visibly) update the structure in-place, but instead always yield a new updated structure. The term was introduced in Driscoll, Sarnak, Sleator, and Tarjans' 1986 article. A data structure is partially persistent if all versions can be accessed but only the newest version can be modified. The data structure is fully persistent if every version can be both accessed and modified. If there is also a meld or merge operation that can create a new version from two previous versions, the data structure is called confluently persistent. Structures that are not persistent are called ephemeral. These types of data structures are particularly common in logical and functional programming, as languages in those paradigms discourage (or fully forbid) the use of mutable data."@en . . . . . . . . . . . . . . . . . . "\u0414\u0435\u0441\u0442\u0440\u0443\u043A\u0442\u0438\u0432\u043D\u0435 \u043E\u043D\u043E\u0432\u043B\u0435\u043D\u043D\u044F"@uk . . . . . "\u6C38\u7D9A\u30C7\u30FC\u30BF\u69CB\u9020\uFF08\u3048\u3044\u305E\u304F\u30C7\u30FC\u30BF\u3053\u3046\u305E\u3046\u3001\u82F1: Persistent data structure\uFF09\u306F\u3001\u5909\u66F4\u3055\u308C\u308B\u969B\u306B\u5909\u66F4\u524D\u306E\u30D0\u30FC\u30B8\u30E7\u30F3\u3092\u5E38\u306B\u4FDD\u6301\u3059\u308B\u30C7\u30FC\u30BF\u69CB\u9020\u3067\u3042\u308B\u3002\u3053\u306E\u3088\u3046\u306A\u30C7\u30FC\u30BF\u69CB\u9020\u306F\u3001\u66F4\u65B0\u306E\u969B\u306B\u5143\u306E\u30C7\u30FC\u30BF\u69CB\u9020\u3092\u66F8\u304D\u63DB\u3048\u308B\u306E\u3067\u306F\u306A\u304F\u3001\u65B0\u305F\u306A\u30C7\u30FC\u30BF\u69CB\u9020\u3092\u751F\u6210\u3059\u308B\u3068\u8003\u3048\u3089\u308C\u3001\u30A4\u30DF\u30E5\u30FC\u30BF\u30D6\u30EB\u306A\u30C7\u30FC\u30BF\u69CB\u9020\u306E\u69CB\u7BC9\u306B\u5229\u7528\u53EF\u80FD\u3067\u3042\u308B\u3002"@ja . "\u53EF\u6301\u4E45\u5316\u6570\u636E\u7ED3\u6784"@zh . . "En computaci\u00F3n, una estructura de datos persistente es una estructura de datos que siempre preserva sus versiones anteriores, despu\u00E9s de ser modificada. Este tipo de estructura son , ya que sus operaciones no modifican la estructura actual, sino que crean una nueva estructura modificada. (Este art\u00EDculo utiliza el t\u00E9rmino Persistencia de datos para referirse a datos obsoletos; no confundir con el significado de almacenamiento de informaci\u00F3n en un medio persistente, como un disco duro.)"@es . . . "\u0423 \u043A\u043E\u043C\u043F'\u044E\u0442\u0435\u0440\u043D\u0438\u0445 \u0441\u0438\u0441\u0442\u0435\u043C\u0430\u0445 \u0441\u0442\u0456\u0439\u043A\u0430 \u0441\u0442\u0440\u0443\u043A\u0442\u0443\u0440\u0430 \u0434\u0430\u043D\u0438\u0445 \u044F\u0432\u043B\u044F\u0454 \u0441\u043E\u0431\u043E\u044E \u0441\u0442\u0440\u0443\u043A\u0442\u0443\u0440\u0443 \u0434\u0430\u043D\u0438\u0445, \u044F\u043A\u0430 \u0437\u0430\u0432\u0436\u0434\u0438 \u0437\u0431\u0435\u0440\u0456\u0433\u0430\u0454 \u043F\u043E\u043F\u0435\u0440\u0435\u0434\u043D\u044E \u0432\u0435\u0440\u0441\u0456\u044E \u0441\u0430\u043C\u0430, \u043A\u043E\u043B\u0438 \u0457\u0457 \u0437\u043C\u0456\u043D\u044E\u044E\u0442\u044C. \u0422\u0430\u043A\u0456 \u0441\u0442\u0440\u0443\u043A\u0442\u0443\u0440\u0438 \u0434\u0430\u043D\u0438\u0445 \u0454 \u0444\u0430\u043A\u0442\u0438\u0447\u043D\u043E \u043D\u0435\u0437\u043C\u0456\u043D\u043D\u0438\u043C\u0438, \u043E\u0441\u043A\u0456\u043B\u044C\u043A\u0438 \u0457\u0445\u043D\u0456 \u043E\u043F\u0435\u0440\u0430\u0446\u0456\u0457 \u043D\u0435 \u043E\u043D\u043E\u0432\u043B\u044E\u044E\u0442\u044C \u0441\u0442\u0440\u0443\u043A\u0442\u0443\u0440\u0443 \u043D\u0430 \u043C\u0456\u0441\u0446\u0456, \u0430\u043B\u0435 \u0437\u0430\u043C\u0456\u0441\u0442\u044C \u0446\u044C\u043E\u0433\u043E \u0437\u0430\u0432\u0436\u0434\u0438 \u0434\u0430\u044E\u0442\u044C \u043D\u043E\u0432\u0443 \u043E\u043D\u043E\u0432\u043B\u0435\u043D\u0443 \u0441\u0442\u0440\u0443\u043A\u0442\u0443\u0440\u0443. \u0421\u0442\u0440\u0443\u043A\u0442\u0443\u0440\u0430 \u0434\u0430\u043D\u0438\u0445 \u0454 \u0447\u0430\u0441\u0442\u043A\u043E\u0432\u043E \u0441\u0442\u0456\u0439\u043A\u043E\u044E , \u044F\u043A\u0449\u043E \u0454 \u0434\u043E\u0441\u0442\u0443\u043F \u0434\u043E \u0432\u0441\u0456\u0445 \u0432\u0435\u0440\u0441\u0456\u0439, \u0430\u043B\u0435 \u043C\u043E\u0436\u043D\u0430 \u0437\u043C\u0456\u043D\u0438\u0442\u0438 \u043B\u0438\u0448\u0435 \u043D\u043E\u0432\u0443 \u0432\u0435\u0440\u0441\u0456\u044E. \u0421\u0442\u0440\u0443\u043A\u0442\u0443\u0440\u0430 \u0434\u0430\u043D\u0438\u0445 \u0454 \u043F\u043E\u0432\u043D\u0456\u0441\u0442\u044E \u0441\u0442\u0456\u0439\u043A\u043E\u044E, \u044F\u043A\u0449\u043E \u043A\u043E\u0436\u043D\u0430 \u0432\u0435\u0440\u0441\u0456\u044F \u043C\u043E\u0436\u0435 \u0431\u0443\u0442\u0438 \u0434\u043E\u0441\u0442\u0443\u043F\u043D\u043E\u044E \u0442\u0430 \u043C\u043E\u0434\u0438\u0444\u0456\u043A\u043E\u0432\u0430\u043D\u043E\u044E. \u042F\u043A\u0449\u043E \u0454 \u0442\u0430\u043A\u043E\u0436 \u043E\u043F\u0435\u0440\u0430\u0446\u0456\u044F meld \u0430\u0431\u043E merge, \u044F\u043A\u0430 \u043C\u043E\u0436\u0435 \u0441\u0442\u0432\u043E\u0440\u0438\u0442\u0438 \u043D\u043E\u0432\u0443 \u0432\u0435\u0440\u0441\u0456\u044E \u0437 \u0434\u0432\u043E\u0445 \u043F\u043E\u043F\u0435\u0440\u0435\u0434\u043D\u0456\u0445 \u0432\u0435\u0440\u0441\u0456\u0439, \u0441\u0442\u0440\u0443\u043A\u0442\u0443\u0440\u0430 \u0434\u0430\u043D\u0438\u0445 \u043D\u0430\u0437\u0438\u0432\u0430\u0454\u0442\u044C\u0441\u044F confluent persistent. \u0421\u0442\u0440\u0443\u043A\u0442\u0443\u0440\u0438, \u044F\u043A\u0456 \u043D\u0435 \u0454 \u0441\u0442\u0456\u0439\u043A\u0438\u043C\u0438, \u043D\u0430\u0437\u0438\u0432\u0430\u044E\u0442\u044C\u0441\u044F \u0435\u0444\u0435\u043C\u0435\u0440\u043D\u0438\u043C\u0438. \u0426\u0456 \u0442\u0438\u043F\u0438 \u0441\u0442\u0440\u0443\u043A\u0442\u0443\u0440 \u0434\u0430\u043D\u0438\u0445 \u043E\u0441\u043E\u0431\u043B\u0438\u0432\u043E \u043F\u043E\u0448\u0438\u0440\u0435\u043D\u0456 \u0432 \u043B\u043E\u0433\u0456\u0447\u043D\u043E\u043C\u0443 \u0456 \u0444\u0443\u043D\u043A\u0446\u0456\u043E\u043D\u0430\u043B\u044C\u043D\u043E\u043C\u0443 \u043F\u0440\u043E\u0433\u0440\u0430\u043C\u0443\u0432\u0430\u043D\u043D\u0456, \u0430 \u0432 \u0447\u0438\u0441\u0442\u043E \u0444\u0443\u043D\u043A\u0446\u0456\u043E\u043D\u0430\u043B\u044C\u043D\u043E\u043C\u0443 \u043F\u0440\u043E\u0433\u0440\u0430\u043C\u0443\u0432\u0430\u043D\u043D\u0456 \u0432\u0441\u0456 \u0434\u0430\u043D\u0456 \u043D\u0435\u0437\u043C\u0456\u043D\u043D\u0456, \u0442\u043E\u043C\u0443 \u0432\u0441\u0456 \u0441\u0442\u0440\u0443\u043A\u0442\u0443\u0440\u0438 \u0434\u0430\u043D\u0438\u0445 \u0430\u0432\u0442\u043E\u043C\u0430\u0442\u0438\u0447\u043D\u043E \u043F\u043E\u0432\u043D\u0456\u0441\u0442\u044E \u0441\u0442\u0456\u0439\u043A\u0456. \u041F\u043E\u0441\u0442\u0456\u0439\u043D\u0456 \u0441\u0442\u0440\u0443\u043A\u0442\u0443\u0440\u0438 \u0434\u0430\u043D\u0438\u0445 \u0442\u0430\u043A\u043E\u0436 \u043C\u043E\u0436\u0443\u0442\u044C \u0431\u0443\u0442\u0438 \u0441\u0442\u0432\u043E\u0440\u0435\u043D\u0456 \u0437\u0430 \u0434\u043E\u043F\u043E\u043C\u043E\u0433\u043E\u044E \u0432\u043D\u0443\u0442\u0440\u0456\u0448\u043D\u044C\u043E\u0433\u043E \u043E\u043D\u043E\u0432\u043B\u0435\u043D\u043D\u044F \u0434\u0430\u043D\u0438\u0445, \u0456 \u0432\u043E\u043D\u0438 \u0437\u0430\u0433\u0430\u043B\u043E\u043C \u043C\u043E\u0436\u0443\u0442\u044C \u0432\u0438\u043A\u043E\u0440\u0438\u0441\u0442\u043E\u0432\u0443\u0432\u0430\u0442\u0438 \u043C\u0435\u043D\u0448\u0438\u0439 \u043F\u0440\u043E\u043C\u0456\u0436\u043E\u043A \u0447\u0430\u0441\u0443 \u0430\u0431\u043E \u043C\u0456\u0441\u0446\u044F \u0434\u043B\u044F \u0437\u0431\u0435\u0440\u0456\u0433\u0430\u043D\u043D\u044F, \u043D\u0456\u0436 \u0457\u0445 \u0441\u0443\u0442\u043E \u0444\u0443\u043D\u043A\u0446\u0456\u043E\u043D\u0430\u043B\u044C\u043D\u0456 \u0430\u043D\u0430\u043B\u043E\u0433\u0438. \u0427\u0438\u0441\u0442\u043E \u0444\u0443\u043D\u043A\u0446\u0456\u043E\u043D\u0430\u043B\u044C\u043D\u0430 \u0441\u0442\u0440\u0443\u043A\u0442\u0443\u0440\u0430 \u0434\u0430\u043D\u0438\u0445 - \u0446\u0435 \u0441\u0442\u0456\u0439\u043A\u0456 \u0441\u0442\u0440\u0443\u043A\u0442\u0443\u0440\u0438 \u0434\u0430\u043D\u0438\u0445, \u044F\u043A\u0456 \u043F\u043E\u0432\u043D\u0456\u0441\u0442\u044E \u0443\u043D\u0438\u043A\u0430\u044E\u0442\u044C \u0432\u0438\u043A\u043E\u0440\u0438\u0441\u0442\u0430\u043D\u043D\u044F \u0437\u043C\u0456\u043D\u043D\u043E\u0433\u043E \u0441\u0442\u0430\u043D\u0443, \u0430\u043B\u0435 \u0447\u0430\u0441\u0442\u043E \u043C\u043E\u0436\u0443\u0442\u044C \u0434\u043E\u0441\u044F\u0433\u0442\u0438 \u043F\u0440\u0438\u0432\u0430\u0431\u043B\u0438\u0432\u0438\u0445 \u0430\u043C\u043E\u0440\u0442\u0438\u0437\u043E\u0432\u0430\u043D\u0438\u0445 \u043C\u0435\u0436 \u0443\u0441\u043A\u043B\u0430\u0434\u043D\u0435\u043D\u043E\u0441\u0442\u0456 \u0447\u0430\u0441\u0443. \u0423 \u0442\u043E\u0439 \u0447\u0430\u0441 \u044F\u043A \u043F\u0435\u0440\u0441\u0438\u0441\u0442\u0435\u043D\u0446\u0456\u044F \u043C\u043E\u0436\u0435 \u0431\u0443\u0442\u0438 \u0434\u043E\u0441\u044F\u0433\u043D\u0443\u0442\u0430 \u0448\u043B\u044F\u0445\u043E\u043C \u043F\u0440\u043E\u0441\u0442\u043E\u0433\u043E \u043A\u043E\u043F\u0456\u044E\u0432\u0430\u043D\u043D\u044F, \u0446\u0435 \u043D\u0435\u0435\u0444\u0435\u043A\u0442\u0438\u0432\u043D\u043E \u0434\u043B\u044F \u0432\u0438\u043A\u043E\u0440\u0438\u0441\u0442\u0430\u043D\u043D\u044F \u043F\u0440\u043E\u0446\u0435\u0441\u043E\u0440\u0430 \u0442\u0430 \u043E\u043F\u0435\u0440\u0430\u0442\u0438\u0432\u043D\u043E\u0457 \u043F\u0430\u043C'\u044F\u0442\u0456, \u043E\u0441\u043A\u0456\u043B\u044C\u043A\u0438 \u0431\u0456\u043B\u044C\u0448\u0456\u0441\u0442\u044C \u043E\u043F\u0435\u0440\u0430\u0446\u0456\u0439 \u0440\u043E\u0431\u043B\u044F\u0442\u044C \u043B\u0438\u0448\u0435 \u043D\u0435\u0432\u0435\u043B\u0438\u043A\u0456 \u0437\u043C\u0456\u043D\u0438 \u0443 \u0441\u0442\u0440\u0443\u043A\u0442\u0443\u0440\u0456 \u0434\u0430\u043D\u0438\u0445. \u041A\u0440\u0430\u0449\u0438\u043C \u043C\u0435\u0442\u043E\u0434\u043E\u043C \u0454 \u0432\u0438\u043A\u043E\u0440\u0438\u0441\u0442\u0430\u043D\u043D\u044F \u0441\u0445\u043E\u0436\u043E\u0441\u0442\u0456 \u043C\u0456\u0436 \u043D\u043E\u0432\u0438\u043C\u0438 \u0442\u0430 \u0441\u0442\u0430\u0440\u0438\u043C\u0438 \u0432\u0435\u0440\u0441\u0456\u044F\u043C\u0438 \u0434\u043B\u044F \u0441\u043F\u0456\u043B\u044C\u043D\u043E\u0433\u043E \u0432\u0438\u043A\u043E\u0440\u0438\u0441\u0442\u0430\u043D\u043D\u044F \u0441\u0442\u0440\u0443\u043A\u0442\u0443\u0440\u0438 \u043C\u0456\u0436 \u043D\u0438\u043C\u0438, \u043D\u0430\u043F\u0440\u0438\u043A\u043B\u0430\u0434, \u0432\u0438\u043A\u043E\u0440\u0438\u0441\u0442\u0430\u043D\u043D\u044F \u0442\u043E\u0433\u043E \u0441\u0430\u043C\u043E\u0433\u043E \u043F\u0456\u0434\u0434\u0435\u0440\u0435\u0432\u0430 \u0443 \u0440\u044F\u0434\u0456 \u0441\u0442\u0440\u0443\u043A\u0442\u0443\u0440\u0438 \u0434\u0435\u0440\u0435\u0432\u0430 s. \u041E\u0434\u043D\u0430\u043A, \u043E\u0441\u043A\u0456\u043B\u044C\u043A\u0438 \u0448\u0432\u0438\u0434\u043A\u043E \u0441\u0442\u0430\u0454 \u043D\u0435\u0437\u0434\u0456\u0439\u0441\u043D\u0435\u043D\u043D\u0438\u043C \u0432\u0438\u0437\u043D\u0430\u0447\u0438\u0442\u0438, \u0441\u043A\u0456\u043B\u044C\u043A\u0438 \u043F\u043E\u043F\u0435\u0440\u0435\u0434\u043D\u0456\u0445 \u0432\u0435\u0440\u0441\u0456\u0439 \u043F\u043E\u0434\u0456\u043B\u044F\u044E\u0442\u044C \u0442\u0456 \u0447\u0430\u0441\u0442\u0438\u043D\u0438 \u0441\u0442\u0440\u0443\u043A\u0442\u0443\u0440\u0438, \u0456 \u0442\u043E\u043C\u0443, \u0449\u043E \u0447\u0430\u0441\u0442\u043E \u0431\u0430\u0436\u0430\u043D\u043E \u0432\u0456\u0434\u043A\u0438\u043D\u0443\u0442\u0438 \u0441\u0442\u0430\u0440\u0456 \u0432\u0435\u0440\u0441\u0456\u0457, \u0446\u0435 \u0432\u0438\u043C\u0430\u0433\u0430\u0454 \u0441\u0435\u0440\u0435\u0434\u043E\u0432\u0438\u0449\u0430 \u0437 garbage collection. \u041F\u0440\u043E\u0442\u0435 \u043D\u0435 \"\u0442\u0430\u043A\" \u043D\u0435\u0437\u0434\u0456\u0439\u0441\u043D\u0435\u043D\u043D\u043E, \u0449\u043E \u0441\u043A\u043B\u0430\u0434\u043D\u0438\u0439 \u043F\u0440\u043E\u0435\u043A\u0442, \u043D\u0430\u043F\u0440\u0438\u043A\u043B\u0430\u0434 \u0444\u0430\u0439\u043B\u043E\u0432\u0430 \u0441\u0438\u0441\u0442\u0435\u043C\u0430 ZFS copy-on-write, \u043D\u0435 \u043C\u043E\u0436\u0435 \u0446\u0435 \u0434\u043E\u0441\u044F\u0433\u0442\u0438 \u0448\u043B\u044F\u0445\u043E\u043C \u043F\u0440\u044F\u043C\u043E\u0433\u043E \u0432\u0456\u0434\u0441\u0442\u0435\u0436\u0435\u043D\u043D\u044F \u0440\u043E\u0437\u043F\u043E\u0434\u0456\u043B\u0443 \u043F\u0430\u043C'\u044F\u0442\u0456."@uk . . "In computing, a persistent data structure or not ephemeral data structure is a data structure that always preserves the previous version of itself when it is modified. Such data structures are effectively immutable, as their operations do not (visibly) update the structure in-place, but instead always yield a new updated structure. The term was introduced in Driscoll, Sarnak, Sleator, and Tarjans' 1986 article. These types of data structures are particularly common in logical and functional programming, as languages in those paradigms discourage (or fully forbid) the use of mutable data."@en . . . "In ambito informatico, una struttura dati persistente \u00E8 una struttura dati che quando viene modificata conserva sempre la versione precedente di se stessa: tali strutture dati sono di fatto immutabili in quanto le operazioni fatte su di esse non aggiornano in modo visibile la struttura in essere portando invece alla creazione di una nuova struttura aggiornata. Una struttura dati persistente non \u00E8 da intendersi come una struttura dati memorizzata su una memoria persistente (permanente) come pu\u00F2 essere un disco rigido: si tratta di un diverso significato del termine persistente. Una struttura dati \u00E8 parzialmente persistente se tutte le versioni possono essere accedute ma solo l'ultima pu\u00F2 essere modificata. Una struttura dati \u00E8 completamente persistente se tutte le versioni possono essere accedute e modificate. Se \u00E8 anche possibile l'operazione di fusione che crea una nuova versione a partire da due versioni precedenti, la struttura dati viene chiamata confluentemente persistente. Le strutture dati che non sono invece persistenti vengono dette effimere. Questi tipi di struttura sono particolarmente comuni in programmazione logica e in programmazione funzionale: in programmi puramente funzionali tutti i dati sono immutabili cos\u00EC da rendere le strutture dati completamente persistenti. Le strutture dati persistenti possono anche essere create aggiornando sul posto i dati e questi possono, in genere, richiedere meno tempo e spazio di memoria di massa dei loro corrispettivi puramente funzionali. Anche se la persistenza pu\u00F2 essere effettuata con la semplice copia, questa si rivela poco efficiente in termini di tempo e di spazio dato che molte operazioni producono solo piccoli cambiamenti in una struttura dati. Un metodo migliore consiste nello sfruttare le similarit\u00E0 tra le versioni vecchia e nuova in modo da condividere le parti comuni, quali ad esempio l'utilizzo dello stesso sotto-albero nelle strutture ad albero. Comunque, poich\u00E9 spesso diventa non fattibile determinare quante versioni precedenti condividono le stesse parti della struttura e poich\u00E9 spesso si vogliono scartare le vecchie versioni, si rende necessario un ambiente dotato del meccanismo di garbage collection. La struttura persistente forse pi\u00F9 semplice \u00E8 la lista concatenata, una semplice lista di oggetti in cui ciascuno di essi ha un riferimento che punta a quello successivo nella lista. \u00C8 persistente in quanto se ne pu\u00F2 prendere la coda (costituita da un certo numero di voci) e aggiungere un nuovo nodo: la coda sar\u00E0 cos\u00EC condivisa tra la vecchia e la nuova lista. Fintantoch\u00E9 le voci della coda resteranno immutabili, la condivisione sar\u00E0 invisibile al programma. Molte strutture dati basate sui puntamenti, come ad esempio gli RB-Albero e le code, possono essere facilmente adattate per creare strutture dati persistenti."@it . . . . . . . . . . . . . "Persist\u00EAncia de dados"@pt . . . . . . . . . . . . . . . . . . . . "40862"^^ . . "\u0423 \u043A\u043E\u043C\u043F'\u044E\u0442\u0435\u0440\u043D\u0438\u0445 \u0441\u0438\u0441\u0442\u0435\u043C\u0430\u0445 \u0441\u0442\u0456\u0439\u043A\u0430 \u0441\u0442\u0440\u0443\u043A\u0442\u0443\u0440\u0430 \u0434\u0430\u043D\u0438\u0445 \u044F\u0432\u043B\u044F\u0454 \u0441\u043E\u0431\u043E\u044E \u0441\u0442\u0440\u0443\u043A\u0442\u0443\u0440\u0443 \u0434\u0430\u043D\u0438\u0445, \u044F\u043A\u0430 \u0437\u0430\u0432\u0436\u0434\u0438 \u0437\u0431\u0435\u0440\u0456\u0433\u0430\u0454 \u043F\u043E\u043F\u0435\u0440\u0435\u0434\u043D\u044E \u0432\u0435\u0440\u0441\u0456\u044E \u0441\u0430\u043C\u0430, \u043A\u043E\u043B\u0438 \u0457\u0457 \u0437\u043C\u0456\u043D\u044E\u044E\u0442\u044C. \u0422\u0430\u043A\u0456 \u0441\u0442\u0440\u0443\u043A\u0442\u0443\u0440\u0438 \u0434\u0430\u043D\u0438\u0445 \u0454 \u0444\u0430\u043A\u0442\u0438\u0447\u043D\u043E \u043D\u0435\u0437\u043C\u0456\u043D\u043D\u0438\u043C\u0438, \u043E\u0441\u043A\u0456\u043B\u044C\u043A\u0438 \u0457\u0445\u043D\u0456 \u043E\u043F\u0435\u0440\u0430\u0446\u0456\u0457 \u043D\u0435 \u043E\u043D\u043E\u0432\u043B\u044E\u044E\u0442\u044C \u0441\u0442\u0440\u0443\u043A\u0442\u0443\u0440\u0443 \u043D\u0430 \u043C\u0456\u0441\u0446\u0456, \u0430\u043B\u0435 \u0437\u0430\u043C\u0456\u0441\u0442\u044C \u0446\u044C\u043E\u0433\u043E \u0437\u0430\u0432\u0436\u0434\u0438 \u0434\u0430\u044E\u0442\u044C \u043D\u043E\u0432\u0443 \u043E\u043D\u043E\u0432\u043B\u0435\u043D\u0443 \u0441\u0442\u0440\u0443\u043A\u0442\u0443\u0440\u0443."@uk . . . . "1099531971"^^ . "\u6C38\u7D9A\u30C7\u30FC\u30BF\u69CB\u9020\uFF08\u3048\u3044\u305E\u304F\u30C7\u30FC\u30BF\u3053\u3046\u305E\u3046\u3001\u82F1: Persistent data structure\uFF09\u306F\u3001\u5909\u66F4\u3055\u308C\u308B\u969B\u306B\u5909\u66F4\u524D\u306E\u30D0\u30FC\u30B8\u30E7\u30F3\u3092\u5E38\u306B\u4FDD\u6301\u3059\u308B\u30C7\u30FC\u30BF\u69CB\u9020\u3067\u3042\u308B\u3002\u3053\u306E\u3088\u3046\u306A\u30C7\u30FC\u30BF\u69CB\u9020\u306F\u3001\u66F4\u65B0\u306E\u969B\u306B\u5143\u306E\u30C7\u30FC\u30BF\u69CB\u9020\u3092\u66F8\u304D\u63DB\u3048\u308B\u306E\u3067\u306F\u306A\u304F\u3001\u65B0\u305F\u306A\u30C7\u30FC\u30BF\u69CB\u9020\u3092\u751F\u6210\u3059\u308B\u3068\u8003\u3048\u3089\u308C\u3001\u30A4\u30DF\u30E5\u30FC\u30BF\u30D6\u30EB\u306A\u30C7\u30FC\u30BF\u69CB\u9020\u306E\u69CB\u7BC9\u306B\u5229\u7528\u53EF\u80FD\u3067\u3042\u308B\u3002"@ja . . . . . . . . . . . . . . "Trwa\u0142a struktura danych"@pl . . . "Trwa\u0142a struktura danych albo czysto funkcyjna struktura danych \u2013 struktura danych, kt\u00F3ra zawsze zachowuje swoje poprzednie wersje, kiedy s\u0105 modyfikowane. Takie struktury danych s\u0105 w efekcie niezmienne, jako \u017Ce operacje na nich nie powoduj\u0105 zmiany samej struktury, lecz powoduj\u0105 powstanie nowej, uaktualnionej jej wersji. Trwa\u0142a struktura danych nie jest struktur\u0105 danych sk\u0142adowan\u0105 na trwa\u0142ym no\u015Bniku danych, takim jak dysk; jest to inne i niepowi\u0105zane znaczenie s\u0142owa \"trwa\u0142y\"."@pl . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . "Persistent data structure"@en . . . . . . . .