7739288

Systems and Methods of Directory Entry Encodings

PublishedJune 15, 2010
Assigneenot available in USPTO data we have
Technical Abstract

Patent Claims
20 claims

Legal claims defining the scope of protection, as filed with the USPTO.

1

1. A method for filename lookup which supports multiple character encodings, the method comprising: receiving, at a computer system, one or more requests to store one or more names into a data structure, each name represented by a byte value based on one of a plurality of character encodings; converting, by the computer system, each of the names of the one or more requests into a key; for each name of the one or more requests, storing, by the computer system, a data element indexed by the name's key into the data structure, the data element comprising the name's byte value, an identifier of the name's character encoding, and address data for locating file data associated with the name; receiving, at the computer system, a request to retrieve a data element associated with a requested name comprising a request byte value according to a request character encoding; converting, by the computer system, the requested name into a request key; and searching, by the computer system, the data structure for a data element related to the requested name using at least the request key.

2

2. The method of claim 1 , wherein the searching comprises: retrieving zero or more data elements indexed by the request key from the data structure; and if one or more data elements are retrieved, comparing the requested name to each of the retrieved data elements until at least one match is found or all retrieved data elements have been compared.

3

3. The method of claim 2 , wherein the comparing comprises, until at least one match is found or all retrieved data elements have been compared, for each of the retrieved data elements: if the data element has a different character encoding than the request character encoding, converting the byte value of the data element into a converted byte value according to the request character encoding and comparing at least a portion of the converted byte value to at least a portion of the request byte value; and if the data element has a same character encoding as the request character encoding, comparing at least a portion of the byte value of the data element to at least a portion of the request byte value.

4

4. The method of claim 2 , wherein the searching further comprises, if zero data elements are retrieved and the requested name comprises untranslatable characters, performing a brute force search of the data structure.

5

5. The method of claim 4 , wherein the brute force search comprises comparing the requested name to each of the data elements in the data structure until at least one match is found or all data elements in the data structure have been compared.

6

6. The method of claim 5 , wherein the comparing the requested name to each of the data elements in the data structure comprises, until at least one match is found or all data elements in the data structure have been compared, for each data element in the data structure: if the data element has a different character encoding than the request character encoding, converting the byte value of the data element into a converted byte value according to the request character encoding and comparing at least a portion of the converted byte value to at least a portion of the request byte value; and if the data element has a same character encoding as the request character encoding, comparing at least a portion of the byte value of the data element to at least a portion of the request byte value.

7

7. The method of claim 2 , wherein the at least one match is either an exact match or a best inexact match.

8

8. The method of claim 3 , wherein the comparing at least a portion of the converted byte value or the byte value of the data element to at least a portion of the request byte value skips portions of the converted byte value, byte value of the data element, or request byte value, which represent characters within a list of characters to be skipped.

9

9. The method of claim 5 , wherein the at least one match is either an exact match or a best inexact match.

10

10. The method of claim 1 , wherein the address data comprises an identifier of metadata associated with the name.

11

11. A system for filename lookup which supports multiple character encodings, the system comprising: a computer processor; a memory; a data structure stored on the memory; and at least one executable software module executed by the computer processor and configured to: receive one or more requests to store one or more names into the data structure, each name represented by a byte value based on one of a plurality of character encodings; convert each of the names of the one or more requests into a key; for each name of the one or more requests, store a data element indexed by the name's key into the data structure, the data element comprising the name's byte value, an identifier of the name's character encoding, and address data for locating file data associated with the name; receive a request to retrieve a data element associated with a requested name comprising a request byte value according to a request character encoding; convert the requested name into a request key; and search the data structure for a data element related to the requested name using at least the request key.

12

12. The system of claim 11 , wherein the at least one executable software module is further configured to search by: retrieving zero or more data elements indexed by the request key from the data structure; and if one or more data elements are retrieved, comparing the requested name to each of the retrieved data elements until at least one match is found or all retrieved data elements have been compared.

13

13. The system of claim 12 , wherein the at least one executable software module is configured to compare by, until at least one match is found or all retrieved data elements have been compared, for each of the retrieved data elements: if the data element has a different character encoding than the request character encoding, converting the byte value of the data element into a converted byte value according to the request character encoding and comparing at least a portion of the converted byte value to at least a portion of the request byte value; and if the data element has a same character encoding as the request character encoding, comparing at least a portion of the byte value of the data element to at least a portion of the request byte value.

14

14. The system of claim 12 , wherein the at least one executable software module is further configured to search by, if zero data elements are retrieved and the requested name comprises untranslatable characters, performing a brute force search of the data structure.

15

15. The system of claim 14 , wherein the at least one executable software module is configured to perform the brute force search by comparing the requested name to each of the data elements in the data structure until at least one match is found or all data elements in the data structure have been compared.

16

16. The system of claim 15 , wherein the at least one executable software module is configured to compare by, until at least one match is found or all data elements in the data structure have been compared, for each data element in the data structure: if the data element has a different character encoding than the request character encoding, converting the byte value of the data element into a converted byte value according to the request character encoding and comparing at least a portion of the converted byte value to at least a portion of the request byte value; and if the data element has a same character encoding as the request character encoding, comparing at least a portion of the byte value of the data element to at least a portion of the request byte value.

17

17. The system of claim 12 , wherein the at least one match is either an exact match or a best inexact match.

18

18. The system of claim 13 , wherein the at least one executable software module is configured to compare at least a portion of the converted byte value or the byte value of the data element to at least a portion of the request byte value by skipping portions of the converted byte value, byte value of the data element, or request byte value, which represent characters within a list of characters to be skipped.

19

19. The system of claim 15 , wherein the at least one match is either an exact match or a best inexact match.

20

20. The system of claim 11 , wherein the address data comprises an identifier of metadata associated with the name.

Patent Metadata

Filing Date

Unknown

Publication Date

June 15, 2010

Inventors

Eric M. Lemar
Nathan N. White

Want to explore more patents?

Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.

Citation & reuse

Analysis on this page is generated by Patentable — an AI-powered patent intelligence platform. AI-generated summaries, explanations, and analysis may be reused with attribution and a visible link back to the canonical URL below. Patent abstracts and claims are USPTO public domain.

Cite as: Patentable. “SYSTEMS AND METHODS OF DIRECTORY ENTRY ENCODINGS” (7739288). https://patentable.app/patents/7739288

© 2026 Patentable. All rights reserved.

Patentable is a research and drafting-assistant tool, not a law firm, and does not provide legal advice. Documents we generate are drafts for review by a licensed patent attorney.