Browse Prior Art Database

Order Preserving Encoding of Tuples of Strings into a Single String

IP.com Disclosure Number: IPCOM000089799D
Original Publication Date: 1977-Dec-01
Included in the Prior Art Database: 2005-Mar-05
Document File: 1 page(s) / 12K

Publishing Venue

IBM

Related People

Eswaran, K: AUTHOR

Abstract

A method for forming a single data string from multiple fixed or variable length strings is described. The resultant string preserves the order of the original fields in the original strings. The merged string is of such a nature that it can be parsed to yield the multiple originals. Advantageously, the CPU processing and storage yields a saving over the method for achieving the same result described in the IBM Technical Disclosure Bulletin 19, 3582 (February 1977).

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 67% of the total text.

Page 1 of 1

Order Preserving Encoding of Tuples of Strings into a Single String

A method for forming a single data string from multiple fixed or variable length strings is described. The resultant string preserves the order of the original fields in the original strings. The merged string is of such a nature that it can be parsed to yield the multiple originals. Advantageously, the CPU processing and storage yields a saving over the method for achieving the same result described in the IBM Technical Disclosure Bulletin 19, 3582 (February 1977).

The method uses two transformations. One of these transformations is involved when all zero bytes are present. However, because variable length character strings make up a large fraction of the strings to be combined and because all zero bytes rarely occur in such strings, it follows that the transformations need be rarely invoked. The prior art was invariant in its response to the presence and absence of all zero bytes. The advance in the art is a one step method that changes to two steps only in the presence of all zero bytes.

The method possesses two properties. First, it must map from a tuple of arbitrary strings to a single string such that it has a unique inverse, while, secondly, the ordering of the encoding strings should be the same as the ordering of the original tuples of strings.

Now given r, m as parameters, the two previously mentioned transformations can be defined on a string s. The first transformation consists of rep...