Mapping system with house number representation

• US 6,035,299 A
• Filed: 08/26/1997
• Issued: 03/07/2000
• Est. Priority Date: 08/26/1997
• Status: Expired due to Term

• Current Assignee: Alpine Electronics Incorporated (Alps Alpine Co., Ltd.)
• Original Assignee: Alpine Electronics Incorporated (Alps Alpine Co., Ltd.)
• Inventors: Schaaf, David T., White, Kerry M.
• Primary Examiner(s): Black, Thomas G.
• Assistant Examiner(s): Coby, Frantz
• Application Number:
  US08/920,119
• Time in Patent Office: 924 Days
• Field of Search: 707/1, 707/101, 707/102, 707/100
• US Class Current: 1/1
• CPC Class Codes: G01C 21/387 Organisation of map data, e.g. version management or database structures
• CPC Class Codes: G06F 16/00 Information retrieval; Database structures therefor; File system structures therefor
• CPC Class Codes: Y10S 707/99942 Manipulating data structure, e.g. compression, compaction, compilation
• CPC Class Codes: Y10S 707/99943 Generating database or data structure, e.g. via user interface

Abstract

A four-byte data structure for representing alphanumeric or numeric house numbers (addresses) for use in a mapping system. The data structure has the same field size as that used for representing house numbers with numeric characters. One bit of the data structure is used to determine the presence of a non-numeric character in the house number. If the bit stream defined by bit positions 30-28 is either "000" or "100" or 101" or "110" or "111", then fourteen bits represent the numeric portion preceding the alphabetic character, ten bits represent the numeric portion succeeding the alphabetic character, two bits represent leading zeroes preceding any alphabetic and numeric characters and two bits represent leading zeroes disposed after an alphabetic character and before a numeric character succeeding the alphabetic character. If the bit stream defined by bit positions 30-28 is "001", then one bit identifies whether the first character of a house number is numeric or non-numeric, thirteen bits identify the alphabetic character used in a house number, ten bits represent house numbers larger than 999 or represent characters other than the alphabetic characters, ten bits represent the numeric portion of a house number and two bits represent leading zeroes.

Claims

1. In a mapping system, an exactly four-byte binary data structure encoded on a computer-readable medium for storing and representing substantially all house numbers, wherein each byte is 8 binary digits, wherein each said house number is either a string of numeric characters or a string of characters having numeric, alphabetic and special printable characters, wherein each said house number has up to 14 numeric or alphanumeric characters.

2. In a mapping system, an exactly four-byte binary data structure encoded on a computer-readable medium for storing and representing substantially all house numbers, wherein each byte is 8 binary digits, wherein each said house number is either a string of numeric characters or a string of characters having numeric, alphabetic and special printable characters, and wherein at least one bit in the data structure indicates the presence of non-numeric characters in said house number.

3. A data structure according to claim 2, wherein at least three bits in the data structure identify the non-numeric character used in said house number.

4. A data structure according to claim 2, wherein said non-numeric characters belong to a set comprising all the alphabetic characters and the character "-", wherein "-" is a hyphen.

5. A data structure according to claim 2, wherein at least five bits in the data structure identify the alphabetic character in said house number.

6. A data structure according to claim 2, wherein at least ten bits in the data structure identify the alphabetic or numeric characters in said house number.

7. A data structure according to claim 2, wherein at least ten bits in the data structure identify only numeric characters in said house number.

8. A data structure according to claim 2, wherein a binary `1` at bit position 31 of said data structure indicates the presence of a non-numeric character in said house number and wherein a binary `0` at bit position 31 of said data structure indicates the absence of a non-numeric character in said house number.

9. A data structure according to claim 8, wherein a bit stream "000" in bit positions 30-28 of said data structure, respectively, indicates the presence of a character hyphen "-" in said house number, wherein a bit stream "100" in bit positions 30-28 of said data structure, respectively, indicates the presence of a character "E" in said house number, wherein a bit stream "101" in bit positions 30-28 of said data structure, respectively, indicates the presence of a character "N" in said house number, wherein a bit stream "110" in bit positions 30-28 of said data structure, respectively, indicates the presence of a character "S" in said house number, wherein a bit stream "111" in bit positions 30-28 of said data structure, respectively, indicates the presence of a character "W" in said house number and wherein a bit stream "001" in bit positions 30-28 of said data structure, respectively, indicates that said house number includes either an alphabetic character succeeded by numeric characters or an alphabetic character preceded by numeric characters.

10. A data structure according to claim 9, wherein a bit stream "00" in bit positions 3-2 of said data structure, respectively, indicates the absence of leading zeroes, wherein a bit stream "01" in bit positions 3-2 of said data structure, respectively, indicates the presence of one leading zero, wherein a bit stream "10" in bit positions 3-2 of said data structure, respectively, indicates the presence of two leading zeroes, wherein a bit stream "11" in bit positions 3-2 of said data structure, respectively, indicates the presence of three leading zeroes, when said leading zeroes are defined to include only those zeroes which may appear before any numeric character preceding any said alphabetic character in said house number, bit positions 3-2 of said data structure to indicate the absence or the presence and the number of said leading zeroes only when bit positions 30-28 are either "000" or "100" or "101" or "110" or "111".

11. A data structure according to claim 10, wherein a bit stream "00" in bit positions 1-0 of said data structure, respectively, indicates the absence of any leading zeroes, wherein a bit stream "01" in bit positions 1-0 of said data structure, respectively, indicates the presence of one leading zero, wherein a bit stream "10" in bit positions 1-0 of said data structure, respectively, indicates the presence of two leading zeroes, wherein a bit stream "11" in bit positions 1-0 of said data structure, respectively, indicates the presence of three leading zeroes, when said leading zeroes are defined to include only those zeroes which may appear after said alphabetic character and before a numeric character succeeding said alphabetic character of said house number.

12. A data structure according to claim 11, wherein bit positions 27-14 of said data structure represent numeric characters appearing after any of said leading zeroes defined by bits 3-2 and before any alphabetic character.

13. A data structure according to claim 12, wherein bit positions 13-4 represent numeric characters appearing after any of said leading zeroes defined by bits 1-0.

14. A method of sorting the hierarchy of a collection of numeric or alphanumeric numbers with a data structure as defined in claim 12, said method comprising a one step application of relational operators to said numbers to arrange the numbers in an ascending or a descending hierarchical order based on the relative magnitude of said numbers.

15. A data structure according to claim 9, wherein a bit stream "0011" in bit positions 30-27 indicates that said house number begins with an alphabetic character succeeded by one or more numeric characters and wherein a bit stream "0010" in bit positions 30-27 indicates that said house number begins with a string of numeric character succeeded by an alphabetic character.

16. A data structure according to claim 15, wherein a bit stream "00001" in bit positions 26-22 indicates the presence of character "A" in said house number, wherein a bit stream "00010" in bit positions 26-22 indicates the presence of character "B" in said house number, wherein a bit stream "00011" in bit positions 26-22 indicates the presence of character "C" in said house number, wherein a bit stream "00100" in bit positions 26-22 indicates the presence of character "D" in said house number, wherein a bit stream "00101" in bit positions 26-22 indicates the presence of character "E" in said house number, wherein a bit stream "00110" in bit positions 26-22 indicates the presence of character "F" in said house number, wherein a bit stream "00111" in bit positions 26-22 indicates the presence of character "G" in said house number, wherein a bit stream "01000" in bit positions 26-22 indicates the presence of character "H" in said house number, wherein a bit stream "01001" in bit positions 26-22 indicates the presence of character "I" in said house number, wherein a bit stream "01010" in bit positions 26-22 indicates the presence of character "J" in said house number, wherein a bit stream "01011" in bit positions 26-22 indicates the presence of character "K" in said house number, wherein a bit stream "01100" in bit positions 26-22 indicates the presence of character "L" in said house number, wherein a bit stream "01101" in bit positions 26-22 indicates the presence of character "M" in said house number, wherein a bit stream "01110" in bit positions 26-22 indicates the presence of character "N" in said house number, wherein a bit stream "01111" in bit positions 26-22 indicates the presence of character "O" in said house number, wherein a bit stream "10000" in bit positions 26-22 indicates the presence of character "P" in said house number, wherein a bit stream "10001" in bit positions 26-22 indicates the presence of character "Q" in said house number, wherein a bit stream "10010" in bit positions 26-22 indicates the presence of character "R" in said house number, wherein a bit stream "10011" in bit positions 26-22 indicates the presence of character "S" in said house number, wherein a bit stream "10100" in bit positions 26-22 indicates the presence of character "T" in said house number, wherein a bit stream "10101" in bit positions 26-22 indicates the presence of character "U" in said house number, wherein a bit stream "10110" in bit positions 26-22 indicates the presence of character "V" in said house number, wherein a bit stream "10111" in bit positions 26-22 indicates the presence of character "W" in said house number, wherein a bit stream "11000" in bit positions 26-22 indicates the presence of character "X" in said house number, wherein a bit stream "11001" in bit positions 26-22 indicates the presence of character "Y" in said house number, wherein a bit stream "11010" in bit positions 26-22 indicates the presence of character "Z" in said house number.

17. A data structure according to claim 16, wherein bit positions 21-12 represent numbers larger than 999 and characters other than said alphabetic characters.

18. A data structure according to claim 17, wherein bit positions 11-2 represent numeric portions of said house number.

19. A data structure according to claim 18, wherein a bit stream "00" in bit positions 1-0 of said data structure, respectively, indicates the absence of any leading zeroes, wherein a bit stream "01" in bit positions 1-0 of said data structure, respectively, indicates the presence of one leading zero, wherein a bit stream "10" in bit positions 1-0 of said data structure, respectively, indicates the presence of two leading zeroes, wherein a bit stream "11" in bit positions 1-0 of said data structure, respectively, indicates the presence of three leading zeroes, when said leading zeroes are defined to include only those zeroes which may appear before a numeric character.

20. A method of sorting the hierarchy of a collection of numeric or alphanumeric numbers with a data structure as defined in claim 18, said method comprising a one step application of relational operators to said numbers to arrange the numbers in an ascending or a descending hierarchical order based on the relative magnitude of said numbers.

21. In a mapping system, an exactly four-byte binary data structure encoded on a computer-readable medium for storing and representing substantially all house numbers, wherein each byte is 8 binary digits, wherein each said house number is either a string of numeric characters or a string of characters having numeric, alphabetic and special printable characters, and wherein at least eight bits in the data structure identify the non-numeric character used in said house number.

22. In a mapping system, an exactly four-byte binary data structure encoded on a computer-readable medium for storing and representing substantially all house numbers, wherein each byte is 8 binary digits, wherein each said house number is either a string of numeric characters or a string of characters having numeric, alphabetic and special printable characters, and wherein at least two bits in the data structure indicate the number of leading zeroes, when said leading zeroes are defined to include only those zeroes which may appear after a non-numeric character and before a numeric character succeeding said non-numeric character of said house number.

23. In a mapping system, an exactly four-byte binary data structure encoded on a computer-readable medium for storing and representing substantially all house numbers, wherein each byte is 8 binary digits, wherein each said house number is either a string of numeric characters or a string of characters having numeric, alphabetic and special printable characters, and wherein at least two bits in the data structure indicate the number of leading zeroes if a bit stream "000" or "100" or "101" or "110" or "111" is present at bit positions 30-28, when said leading zeroes are defined to include only those zeroes which may appear before any numeric character p receding any non-numeric character in said house number.

24. A data structure according to claim 23, wherein at least 14 bits in the data structure represent numeric characters if a bit stream "000" or "100" or "101" or "110" or "111" is present at bit positions 30-28, wherein said numeric characters appear before a non-numeric character, said numeric characters not to include any said leading zeroes of said house number.

25. A data structure according to claim 24, wherein at least 10 bits in the data structure represent numeric characters if a bit stream "000" or "100" or "101" or "110" or "111" is present at bit positions 30-28, wherein said numeric characters appear after a non-numeric character, said numeric characters not to include any said leading zeroes of said house number.

26. In a mapping system, an exactly four-byte binary data structure encoded on a computer-readable medium for storing and representing substantially all house numbers, wherein each byte is 8 binary digits, wherein each said house number is either a string of numeric characters or a string of characters having numeric, alphabetic and special printable characters, and wherein at least one bit in the data structure identifies whether a numeric or an alphabetic character represents the first character of said house number.

27. A method of representing a house number in a mapping system including a data structure encoded on a computer-readable medium, comprising the steps of:

establishing a house number data structure;

assigning exactly four bytes having 32 bits to represent each house number, wherein said house number is all numeric characters or is numeric and special printable characters, and wherein at least one bit in the data structure indicates the presence of non-numeric characters in said house number.