← Back to Patent Explorer
US5787452A Expired / Lapsed US ⏱️ 0.0 years remaining

Client/server database system with methods for multi-threaded data processing in a heterogeneous language environment

Assignee: Sybase Inc
•
Filing: 1996-05-21
•
Granted: 1998-07-28
•
Expires: 2016-05-21
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A system providing improved National Language Support (NLS) in application programs is described. The system employs normalized Unicode data with generic transformation structures having locale overlays. Methods are described for navigating the structures during system operation, for effecting various transformation processes using locale-specific information. The locale-specific information is maintained in the structures as external data files. Since the data files are read in at runtime, the underlying binary files which comprise the program need not be modified for updating the program to support a new locale. The approach provides extensibility to applications with National Language Support. Additionally, increased portability is provided, since manipulation of the underlying data remains unchanged regardless of the underlying platform. Program maintenance is also decreased, since engineers need only maintain a single core.

Inventors

  • 👤 Michael G. McKenna

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-03 07:06
CPC Classifications
G; G06; G06F; G06F9/00; G06F9/06; G06F9/44; G06F9/451; G06F9/454

Claims Analysis

Total Claims: 11
Claim 1
Independent Claim 227 words
In a computer system, a method for transforming textual information based on locale-specific information, the method comprising: providing a transformation structure comprising a plurality of arrays storing locale-specific information for a particular type of character transformation; receiving input requesting that the character transformation be performed on an input character, said input character comprising at least one byte value; mapping said input character into a Unicode character using a Unicode mapping table, said Unicode character comprising a plurality of byte values; and transforming said Unicode character into a final transformation value for said input character, by performing the substeps of: (i) using a most significant byte of said Unicode character to reference a particular entry of a particular one of said plurality of arrays, (ii) determining whether the entry being referenced stores said final transformation value or a reference to a another one of said plurality of arrays, (iii) if said entry stores said final transformation value, satisfying said request by returning said final transformation value stored at the entry being referenced and thereafter terminating the method, (iv) if said entry stores a reference to another one of said plurality of arrays, using a next most significant byte of said Unicode character to reference a particular entry of said another one of said plurality of arrays, and (v) repeating substeps (ii)-(iv) until said final transformation value is located.
Claim 2
Dependent Claim 227 words
In a computer system, a method for transforming textual information based on locale-specific information, the method comprising: providing a transformation structure comprising a plurality of arrays storing locale-specific information for a particular type of character transformation; receiving input requesting that the character transformation be performed on an input character, said input character comprising at least one byte value; mapping said input character into a Unicode character using a Unicode mapping table, said Unicode character comprising a plurality of byte values; and transforming said Unicode character into a final transformation value for said input character, by performing the substeps of: (i) using a most significant byte of said Unicode character to reference a particular entry of a particular one of said plurality of arrays, (ii) determining whether the entry being referenced stores said final transformation value or a reference to a another one of said plurality of arrays, (iii) if said entry stores said final transformation value, satisfying said request by returning said final transformation value stored at the entry being referenced and thereafter terminating the method, (iv) if said entry stores a reference to another one of said plurality of arrays, using a next most significant byte of said Unicode character to reference a particular entry of said another one of said plurality of arrays, and (v) repeating substeps (ii)-(iv) until said final transformation value is located.
Claim 3
Dependent Claim 13 words
The method of claim 1, wherein said Unicode character comprises a 16-bit character.
Claim 4
Dependent Claim 14 words
The method of claim 1, wherein said character transformation comprises a case mapping operation.
Claim 5
Dependent Claim 15 words
The method of claim 1, wherein said character transformation comprises a lexical attribute determination operation.
Claim 6
Dependent Claim 14 words
The method of claim 1, wherein said character transformation comprises a code set conversion.
Claim 7
Dependent Claim 16 words
The method of claim 1, wherein said character transformation comprises an operation for determining character metrics.
Claim 8
Dependent Claim 36 words
The method of claim 1, further comprising: returning a default transformation value as said final transformation value in the event that the method be unable to locate said final transformation value within said plurality of arrays.
Claim 9
Dependent Claim 26 words
The method of claim 1, further comprising: returning a default transformation value as said final transformation value in the event that said input character is invalid.
Claim 10
Dependent Claim 47 words
The method of claim 1, further comprising: providing a conversion heap for storing an entry having a final transformation value which is too large to be stored in said plurality of arrays, wherein at least one entry includes a reference to said entry of said conversion heap.
Claim 11
Dependent Claim 22 words
The method of claim 1, further comprising: providing a callback function for computing a final transformation value based on said input character.

References Cited (Backward Citations)

US5307265A Cited
US5157606A Cited
US5231581A Cited
US5418718A Cited
US5499335A Cited
US5649214A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2001-07-27 2002-01-26 2002-07-28 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2005-07-27 2006-01-26 2006-07-28 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2009-07-27 2010-01-26 2010-07-28 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag