111111
`
`1111111111111111111111111111111111111111111111111111111111111
`US008165909B2
`
`(12) United States Patent
`Dearing
`
`(10) Patent No.:
`(45) Date of Patent:
`
`US 8,165,909 B2
`Apr. 24, 2012
`
`(54) SYSTEM AND METHOD FOR AUTOMATED
`MANAGEMENT OF At"' ADDRESS DATABASE
`Inventor: Stephen M. Dearing, Cordova, TN (US)
`
`(75)
`
`(73) Assignee: T h e United States Postal Service,
`Washington, DC (US)
`
`( *) Notice:
`
`Subject to any disclaimer, the term of this
`patent is extended or adjusted under 35
`U.S.C. 154(b) by 487 days.
`
`(21) Appl. No.: 11/434,862
`
`(22) Filed:
`
`May 17,2006
`
`(65)
`
`t>rior Publication Data
`
`US 2007/0094155 Al
`
`Apr. 26, 2007
`
`Related U.S. Application Data
`
`(60)
`
`Provisional application No. 60/681 ,481 , filed on May
`17, 2005.
`
`(51)
`
`(52)
`(58)
`
`(56)
`
`Int. Cl.
`GfJ6QlOIOO
`(2012.01)
`G06F 17100
`(2006.01)
`G07B 17102
`(2006.01)
`B65B 35100
`(2006.01)
`G06Q 90100
`(2006.01)
`U.S. Cl. ....... .
`705/7.27: 705/404; 705/406: 705/500
`F ield of Classification Search ........................ None
`See application file for complete search history.
`
`References Cited
`
`U.S. PATENT DOCUMENTS
`5,072,400 A
`12/ 1991 Manduley
`5,079,714 A
`1/1992 Manduley et al.
`
`114
`
`5,204,966 A
`5.287,271 A •
`5.422,821 A
`5,452,203 A
`5,454,038 A
`5,49 1,752 A
`5,703,783 A
`5,734,568 A
`5.742,807 A
`5,754.671 A
`5.903,651 A
`5,925,864 A
`5.933,604 A
`5,953,427 A
`
`4/1993 Wittenberg er al.
`2/1994 Rosenbaum ...................... 705/8
`6/1995 Allen et al.
`9/1995 Moore
`9/ 1995 CordeJy et al.
`2/1996 Kaufinan et al.
`12/ 1997 Allen et al.
`3/ 1998 Borgendale et al.
`4/1998 Masinter
`5/1998
`l"liggins et al.
`5/1999 Kocher
`7/ 1999 Sansone et al.
`8/1999
`lnakoshi
`911999 Corde•y et al.
`(Continued)
`
`FOREIGN PATENT DOCUMENTS
`WO WO 2004/0237 J I A I
`3/2004
`OTHER PUBLJCKfJONS
`
`"PSI systems: easy and affordable direct mail solution for small
`businesses", PR newswire, Jun. 7, 1999.*
`
`(Continued)
`
`Primary Examiner - John Hayes
`Assistant Examiner - George Chen
`(74) Attorney, Agent, or Firm - Finnegan, Henderson,
`Farabow, Garrett & Dunner, LLP
`
`(57)
`
`ABSTRACT
`
`Embodiments of the invention provide a system and method
`for electronically managing an address database such as
`AMS. and more particularly a system and method for auto(cid:173)
`matically managing an address database through tbe use of a
`web-based application. Moreover. embodiments oft he inveu(cid:173)
`tion manage an address database, such as AMS, by comparing
`data in the address database with data collected from mail(cid:173)
`pieces during sorting operations.
`
`12 Claims, 8 Drawing Sheets
`
`!QQ
`
`Page 1
`
`RMI EXHIBIT 2045
`CBM2014-00116
`
`

`

`US 8,165,909 B2
`Page2
`
`U.S. PATENT DOCUMENTS
`10/ 1999 Tock
`5,966,542 A
`!211999 Boies et at.
`6,006,200 A
`I 012000 Mai tino et al.
`6,131,101 A
`6,175,827 Bl
`1/200 I Cordery et al.
`7/200 I Go:zzo et at ................... 382/ 10 I
`6.269,17 .1 B l "
`6,289,334 B l
`9/200 I Reiner et al.
`6,308,247 B l
`10/200 I Ackerman el al.
`121200 I Yura
`6.327,373 Bl
`212002 Attwood et al.
`6,347,376 Bl
`9/2002 Jatkowski .................... 707/ 101
`6,457,012 Bl"'
`2/2003 Odom et al.
`6,516,320 Bl
`6,598,748 B2"
`7/2003 Mileafet al. .................. 209/542
`512004 Bmce et al.
`6,74 1 ,724 B I
`612004 Chow et al.
`6,754,785 B2
`7/ 2004 Osentoski et at.
`6,763,344 Bl
`11/2004 Hungerpiller et at.
`6,826,548 B2
`6,954,729 B2
`10/2005 Lee et al.
`7,080,122 B2
`7/2006 Bilbrey et al.
`6/2007 Lingle et al.
`7,233,929 B l
`7,305,404 B2
`12/2007 Owens et al.
`2001/0044783 AI
`11/200 l Weisberg ct al.
`121200 I Lee et al. .... ...... ...... .... .. 705/406
`200!/0054031 AI"'
`3/2002 Lopez
`200210029202 AI
`4/2002 Moritsu et al.
`200210049670 AI
`200210 I 03932 A I
`8/2002 Bilbrey et al.
`2002/0147731 Al
`I 0/2002 Seestrom et al.
`200210 188690 A I
`12/2002 Lee
`2/2003 Collins ct al.
`2003/0028783 AI
`2003/0109954 AI
`6/2003 Daniels. Jr. et al.
`2003/0114955 AI
`6/2003 Daniels, Jr.
`2003/0 11 4956 AI
`6/2003 Cullen et al.
`2003/0 I 15060 A I
`6/2003 Junqua et al.
`2003/0 135567 AI
`7/2003 Reilly
`9/2003 Dutta
`2003/0 177021 AI
`9/2003 O'Donohue et al.
`2003/0182017 AI
`2003/0182018 AI
`9/2003 Snapp
`912003 Snapp et at.
`2003/0182568 AI
`2003/0 19 1651 AI
`10/2003 Hungerpilleretal.
`2004/0005080 A I
`l/2004 Hayduchok
`2004/00 I 54 53 A I
`l/2004 Youngblood et al.
`4/2004 Ross et at.
`2004/0065598 AI
`512004 Sipe et al.
`2004/0093222 AI
`6/2004 Wong et at.
`2004/011 1443 AI
`200410!28274 AI
`7/ 2004 Snapp et al.
`9/2004 Payne et at.
`2004/0 177305 A I
`2004/02 10763 A I
`l 0/2004 Jonas
`2004/0225543 AI
`11/2004 Kapochunas et al.
`3/2005 Jonas
`2005/0060556 AI
`3/2005 Jonas et at.
`2005/0066!82 AI
`4/2005 Cordery et at.
`2005/0075988 AI
`
`4/2005 Owens et al.
`2005/0086256 AI
`2005/0137991 AI
`6/2005 Bn•ce ct al.
`2005/0171922 AI
`8/2005 Leary et al.
`1/2008 Owens ct at.
`2008/0027980 AI
`Oil-IER PUBLICATIONS
`Carteret al., ''Exact and Approxi mate Membership Testers," ACM
`
`I 011' STOC, pp. 59-65, ( 1978).
`Bellare et al.; "Collision-Resistant Hashing: Towards Maki ng
`UOWH.fs Practical"; Proceedings of the Annual tnt'! Cryptology
`Conference (CRYPTO); Berlin, Springer, Germany; Vol. Conf. 17,
`pp. 470-484, ( 1997).
`International Search Report for PCTIUSOI/26125 mailed Mar. 26.
`2002.
`"TBM DB2 Anonymous Resolution Version 3.8 Technical Informa(cid:173)
`tion." Publication of IBM Corporation, USA. May 2005 (2 pages).
`Friedrich, Andrew, "IBM DB2 Anonymous Resolution: Knowledge
`Discovery Without Knowledge Disclosure," WhitepaperoriBM Cor(cid:173)
`poration. USA. May 2005 (23 pages).
`"DB2 Anonymous Resolution for Public Safety, Corrections. &
`Criminal Intelligence," Publication ofiBM Corporation, USA, Feb.
`2005 (2 pages).
`"DB2 Anonymous Resolution," Publication of IBM Corporation,
`USA, May 2005 (2 pages).
`Lohr, Steve, "I.B.M. Software Ai ms to Provide Seclll·ity Without
`Sacrific ing Privacy," The New York Times, May 24,2005 (2 pages).
`"Application of DB2 Anonymous Resolution to the Financial Ser(cid:173)
`vices Industry." Wh itepaper of IBM Co•poration. USA, May 2005
`( 17 pages).
`Written Opinion by the International Searching Authority for Inter(cid:173)
`national Application No. PCT/US/06/ 18937. dated Aug. 23. 2007 (10
`pages).
`PCT International Search RepoJt and Written Opinion in Interna(cid:173)
`tional Application No. PCT/US05/46558. dated Jan. 25. 2007 (8
`pages).
`Schafer, Hartmut, et al., "How Postal Address Readers Are Made
`Adaptive." Adaptive READ Research Project, LNCS 2956, Springer(cid:173)
`Verlag, Berlin, Germany. Apr. I, 2004, pp. 187-215.
`Rlthnke, Megan C., "The Address Listing Operation and its Impact on
`the Master Address File." Census 2000 £valuation F.2. Jan. 30. 2002.
`42 pages (cover. spacer, i-vi and 1-34.
`Zhang, Jianti ng, et al., ''A GMT-Based Open Archi tecture for Build(cid:173)
`ing a Geographic Search Engine Over the Internet," WISE 200 I ,
`Kyoto, Japan, Dec. 3-6, 2001, pp. 25-32.
`International Postal Address Componen ts and Templates, UPU Drall
`S42-4, Feb. 3, 2004, pp. i-vi and 1-1 58.
`* cited by examiner
`
`Page 2
`
`

`

`114
`
`112
`
`110
`
`Daily Density Data
`Table
`
`DSMART
`Meta Data
`Table
`
`Reverse 11
`Address Data
`Table
`
`DSMART
`Consolidated
`Database
`
`100
`
`108
`
`106
`
`104
`
`Delivery Service I-J-102
`
`Figure 1
`
`~
`~
`
`~
`rJ1 .
`"""" n> = """"
`> "0
`:"'
`N
`~.f;>.
`
`N c ......
`
`N
`
`('D
`('D
`
`rJ)
`::r
`.....
`......
`Q ....,
`00
`
`d
`(J)
`QO
`
`~
`
`~
`
`""""" 0\
`VI
`\C
`0
`\C
`o:;
`N
`
`Page 3
`
`

`

`~
`00
`•
`""d
`~
`f""'t"
`
`~ = f""'t"
`
`> "0
`:"
`N
`~~
`N
`
`0 ....
`
`N
`
`('D
`
`~ =(cid:173)
`('D ....
`N
`0 .....
`
`QO
`
`Cj
`en
`S¥J
`,_.
`Q\
`tJ1
`
`~ = \C cc
`
`N
`
`206
`
`218
`
`222(1)
`
`ZQQ
`
`20~ Uosorted MOl wi~ H
`
`11 D1g1t
`BarCode
`
`Plant A
`Sorting Mail
`
`List of 11 Digit
`Bar Codes with
`Density Data
`
`1 Carrier Sorted Mail
`214
`with 11 Digit ~
`'\.A.J
`Carrier Mail
`Bar Code
`
`f.--1- 210
`
`~
`
`~
`-
`I unsorted Mall with
`204
`11 Digit r.
`'-"'!
`
`Bar Code
`
`208
`
`•
`•
`•
`Plant D
`Sorting Mail
`
`220
`
`~
`list of 11 Digit
`1--.j Bar Codes with W
`Density Data
`
`216 1 Carrier Sorted Maa
`"V\J with 11 Digit ~
`Carner Mail
`BarCode
`
`•
`
`~212
`
`Mail Processing
`Plant Servers
`•
`•
`-
`_
`
`I
`
`I-+
`
`Mail Processing
`Plant Servers
`
`224
`
`~
`
`Pull of Data from
`All Plant Servers
`
`t_
`
`226
`Consolidate Data, ~
`Index
`
`226
`'-"J DPF Data Set 1--1
`
`I
`230
`'v\J ZtP+4 Data Set
`
`u
`
`~
`
`~-336
`N~~
`
`I -
`
`Consolidated
`Database
`~
`
`i
`Reports
`
`7)
`
`240
`
`•
`r---.1 Web Based
`Access
`)
`
`1
`
`242
`
`Area District
`Data Set
`
`1--
`
`- f
`
`------
`
`City State
`Data Set
`
`232
`'\.1'\
`
`..._
`
`I
`234
`"-'"'
`
`Figure 2A
`
`Page 4
`
`

`

`250
`
`252
`
`Reset Delivery Point Counts
`
`~
`rJ).
`•
`~
`~
`f""t'.
`
`~ = f""t'.
`
`Page 5
`
`

`

`270_;-..
`
`Read Density Data
`
`!
`272
`~
`Populate Daily Density Data I
`Table 114
`
`!
`274
`~
`I Populate DSMART Metadata I
`Table 112
`
`l
`276
`~
`I Populate Reverse 11
`
`Address Data Table 110
`
`I
`
`~
`~
`
`~
`rJ1 .
`"""" n> = """"
`> "0
`:"'
`N
`~.f;>.
`
`N c ......
`
`N
`
`('D
`('D
`
`rJ)
`::r
`.....
`Q ....,
`00
`
`.f;>.
`
`278~
`
`Combine Data To Fonn
`DSMART Consolidated
`Database
`
`Figure 2C
`
`d
`(J)
`QO
`
`~
`
`""""" 0\
`VI
`\.c
`0
`\C
`o:;
`N
`
`Page 6
`
`

`

`lf"302
`
`Process
`DSMART
`Daily Load
`
`3~2
`
`Add to DSMART
`No Meta Data Table
`and Process for
`Meta Data
`
`t
`
`I 3
`~
`
`11 Digit in
`DSMART?
`
`31
`16 Yes
`'\..A
`_.,
`
`Load DP Code.
`Count, Date into
`Daily Density
`Data Table
`
`31
`
`~ l
`
`Add Dei_Sys_ID, --. Add CRID_ID,
`
`F[Q[!) ZIP~
`
`Rec_ Type_ Code
`
`From DPF
`
`DPF_Cnt,
`NUREC_IND
`
`324
`
`"
`No
`""'
`
`326
`
`""'
`
`328
`
`""'
`From Citv State
`Add
`f-. CRID_SORT_
`IND
`
`FromZIP4
`Update
`DPFMISS_DATE ~ Add CRID_ID,
`
`with System Date
`Rec_ Type_Code
`
`Update Sum in
`Daily Density
`Data Table
`
`l
`
`0
`"-.A
`Consolidate
`Daily Density
`Data Table
`"-.A ~
`Consolidate
`DSMART
`Database
`
`338
`
`""'
`
`Generate Reverse 11
`Address
`
`340
`"-.A
`Consolidate
`Reverse 11
`Address Data
`Table
`
`34~
`
`Consolidate
`DSMART Meta
`Data Table
`
`I
`
`D~MART M!lta Data Uodate
`Update
`DIST_ID
`DEL_SYS_ID
`DPF_CNT
`DPFMISS_DATE
`REC_ TYPE_ CODE
`CRID_ID
`CRID_SORT _INO
`IZ4_FLAG
`HR_KEY
`HRDEF_IND
`
`From Ci!J: State
`Add
`f-+ CRID_SORT_
`IND
`
`E£Qm Area Dil!t
`f.-. Add DIST_lD
`
`33~
`
`33~ ~l
`
`f-.+
`
`From Area
`District
`Add DIST_ID
`
`1----.
`
`From Modified
`Z4 Process Add
`HR Key,
`HRDEF_IND
`
`334
`
`No
`
`Is
`9 Digit in
`IZ4?
`
`33~ Yes
`
`~
`
`Set IZ4_Fiag
`
`hi- 346
`
`Fi g
`
`~
`~
`
`~
`rJ1 .
`"""" n> = """"
`> "0
`:"'
`N
`~.f;;.
`
`N c ......
`
`N
`
`('D
`('D
`
`rJ)
`::r
`.....
`t.ll
`Q ....,
`00
`
`d
`(J)
`QO
`~
`joo-1.
`0\
`VI
`\.c
`0
`\C
`o:;
`N
`
`Page 7
`
`

`

`US. Patent
`
`Apr. 24, 2012
`
`Sheet 6 of 8
`
`US 8,165,909 82
`
`
`
`$233cozmuom33:8385
`
`“can.$3.3no:5E“.33
`
`28%
`
`wow
`
`$2.
`
`
`
`£5;86582
`
`EonEgan.
`
`$2.93528mm
`
`353222
`
`“22%
`
`8203.m_new
`
`52:9“.
`
`
`
`Bass£23mEoEmmmcmE
`
`emup396258:02.38
`
`30.63.«5oh8qu
`
`
`
`A5295EoEmmmcmE
`
`
`
`5:586683323423.
`
`
`
`322$a...93mmE8Egan.
`
`2%
`
`New
`
`Page 8
`
`Page 8
`
`
`
`

`

`422
`
`424
`
`Collect Delivery Sortation Data
`
`Store Density Data For Multiple
`Delivery Point Records
`
`426
`
`Select First Or Next Delivery Point 1+-------.
`Record
`
`N
`
`~
`~
`
`~
`rJ1 .
`"""" n> = """"
`> "0
`:"'
`N
`~.f;>.
`
`N c ......
`
`N
`
`('D
`('D
`
`rJ)
`::r
`.....
`Q ....,
`00
`
`-.)
`
`y
`
`Figure 48
`
`432
`
`Add Address Associated With Delivery Point Record
`To Address Management System (And/Or Output
`Notice Of Address To Be Added To The Address
`Management System)
`
`d
`(J)
`QO
`
`~
`
`""""" 0\
`VI
`\.c
`0
`\C
`o:;
`N
`
`Page 9
`
`

`

`442
`
`444
`
`Collect Delivery Sortation Data
`
`Store Density Data For Multiple
`Delivery Point Records
`
`446
`
`Select First Or Next Delivery Point 1+------..
`Record
`
`Figure 4C
`
`452
`
`Delete Address Associated With Delivery Point Record
`From Address Management System (And/Or Output Notice
`Of Address To Be Deleted From The Address Management
`System)
`
`~
`~
`
`~
`rJ1 .
`"""" n> = """"
`> "0
`:"'
`N
`~.f;>.
`
`N c ......
`
`N
`
`('D
`('D
`
`rJ)
`::r
`.....
`00
`Q ....,
`00
`
`d
`(J)
`QO
`
`~
`
`""""" 0\
`VI
`\.c
`0
`\C
`o:;
`N
`
`Page 10
`
`

`

`1
`SYST EW ANO M ETIIOO FOR AUTOMATED
`MANAGEMENT OF AN ADDRESS DATABASE
`
`us 8, 165,909 8 2
`
`2
`macllinc-rcadable codes. 1l1c service provider may tl1en usc
`the barcode to sort the mail i11 del ivery sequence order. As a
`result, a delivery employee can efficiently prepare the mail for
`delivery, and the time needed lor delivery preparation is
`reduced.
`Witl1out a machine-readable code. such as a DPBC or
`4-state barcode. a mailpiece ca1mot be sorted in delivery
`sequence order by an automated machine. Thus. a mailpiece
`without a machine-readable code must be manually handled
`10 and processed by a delivery service employee or processed
`tlm>ugh additional syslems prior to delivery. Manual opera(cid:173)
`lion is problematic because it is a labor intensive endeavor.
`Inefficiencies resulting from manual handling of the mail can
`be very costly and time consuming, thus diminishing cus-
`15 tomer satisfaction. Indeed, delays in the delivery of for(cid:173)
`warded mail to new addresses is the fifth most conunon
`complaint from USPS customers.
`lt is possible, however. that even with a machine-readable
`Currently, delivery service providers such as the United
`code, such as a DPBC or 4-statc barcode, attached to a mail-
`States Postal Servicc'1M ("USPS"1 M) deliver items, such as
`mail (or mailpicccs). to recipients based upon an address. The 20 piece. manual labor may be nc<..xlcd to deliver the mail piece.
`address may contain identifying information such as a name,
`For example. manual labor may be needed to sort a mailpiece
`street. city. state. and postal code, such as a ZIP CodeTM. The
`where the machine-readable code attached to the mail piece
`ZIP Code may represent a geographic location and have five
`does not correspond to an established delivery point. Address
`digits. In addition, a postal code may also be represented as a
`problems in which machine-readable codes do not resemble
`nine-digit ZIP+41 ' 1 Code, which identifies the particulargco- 25 an established delivery point may arise for various reasons.
`graphic segment location i11 greater detail. Generally, a Z1P+4
`For example. an address problem may be associated with the
`Code is a code that supplements the standard five digit ZIP
`incorrect entry of addresses into a database, such as the
`Code with an additional four digits. A nine-digit ZIP+4 Code
`Address Management System {"AMS").
`may identify a residentia l block, a fim1, or a floor of a high-
`AMS is designed to contain a list of all known delivery
`rise building. The additional lour digits of a Z1P+4 Code 30 add resses serviceable by a delivery service, such as USPS.
`allows for more efficient sorting and delivery of mail items
`This database is created by postal carriers and AMS special-
`tluough the mail delivery process. In addition. high-volume
`isis who possess the Delivery Force Knowledge™ (local
`customers using USPS may receive discounts for providing a
`delivery infonnalion). and who arc thus in a bc11er position
`ZIP+4 Code on a mail item. For these reasons. it may be
`tl1an other personnel to rccognj7.e inaccuracies in any
`desirable to code all addresses with a ZIP+4 Code. where 35 uncoded addresses. Many postal products and processes
`depend on the AMS database to provide accurate addresses.
`possible.
`more efficient sorting and automation plans, and faster sec-
`Normally, those using an address list, such as mailers. can
`process an address list using a reference database product that
`vice to the postal patron.
`first standardizes the address and then assigns tl1c correct
`Despite using numerous preventative measures to ensure
`ZTP+4 Code to the physical address. Tllis reference product is 40 that the AMS database is accurate and consistently up-to-
`commonly referred to as a "ZlP+4 engine," an example of
`date, a mailpiece is sometimes addressed to a location that is
`which is the Address Management Systems ("AMS") Appli-
`not contained in AMS. As suggested above, errors may occur
`lor various reasons. I' or example. an address may be incor-
`cation Program Interface (API), commercially available from
`thc USPS. ·n1e ZIP+4 engine accepts street addresses with
`rectly entered into AMS, or an entire address or part thereof
`city and state information and attempts to match it against a 45 may be omined. resulting in an invalid delivery point. In
`master database such as an AMS database, to be described
`addition. inaccuracies in AMS may occur because new
`below. Such a database may contain all known deliverable
`addresses have not been added to tl1c database. New addresses
`addresses \\<itl1in a geographical area. ZIP+4 engines typi-
`may arise daily from activities such as new building construc-
`cally use a database containing information regarding ranges
`tion and subdivision of an existing structure. Similarly. an
`of addresses for a given block in a given city with a five-digit so AMS inaccuracy may arise when an address located at a
`ZIP Code.
`delivery point becomes obsolete. Delivery points. and the
`Delivery service providers may usc postal codes. such as
`addresses they identifY, may become obsolete for many rca(cid:173)
`sons. For example, a delivc1y point may become obsolete due
`ZIP+4 Codes, ru1d address information to create machine(cid:173)
`readable codes, such as Delivery Point Barcodes (DPBC's),
`to a stmcture being torn down, destroyed by fire, abandoned,
`which uniquely identify each address. DPBC's may identify ss
`etc.
`a delivery point. which may be defined as the mailing address
`AMS inaccuracies may cause numerous problems. Most
`of a postal patron where delivery personnel deliver mail, and
`notably, an inaccuracy in the AMS may result in the usc of
`may include a mailbox located on a curb, a door slot, a box on
`manual labor in the mail delivery process, the problems of
`a house. a centralized group or mail boxes. or the location of
`which were described above.
`a receptionist. DPBC's may consist of eleven digits. of which 60
`five digits are allocated to tl1c ZIP Code, 4 digits are allocated
`to the ZIP+4 Code, and tl1e last two digits are allocated to a
`delivery point. Through the usc or automated mail processing
`equipment. delivery service providers, such as USPS. may
`apply a machine-readable code, such as an eleven-digit 65
`DPBC, to mail items carrying a 7.1 P+4 Code. Otbcr barcode
`formats, such as a 4-statc barcode, may also be used as
`
`In an effort to overcome one or more of the problems
`described above, embodliuents or the invention provide a
`system and method for electrooically managing an address
`database s uch as AMS, and more p~1rticu larly a system and
`method for automatically managing an address database
`
`PRJOR.ITY
`
`5
`
`1l1is application claims the benefit of U.S. Provisional
`Application No. 60/68 1,481. f1lcd on May 17.2005.
`
`TECHNICAL FTELD
`
`The invention relates generally to a system and method for
`electronically managing an address database, and more par(cid:173)
`ticularly to a system and method for managing an address
`database through the usc of a web-based application.
`
`BACKGROUND
`
`SUMMi\RY
`
`Page 11
`
`

`

`US 8,165,909 B2
`
`3
`through the use of a web-based application. Moreover,
`embodiments of the invention manage an address database,
`such as AMS. by comparing data in the address database with
`data collected from mail pieces during sorting operations. For
`example, the comparison may indicate that there are delivery 5
`points that receive mai l but are non-existent in AMS. that
`there are delivery points maintained in theAMS database that
`no longer receive mail. or that mail pieces are being addressed
`to a high-rise building with incomplete or wrong secondary
`ir1formation, such as incorrect suite numbers or apartment 10
`uumbers. When these anomalies are identified. embodiments
`of the invention notifY delivery personuel. Embodiments of
`the invention also provide web-based access to the system and
`the reports.
`Such a system is desirable because it is conducive to 15
`quickly resolving errors in the AMS database. Reducing tbe
`number of days between discovery of auAMS database prob(cid:173)
`lem and resolution of that problem may reduce the number of
`days that manual handling of mail is implemented, thereby
`reducing cost and saving time in the preparatiou of mail. 20
`Corrections to the database may also allow a delivery service,
`such as USPS, to maintain more accurate delivery data. Accu(cid:173)
`rate delivery data may reduce costs associated with delivery
`and may provide improved service to both major mailers and
`individual postal patrons.
`Disclosed is a system and method of electronically and
`automatically managing an address database. More specifi(cid:173)
`cally, an embodiment of the invention provides a met bod for
`managing an address database including: reading mailpiece
`sortiug data for a predetermined time interval, the mailpiecc 30
`sorting data including delivery point information; storing
`density data associated with the mailpiece data, the density
`data including a number of mail pieces addressed to each of
`multiple delivery points during the predetennined time inter(cid:173)
`val; and updating the address database based on the stored 35
`density data.
`Another embodiment of the invention provides a proces(cid:173)
`sor-readable medium having stored thereon processor-ex(cid:173)
`ecutable code, the processor-executable code configured to
`perform a method. the method including: reading mailpiece 40
`sorting data for a predetermined time interval, the mailpiece
`sorting data including delivery point information; storing
`density data associated with the mailpiece data, tbe density
`data including a munber of mail pieces addressed to each of
`multiple delivery points during the predetermined time inter- 45
`val; and updating the address database based on the stored
`density data.
`It is to be understood that both the foregoing general
`description and the following detailed description are exem(cid:173)
`plary and explanatory only and are not restrictive of the inven- 50
`tion. as claimed.
`
`BRJ EF DESCRIPTION OF TH E DRAWJNGS
`
`The accompanying drawings. which are incorporated in
`and constitute a part of this specification, and illustrate
`embodiments of the invention.
`FIG. 1 is a block diagram of au electronic and automated
`database management system, according to an embodiment
`of the invention.
`FJG. 2A is a block diagram of a fu nctional architecture of
`an electronic and automated database management system,
`according to an embodiment of the invention.
`FIG. 28 is a flow diagram of a data collection process,
`according to an embodiment of the invention.
`FJG. 2C is a flow diagr<~m of a data storage process accord(cid:173)
`ing to an embodiment of the invention.
`
`4
`FJG. 3 is a flow diagram of a method for electronic and
`automated database management according to an embodi(cid:173)
`ment of the invention.
`FIG. 4A is a flow diagram of a data reconciliation process
`according to ruJ embodiment of the invention.
`FIG. 48 is a flow diagram of a data reconciliation process
`according to an embodiment of the invention.
`FIG. 4C is a flow diagram of a data reconciliation process
`according to an embodiment of the invention.
`
`DETAI LED DESCRIPTION
`
`System Overview
`FIG. 1 is a block diagram of an electronic database man(cid:173)
`agemeut system l 00 according to an embodiment of the
`invention. In one embodiment, electronic database manage(cid:173)
`ment system 100 may allow a delivery service 102, such as
`USPS. to electronically monitor the results of automated
`queries conducted against a consolidated database, such as a
`Delivery Sortation Managemeut Automatt:d Research Tool
`(DSMART) database 108, on a web-based system such as a
`website executing on a system server 106. DSMART data(cid:173)
`base .108 is a consolidated database that may consist of
`munerousdata tables, such as a Daily Density Data Table 114,
`25 a DSMART Metadata Table 112, and a Reverse 11 Address
`Data Table 110. By monitoring the results of automated que(cid:173)
`ries conducted against a consolidated database, such as a
`DSMART database 108, delivery service 102may learu when
`to make changes to the Address Management System
`("AMS") database.
`"Web-based" means that the system is accessible to users
`over the Internet using the World Wide Web. That is, content
`is made available, in a protocol such as HTML fonuat, using
`web server software executing on a server computer coupled
`to the Internet. Multiple users, each using a client program
`(such as a "web browser" for HTML protocol) on a process-
`ing device such as a personal computer, thereby gain access to
`the content and :fimctionality provided by the server. The
`web-based system may execute on system server 106 sup(cid:173)
`plied by Sun Microsystems of Santa Clara. Calif. that oper(cid:173)
`ates on a UNIX-based operating system.
`Programs executing on server 106 may be written using
`progranuuing languages such as Cold Fusion and JavaScript.
`Cold Fusion is a server side application conunonly used for
`creating dynamic web pages using data from a variety of
`sources. It offers au open architecture and built-in search and
`charting capabilities. Various databases and tables used by
`system 100 may include Oracle database products. The data(cid:173)
`bases and tables used by system 100 may include DSM.L\RT
`database 108. Reverse 11 Address Table 110. DSMART
`Metadata Table 112, and Daily Density Data Table 114.
`Variations to the system illustrated in FIG. l are possible.
`For example, the DSMART consolidated database 108 may
`include or access a fewer or greater number of data tables than
`55 iJiustrated. Moreover, a density table having a time period
`other than daily may be used i.n the altemative or in combi(cid:173)
`nation with daily density table 114. In additiou, an alternative
`embodiment may use au e-mail and/or voicemail server (not
`shown) in the alternate or in combination with the web server
`60 106.
`Creating a Delivery Sortat'ion Database
`FIG. 2A is a block diagram of a functional architecture of
`an electronic and automated database management system
`200 according to an embodiment of the invention. System 200
`65 may include numerous postal mail stops. of which mail stops
`202 and 204 are examples. A mail stop is a physical queue. All
`unsorted rnailpieces with machine-readable codes, such as
`
`Page 12
`
`

`

`US 8,165,909 B2
`
`10
`
`5
`eleven-digit delivery point barcodes (DPBC's), may be
`deposited at mail stops 202 and 204. Each DPBC may
`uniquely identify the address and physical location to which
`the mailpiece is addressed. Moreover, the DPBCs may be
`used by delivery services, such as USPS, to sort mail pieces in
`delivery sequence order.
`111e use of an eleven-digit DPBC as a machine-readable
`code, however, is only exemplary and does not limit the scope
`of the invention. A delivery service, such as USPS, may t1se
`other barcode formats as machine-readable codes to sort
`mail pieces in delivery sequence order. For example, a deliv(cid:173)
`ery service may use a 4-state barcode as a machine-readable
`code to sort mailpieces.
`Postal Plants A 206 and D 208 are two examples of delivery 15
`service facilities that may sort mail pieces with machine-read(cid:173)
`able codes such as DPBCs. The mail pieces that are sorted in
`delivery sequence order may then be combined with addi(cid:173)
`tioual Carrier Mail 210 and 212. Any additional carrier mail
`may have beeu manually sorted based on Delivery Force 20
`Knowledge or processed through additional systems for
`delivery. Plant-sorted mail and manually-sorted mail are
`combined into Carrier Sorted Mail214aud 216 for delivery to
`postal patrons.
`tn one embodiment consistent with the invention, Plant 25
`206 and Plaut 208 in system 200 may scan all barcode(cid:173)
`addressed mailpieces, such as DPBC-addressed mail, as the
`mailpieces are sorted in delivery sequence order. Such scruJ(cid:173)
`ning may be accomplished using Optical Character Recogni(cid:173)
`tion (OCR) and/or barcode reading techuologies. Further- 30
`more, as Plants 206 and 208 sort and scan the barcode
`addressed mailpieces, the Plants may collect and record vari(cid:173)
`ous data about each mailpiece. For example, Plant 206 may
`generate a list 218 containing the DPBC for each mailpiece
`scanned during the day at Plant 206, the number of mail pieces 35
`scanned for delivery to each DPBC during that day (herein(cid:173)
`after "density data"), and a site ID identifying the postal
`faci lity which collected and recorded the infonuat ion. Simi(cid:173)
`larly, Plant 208 may generate a list 220 similar to list 218.
`Thus, any Postal Plaut that processes and scans mail in deliv- 40
`ery sequence order may collect and record various data from
`the scanned mailpieces and may further generate a list or
`other record report.ing tbe collected data.
`'D1e collection of data relating to an eleven-digit DPBC,
`however, is only exemplary and does not limit the scope of the 45
`invention. For example, where mail pieces have a 4-state bar(cid:173)
`code rather than an eleven-digit DPBC, Postal Plants may
`also generate a list 218 containing the4-state barcode for each
`mail piece scanned during the day at Plaut206, the number of
`mail pieces scanned for delivery to each 4-state barcode dur- 50
`ing that day (the density of mail), and a site lD that identifies
`which postal plant collected and recorded the infom1ation.
`TI1erefore, any discussions of embodiments of the invention
`in the context ofDPBCs and DPBC data do not limit the scope
`of the invention. The scope of the invention may also incor- 55
`porate embodiments using other barcode fonnats. For
`example, as explained above, an embodiment ofthe invention
`may use 4-state barcodes rather than eleven-digit DPBCs.
`System 200 may generate lists 218 and 220 on a daily basis.
`Furthermore, lists 218 and 220 may be saved in a file that is 60
`identified by date and site ID. Subsequently, Plants 206 and
`208 may upload these files to their respective Mail Processing
`Plaut Servers 222(1) and 222(2). A separate Mail Processing
`Plaut Server 222 may be used for each Postal Plant. The
`configt1ration of Servers 222 to Postal Plants 206 and 208 in 65
`FIG. 2 is only exemplary and does not limit tbe scope oftbe
`invention.
`
`6
`After files contaiuing lists 218 and 220 are uploaded, each
`file may be further uploaded from Processing Plaut Servers
`222(1) and 222(2) to a single server that operates as a central
`repository 224. Central repository 224 may store lists 218 and
`5 220 and other lists generated from multiple postal plants
`during a given day. Furthenuorc, central repository 224 may
`upload this data from each Postal Plant on a nightly basis so
`that a delivery service, such as USPS, has access to the density
`of all mail delivered to each eleven-digit DPBC in near real
`time.
`FIG. 28 is a flow diagram of a data collection process,
`according to an embodiment of the invention. Further to the
`discussiou above, a method using the functional arch.itecture
`illustrated in FIG. 2A, for instance, may begin in step 250 and
`reset delivery point counts in step 252. A delivery point count
`is the number of times that sorted mailpieces have been
`addressed to a given delivery point.
`ln step 254, the process reads delivery point data. TI1is step
`may be perfonued, for cxar:nple, i11 a mail sorting plant where
`bar code readers, optical character recognition (OCR) sys(cid:173)
`tems, radio frequency (RF) scanners, or other devices read
`delivery poiut data from letters, packages, or other mail(cid:173)
`pieces. As each mail piece is scarmed, a delivery point count is
`incremented in step 256.
`The process determines whether to continue in conditional
`step 258. Step 258 may be based on a predetermined time
`internal such as a daily data collection interval. Altemative
`data collection intervals, such as weekly, monthly, or some
`other time interval could also be used. Where the interval has
`not expired, the process repeats steps 254 and 256.
`When the predetermined time interval has been reached,
`the process is promoted to step 260 to output density data for
`each delivery point. Density data refers to the count of mail
`items sorted to a given delivery point per unit of time. For
`example, a given delivery point may have a density of 22
`items per day. Such density data may be output in step 260 for
`millions of delivery points in a day, for example, and the
`process may store such density data in step 262.
`As the DPBC data or other barcode data saved in lists 218
`and 220 is received at central repository 224, system 200 may
`further consolidate an