Serialization (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Serialization" in English language version.

refsWebsite
Global rank English rank
2,232nd place
1,903rd place
1st place
1st place
383rd place
320th place
low place
low place
2nd place
2nd place
11th place
8th place
207th place
136th place
5th place
5th place
2,224th place
1,900th place
4,194th place
3,676th place
low place
low place
low place
low place
low place
low place
low place
low place
214th place
176th place
low place
low place
low place
low place
low place
low place
low place
7,198th place
1,514th place
1,024th place
1,686th place
1,293rd place
low place
low place
low place
low place
low place
low place
low place
low place
4,643rd place
2,973rd place
low place
low place
low place
low place
low place
low place
low place
low place
low place
low place
low place
low place
2,481st place
1,558th place
69th place
59th place
1,669th place
1,290th place
low place
low place

arxiv.org (Global: 69th place; English: 59th place)

aumcode.github.io (Global: low place; English: low place)

boost.org (Global: low place; English: low place)

brown.edu (Global: 2,481st place; English: 1,558th place)

cs.brown.edu

doi.org (Global: 2nd place; English: 2nd place)

dti.ne.jp (Global: low place; English: low place)

mars.dti.ne.jp

  • "What's new". SIXX - Smalltalk Instance eXchange in XML. 23 January 2010. Retrieved 25 July 2021.

erights.org (Global: low place; English: low place)

  • S. Miller, Mark. "Safe Serialization Under Mutual Suspicion". ERights.org. Serialization, explained below, is an example of a tool for use by objects within an object system for operating on the graph they are embedded in. This seems to require violating the encapsulation provided by the pure object model.

ethz.ch (Global: 2,224th place; English: 1,900th place)

stat.ethz.ch

geekswithblogs.net (Global: low place; English: low place)

  • ".NET Serializers". There are many kinds of serializers; they produce very compact data very fast. There are serializers for messaging, for data stores, for marshaling objects. What is the best serializer in .NET?

github.com (Global: 383rd place; English: 320th place)

go.dev (Global: low place; English: low place)

pkg.go.dev

gprolog.org (Global: low place; English: low place)

haskell.org (Global: low place; English: 7,198th place)

hackage.haskell.org

ietf.org (Global: 214th place; English: 176th place)

tools.ietf.org

json.org (Global: low place; English: low place)

  • "JSON". www.json.org. Retrieved 22 March 2018.

julialang.org (Global: low place; English: low place)

docs.julialang.org

mozilla.org (Global: 1,686th place; English: 1,293rd place)

developer.mozilla.org

  • "JSON". MDN Web Docs. Retrieved 22 March 2018.

ocaml.org (Global: low place; English: low place)

oracle.com (Global: 1,514th place; English: 1,024th place)

asktom.oracle.com

parashift.com (Global: low place; English: low place)

  • Cline, Marshall. "C++ FAQ: "What's This "Serialization" Thing All About?"". Archived from the original on 2015-04-05. It lets you take an object or group of objects, put them on a disk or send them through a wire or wireless transport mechanism, then later, perhaps on another computer, reverse the process, resurrecting the original object(s). The basic mechanisms are to flatten object(s) into a one-dimensional stream of bits, and to turn that stream of bits back into the original object(s).

php.net (Global: 4,194th place; English: 3,676th place)

ca.php.net

php.net

psu.edu (Global: 207th place; English: 136th place)

citeseerx.ist.psu.edu

  • Herlihy, Maurice; Liskov, Barbara (October 1982). "A Value Transmission Method for Abstract Data Types" (PDF). ACM Transactions on Programming Languages and Systems. 4 (4): 527–551. CiteSeerX 10.1.1.87.5301. doi:10.1145/69622.357182. ISSN 0164-0925. OCLC 67989840. S2CID 8126961.
  • Birrell, Andrew; Jones, Mike; Wobber, Ted (November 1987). "A simple and efficient implementation of a small database". Proceedings of the eleventh ACM Symposium on Operating systems principles - SOSP '87. Vol. 11. pp. 149–154. CiteSeerX 10.1.1.100.1457. doi:10.1145/41457.37517. ISBN 089791242X. ISSN 0163-5980. OCLC 476062921. S2CID 12908261. Our implementation makes use of a mechanism called "pickles", which will convert between any strongly typed data structure and a representation of that structure suitable for storing in permanent disk files. The operation Pickle.Write takes a pointer to a strongly typed data structure and delivers buffers of bits for writing to the disk. Conversely Pickle.Read reads buffers of bits from the disk and delivers a copy of the original data structure.(*) This conversion involves identifying the occurrences of addresses in the structure, and arranging that when the structure is read back from disk the addresses are replaced with addresses valid in the current execution environment. The pickle mechanism is entirely automatic: it is driven by the run-time typing structures that are present for our garbage collection mechanism. ... (*) Pickling is quite similar to the concept of marshalling in remote procedure calls. But in fact our pickling implementation works only by interpreting at run-time the structure of dynamically typed values, while our RPC implementation works only by generating code for the marshalling of statically typed values. Each facility would benefit from adding the mechanisms of the other, but that has not yet been done.

python.org (Global: 2,232nd place; English: 1,903rd place)

docs.python.org

legacy.python.org

  • van Rossum, Guido (1 December 1994). "Flattening Python Objects". Python Programming Language – Legacy Website. Delaware, United States: Python Software Foundation. Retrieved 6 April 2017. Origin of the name 'flattening': Because I want to leave the original 'marshal' module alone, and Jim complained that 'serialization' also means something totally different that's actually relevant in the context of concurrent access to persistent objects, I'll use the term 'flattening' from now on. ... (The Modula-3 system uses the term 'pickled' data for this concept. They have probably solved all problems already, and in a type-safe manner :-)

ruby-lang.org (Global: low place; English: low place)

docs.ruby-lang.org

s11n.net (Global: low place; English: low place)

semanticscholar.org (Global: 11th place; English: 8th place)

api.semanticscholar.org

sics.se (Global: low place; English: low place)

sicstus.sics.se

sourceforge.net (Global: 1,669th place; English: 1,290th place)

minnestore.sourceforge.net

stackoverflow.com (Global: 4,643rd place; English: 2,973rd place)

suspekt.org (Global: low place; English: low place)

swi-prolog.org (Global: low place; English: low place)

tc39.github.io (Global: low place; English: low place)

timelessrepo.com (Global: low place; English: low place)

uscilab.github.io (Global: low place; English: low place)

web.archive.org (Global: 1st place; English: 1st place)

worldcat.org (Global: 5th place; English: 5th place)

search.worldcat.org

  • Herlihy, Maurice; Liskov, Barbara (October 1982). "A Value Transmission Method for Abstract Data Types" (PDF). ACM Transactions on Programming Languages and Systems. 4 (4): 527–551. CiteSeerX 10.1.1.87.5301. doi:10.1145/69622.357182. ISSN 0164-0925. OCLC 67989840. S2CID 8126961.
  • Birrell, Andrew; Jones, Mike; Wobber, Ted (November 1987). "A simple and efficient implementation of a small database". Proceedings of the eleventh ACM Symposium on Operating systems principles - SOSP '87. Vol. 11. pp. 149–154. CiteSeerX 10.1.1.100.1457. doi:10.1145/41457.37517. ISBN 089791242X. ISSN 0163-5980. OCLC 476062921. S2CID 12908261. Our implementation makes use of a mechanism called "pickles", which will convert between any strongly typed data structure and a representation of that structure suitable for storing in permanent disk files. The operation Pickle.Write takes a pointer to a strongly typed data structure and delivers buffers of bits for writing to the disk. Conversely Pickle.Read reads buffers of bits from the disk and delivers a copy of the original data structure.(*) This conversion involves identifying the occurrences of addresses in the structure, and arranging that when the structure is read back from disk the addresses are replaced with addresses valid in the current execution environment. The pickle mechanism is entirely automatic: it is driven by the run-time typing structures that are present for our garbage collection mechanism. ... (*) Pickling is quite similar to the concept of marshalling in remote procedure calls. But in fact our pickling implementation works only by interpreting at run-time the structure of dynamically typed values, while our RPC implementation works only by generating code for the marshalling of statically typed values. Each facility would benefit from adding the mechanisms of the other, but that has not yet been done.