1. A rare earth oxide superconductor comprising:
a metal substrate;
an intermediate layer formed on the surface of the metal substrate by sequentially disposing:
a first intermediate cerium-based oxide layer consisting essentially of cerium and one or more solid solution formation elements, selected from the group consisting of Y, Nd, Sm, Gd, Eu, Yb, Ho, Tm, Dy, La and Er, which are capable of forming a solid solution with cerium, and
a second intermediate cerium-based oxide layer, different from the first intermediate cerium-based oxide layer and consisting essentially of cerium and one or more charge compensation elements, selected from the group consisting of Bi, Nb, Sb, Ta and V, which are capable of compensating for a charge mismatch attributable to a difference between the electron valences of respective ions of cerium and the solid solution formation element, wherein the total of the solid solution formation element and the charge compensation element in the intermediate layers is 5 to 60 mol % in terms of the metal content; and
a rare earth oxide superconductive layer formed on the intermediate layer and having a critical temperature (Tc) of 85-88\xb0 K.
2. The rare earth oxide superconductor according to claim 1, wherein the metal substrate is a biaxially aligned metal substrate.
3. The rare earth oxide according to claim 1 wherein the solid solution formation element is Gd and the charge compensation element is Nb.
4. A method for producing a rare earth oxide superconductor comprising the steps of:
applying a mixed solution, on the surface of a metal substrate, consisting essentially of an organometallic acid salt of cerium and an organometallic acid salt of one or more solid solution formation elements, selected from the group consisting of Y, Nd, Sm, Gd, Eu, Yb, Ho, Tm, Dy, La and Er, which are capable of forming a solid solution with cerium, and then preliminarily calcining the same to form a first cerium-based oxide intermediate layer;
applying a mixed solution, on the first cerium-based oxide intermediate layer, consisting essentially of an organometallic acid salt of cerium and an organometallic acid salt of one or more of a charge compensation element, selected from the group consisting of Bi, Nb, Sb, Ta and V, which are capable of compensating for a charge mismatch attributable to a difference between the electron valences of respective ions of cerium and the solid solution formation element, to form a second cerium-based oxide intermediate layer, wherein the total of the solid solution formation element and the charge compensation element in the intermediate layers is 5 to 60 mol % in terms of the metal content, followed by a heat treatment in a reducing atmosphere under a pressure ranging from 0.1 Pa to below atmospheric pressure and a temperature in a range from 900 to 1200\xb0 C. to form a cerium-based oxide intermediate layer including the first and second cerium-based oxide intermediate layers; and then
forming by an MOD method a rare earth oxide superconductive layer on the intermediate layer.
5. The method for producing a rare earth oxide superconductor according to claim 4, wherein the cerium-based oxide intermediate layer is formed by calcination in a reducing atmosphere under a pressure in a range from 10 to 500 Pa and a temperature ranging from 950 to 1150\xb0 C.
6. The method for producing a rare earth oxide superconductor according to claim 4 wherein the solid solution formation element is Gd and the charge compensation element is Nb.
The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.
1. A method of transforming a logical data object for storage in a storage device in a distributed network, comprising:
creating in the storage device a transformed logical data object comprising a header and a plurality of storage sections with a predefined size;
obtaining a plurality of data chunks corresponding to the transformed logical data object;
determining if the plurality of obtained data chunks exceed a predetermined threshold based on one of a time to compress each obtained data chunk and an amount of available storage space in a particular storage section that is dependent upon whether the particular storage section includes sufficient storage space to store a next uncompressed data chunk queued for storage;
compressing each obtained data chunk if the predetermined threshold based on time is not exceeded and not compressing each obtained data chunk if the predetermined threshold based on time is exceeded;
compressing each obtained data chunk if the predetermined threshold based on the amount of available storage space is exceeded and not compressing each obtained data chunk if the predetermined threshold based on the amount of available storage space is not exceeded, wherein compressing comprises:
compressing each obtained data chunk, and
accumulating the compressed data chunks to form compressed blocks, the compressed data chunks accumulated until a size of a compressed block includes the predefined size;
storing each compressed block into said storage sections; and
mapping between the data in the logical data object and the data stored in the storage sections.
2. The method of claim 1, wherein said compressing further comprises applying one of an encryption technique, an encoding technique, a conversion technique, and a combination thereof to each obtained data chunk when the predetermined threshold is not exceeded.
3. The method of claim 2, wherein:
the compressed obtained data chunk comprises a first portion of compressed data and a second portion of uncompressed data if the predetermined threshold is exceeded in relation to part of techniques of data compression; and
said first portion is provided by techniques related to the predetermined threshold.
4. The method of claim 1, wherein the predetermined threshold is related to at least one characteristic selected from a group comprising characteristics of the logical data object, characteristics of each obtained data chunk, characteristics of each storage section, characteristics of a transforming operation, and a combination thereof.
5. The method of claim 1, wherein the header of the compressed logical data object comprises a unique descriptor of the transformed logical data object, information related to a size of the compressed logical data object, and an indication if the compressed logical data object holds data in an uncompressed form.
6. The method of claim 1, wherein:
the compressed data chunks are stored in a log form; and
a log of a particular obtained data chunk comprises a log header containing information in respect of an offset of the particular obtained data chunk within the compressed logical data object, a size of said particular obtained data chunk, an identifier allowing associating the log with the storage section storing the log, and an indication of compresseduncompressed form of data held in the log.
7. The method of claim 1, wherein the mapping is provided with a help of at least one index section constituting a part of the compressed logical data object, said index section comprising at least one entry holding at least information related to compressed obtained data chunks stored in at least one storage section, an indication of compresseduncompressed form of data held in said obtained data chunks, and indication of physical storage location pertaining to said storage section.
8. A distributed network for transforming a logical data object, comprising:
a storage device;
a processor coupled to the storage device, the processor configured for:
creating in the storage device a transformed logical data object comprising a header and a plurality of storage sections with a predefined size,
obtaining a plurality of data chunks corresponding to the transformed logical data object,
determining if the plurality of obtained data chunks exceed a predetermined threshold based on one of a time to compress each obtained data chunk and an amount of available storage space in a particular storage section that is dependent upon whether the particular storage section includes sufficient storage space to store a next uncompressed data chunk queued for storage,
compressing each obtained data chunk if the predetermined threshold based on time is not exceeded and not compressing each obtained data chunk if the predetermined threshold based on time is exceeded,
compressing each obtained data chunk if the predetermined threshold based on the amount of available storage space is exceeded and not compressing each obtained data chunk if the predetermined threshold based on the amount of available storage space is not exceeded, wherein compressing comprises:
compressing each obtained data chunk, and
accumulating the compressed data chunks to form compressed blocks, the compressed data chunks accumulated until a size of a compressed block includes the predefined size;
storing each compressed block into said storage sections; and
mapping between the data in the logical data object and the data stored in the storage sections.
9. The distributed network of claim 8, wherein, when the predetermined threshold is not exceeded, the processor is configured for applying one of an encryption technique, an encoding technique, a conversion technique, and a combination thereof to each obtained data chunk.
10. The distributed network of claim 9, wherein:
the compressed obtained data chunk comprises a first portion of compressed data and a second portion of uncompressed data when the predetermined threshold is exceeded in relation to part of techniques of data compression, and
said first portion is provided by techniques related to the predetermined threshold.
11. The distributed network of claim 8, wherein the predetermined threshold is related to at least one characteristic selected from a group comprising characteristics of the logical data object, characteristics of each obtained data chunk, characteristics of each storage section, characteristics of a transforming operation, and a combination thereof.
12. The distributed network of claim 8, wherein the header of the compressed logical data object comprises a unique descriptor of the transformed logical data object, information related to a size of the compressed logical data object, and an indication if the compressed logical data object holds data in an uncompressed form.
13. The distributed network of claim 8, wherein:
the compressed data chunks are stored in a log form; and
a log of a particular obtained data chunk comprises a log header containing information in respect of an offset of the particular obtained data chunk within the compressed logical data object, a size of said particular obtained data chunk, an identifier allowing associating the log with the storage section storing the log, and an indication of compresseduncompressed form of data held in the log.
14. The distributed network of claim 8, wherein, when mapping, the processor is configured for utilizing at least one index section constituting a part of the compressed logical data object, said index section comprising at least one entry holding at least information related to compressed obtained data chunks stored in at least one storage section, an indication of compressed form or uncompressed form of data held in said obtained data chunks, and indication of physical storage location pertaining to said storage section.
15. A computer program product comprising a computer-readable memory having computer readable program code embodied therein for transforming a logical data object for storage in a storage device in a distributed network, said computer program product comprising:
computer code for creating in the storage device a transformed logical data object comprising a header and a plurality of storage sections with a predefined size;
computer code for obtaining a plurality of data chunks corresponding to the transformed logical data object;
computer code for determining if the plurality of obtained data chunks exceed a predetermined threshold based on one of a time to compress each obtained data chunk and an amount of available storage space in a particular storage section that is dependent upon whether the particular storage section includes sufficient storage space to store a next uncompressed data chunk queued for storage;
computer code for compressing each obtained data chunk if the predetermined threshold based on time is not exceeded and not compressing each obtained data chunk if the predetermined threshold based on time is exceeded;
computer code for compressing each obtained data chunk if the predetermined threshold based on the amount of available storage space is exceeded and not compressing each obtained data chunk if the predetermined threshold based on the amount of available storage space is not exceeded, wherein compressing comprises:
computer code for compressing each obtained data chunk, and
computer code for accumulating the compressed data chunks to form compressed blocks, the compressed data chunks accumulated until a size of a compressed block includes the predefined size;
computer code for storing each compressed block into said storage sections; and
computer code for mapping between the data in the logical data object and the data stored in the storage sections.
16. The computer program product of claim 15, further comprising computer code for applying one of an encryption technique, an encoding technique, a conversion technique, and a combination thereof to each obtained data chunk when the predetermined threshold is not exceeded, wherein:
the compressed obtained data chunk comprises a first portion of compressed data and a second portion of uncompressed data when the predetermined threshold is exceeded in relation to part of techniques of data compression, and
said first portion is provided by techniques related to the predetermined threshold.
17. The computer program product of claim 15, wherein the predetermined threshold is related to at least one characteristic selected from a group comprising characteristics of the logical data object, characteristics of each obtained data chunk, characteristics of each storage section, characteristics of a transforming operation, and a combination thereof.
18. The computer program product of claim 15, wherein the header of the compressed logical data object comprises a unique descriptor of the transformed logical data object, information related to a size of the compressed logical data object, and an indication if the compressed logical data object holds data in an uncompressed form.
19. The computer program product of claim 15, wherein:
the compressed data chunks are stored in a log form; and
a log of a particular obtained data chunk comprises a log header containing information in respect of an offset of the particular obtained data chunk within the compressed logical data object, a size of said particular obtained data chunk, an identifier allowing associating the log with the storage section storing the log, and an indication of compresseduncompressed form of data held in the log.
20. The computer program product of claim 15, further comprising:
computer code for utilizing at least one index section constituting a part of the compressed logical data object, said index section comprising at least one entry holding at least information related to compressed obtained data chunks stored in at least one storage section, an indication of compressed form or uncompressed form of data held in said obtained data chunks, and indication of physical storage location pertaining to said storage section.