WO1998041932A8 - Method for implementing an associative memory based on a digital trie structure - Google Patents

Method for implementing an associative memory based on a digital trie structure

Info

Publication number
WO1998041932A8
WO1998041932A8 PCT/FI1998/000191 FI9800191W WO9841932A8 WO 1998041932 A8 WO1998041932 A8 WO 1998041932A8 FI 9800191 W FI9800191 W FI 9800191W WO 9841932 A8 WO9841932 A8 WO 9841932A8
Authority
WO
WIPO (PCT)
Prior art keywords
node
nodes
quad
address
replaced
Prior art date
Application number
PCT/FI1998/000191
Other languages
French (fr)
Other versions
WO1998041932A1 (en
Inventor
Matti Tikkanen
Jukka-Pekka Iivonen
Original Assignee
Nokia Telecommunications Oy
Matti Tikkanen
Iivonen Jukka Pekka
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Nokia Telecommunications Oy, Matti Tikkanen, Iivonen Jukka Pekka filed Critical Nokia Telecommunications Oy
Priority to AU66239/98A priority Critical patent/AU6623998A/en
Priority to EP98908122A priority patent/EP0970430A1/en
Publication of WO1998041932A1 publication Critical patent/WO1998041932A1/en
Publication of WO1998041932A8 publication Critical patent/WO1998041932A8/en
Priority to US09/389,498 priority patent/US6115716A/en

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90—Details of database functions independent of the retrieved data types
    • G06F16/903—Querying
    • G06F16/90335—Query processing
    • G06F16/90339—Query processing by using parallel associative memories or content-addressable memories

Abstract

The invention relates to a method for implementing a memory. The memory is implemented as a directory structure comprising a tree-shaped hierarchy having nodes at several different levels, wherein an individual node can be (i) a trie node comprising an array wherein an individual element may contain the address of a lower node in the tree-shaped hierarchy and wherein an individual element may also be empty, or (ii) a bucket containing at least one element so that the type of an individual element in the bucket is selected from a group including a data unit, a pointer to a stored data unit, a pointer to another directory structure and another directory structure. To minimize storage space requirement, the arrays in the trie nodes are implemented as quad nodes having a fixed size of four elements, and in at least part of the directory structure sets of successive quad nodes are replaced with compressed nodes in such a way that an individual set made up by successive quad nodes, from each of which there is only one address to a quad node at a lower level, is replaced with a compressed node (CN) storing an address to the quad node that the lowest node in the set to be replaced points to, information on the value of the search word by means of which said address is found, and information on the total number of bits from which search words are formed in the set to be replaced. The invention also relates to a structure in which buckets are not employed.

Description

Figure imgf000003_0001
C (Continuation). DOCUMENTS CONSIDERED TO BE RELEVA NT
Category* Citation of document, with indication, where appropriate, of the relevant passages Relevant to claim No.
US 5276868 A (NIGEL T. POOLE), 4 January 1994 1-14
(04.01.94), column 1, line 13 - column 2, line 15; column 2, line 18 - column 3, line 30, figure 2
WO 9534155 A2 (NOKIA TELECOMMUNICATIONS OY), 1-14 14 December 1995 (14.12.95)
Fast IP routing with LC-Tries; achieving gbit/see speed in software. (Internet/Web/ Online Service Information) Nilsson, Stefan; Karlsson Gunnar Dr. Dobb's Journal, v 23, n8, p70(5) August, 1998
Form PCr/ISA/210 (continuation of second n orma on on patent am y mem ers
02/03/99 PCT/FI 98/00191
Patent document Publication Patent family Publication cited in search report dale member(s) date
EP 0408188 A2 16/01/91 AU 620994 B 27/02/92 AU 1125792 A 07/05/92 AU 5686390 A 17/01/91 CA 2019730 A 12/01/91 JP 3135668 A 10/06/91 US 5781772 A 14/07/98
US 5276868 A 04/01/94 CA 2043028 A 24/11/91 EP 0458698 A 27/11/91 JP 6004585 A 14/01/94
WO 9534155 A2 14/12/95 AU 690282 B 23/04/98 AU 2617495 A 04/01/96 CN 1152365 18/06/97 EP 0772836 14/05/97 FI 942663 00/00/00 JP 10504407 28/04/98 US 5848416 08/12/98 FI 942664 D 00/00/00
Form PCr/IS A/210 (patent family annex) (J
PCT/FI1998/000191 1997-03-14 1998-03-04 Method for implementing an associative memory based on a digital trie structure WO1998041932A1 (en)

Priority Applications (3)

Application Number Priority Date Filing Date Title
AU66239/98A AU6623998A (en) 1997-03-14 1998-03-04 Method for implementing an associative memory based on a digital trie structure
EP98908122A EP0970430A1 (en) 1997-03-14 1998-03-04 Method for implementing an associative memory based on a digital trie structure
US09/389,498 US6115716A (en) 1997-03-14 1999-09-03 Method for implementing an associative memory based on a digital trie structure

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
FI971066A FI102425B1 (en) 1997-03-14 1997-03-14 Method for implementing memory
FI971066 1997-03-14

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US09/389,498 Continuation US6115716A (en) 1997-03-14 1999-09-03 Method for implementing an associative memory based on a digital trie structure

Publications (2)

Publication Number Publication Date
WO1998041932A1 WO1998041932A1 (en) 1998-09-24
WO1998041932A8 true WO1998041932A8 (en) 1999-06-03

Family

ID=8548388

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/FI1998/000191 WO1998041932A1 (en) 1997-03-14 1998-03-04 Method for implementing an associative memory based on a digital trie structure

Country Status (4)

Country Link
EP (1) EP0970430A1 (en)
AU (1) AU6623998A (en)
FI (1) FI102425B1 (en)
WO (1) WO1998041932A1 (en)

Cited By (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8954459B1 (en) 2008-06-26 2015-02-10 Experian Marketing Solutions, Inc. Systems and methods for providing an integrated identifier
US9147042B1 (en) 2010-11-22 2015-09-29 Experian Information Solutions, Inc. Systems and methods for data verification
US9152727B1 (en) 2010-08-23 2015-10-06 Experian Marketing Solutions, Inc. Systems and methods for processing consumer information for targeted marketing applications
US9251541B2 (en) 2007-05-25 2016-02-02 Experian Information Solutions, Inc. System and method for automated detection of never-pay data sets
US9342783B1 (en) 2007-03-30 2016-05-17 Consumerinfo.Com, Inc. Systems and methods for data verification
US9483606B1 (en) 2011-07-08 2016-11-01 Consumerinfo.Com, Inc. Lifescore
US9529851B1 (en) 2013-12-02 2016-12-27 Experian Information Solutions, Inc. Server architecture for electronic data quality processing
US9563916B1 (en) 2006-10-05 2017-02-07 Experian Information Solutions, Inc. System and method for generating a finance attribute from tradeline data
US9576030B1 (en) 2014-05-07 2017-02-21 Consumerinfo.Com, Inc. Keeping up with the joneses
US11847693B1 (en) 2014-02-14 2023-12-19 Experian Information Solutions, Inc. Automatic generation of code for attributes

Families Citing this family (18)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
FI982095A (en) 1998-09-29 2000-03-30 Nokia Networks Oy Method of implementing memory and memory arrangement
FI991261A (en) 1999-06-02 2000-12-03 Nokia Networks Oy Functional memory based on tree structure
FI991262A (en) 1999-06-02 2000-12-03 Nokia Networks Oy Memory based on digital tree structure
GB2367917A (en) 2000-10-12 2002-04-17 Qas Systems Ltd Retrieving data representing a postal address from a database of postal addresses using a trie structure
US7908242B1 (en) 2005-04-11 2011-03-15 Experian Information Solutions, Inc. Systems and methods for optimizing database queries
EP2074572A4 (en) 2006-08-17 2011-02-23 Experian Inf Solutions Inc System and method for providing a score for a used vehicle
US7912865B2 (en) 2006-09-26 2011-03-22 Experian Marketing Solutions, Inc. System and method for linking multiple entities in a business database
US8606666B1 (en) 2007-01-31 2013-12-10 Experian Information Solutions, Inc. System and method for providing an aggregation tool
US9690820B1 (en) 2007-09-27 2017-06-27 Experian Information Solutions, Inc. Database system for triggering event notifications based on updates to database records
US9853959B1 (en) 2012-05-07 2017-12-26 Consumerinfo.Com, Inc. Storage and maintenance of personal data
US9697263B1 (en) 2013-03-04 2017-07-04 Experian Information Solutions, Inc. Consumer data request fulfillment system
US10102536B1 (en) 2013-11-15 2018-10-16 Experian Information Solutions, Inc. Micro-geographic aggregation system
US10242019B1 (en) 2014-12-19 2019-03-26 Experian Information Solutions, Inc. User behavior segmentation using latent topic detection
WO2018039377A1 (en) 2016-08-24 2018-03-01 Experian Information Solutions, Inc. Disambiguation and authentication of device users
CN110383319B (en) 2017-01-31 2023-05-26 益百利信息解决方案公司 Large scale heterogeneous data ingestion and user resolution
US10963434B1 (en) 2018-09-07 2021-03-30 Experian Information Solutions, Inc. Data architecture for supporting multiple search models
US11941065B1 (en) 2019-09-13 2024-03-26 Experian Information Solutions, Inc. Single identifier platform for storing entity data
US11880377B1 (en) 2021-03-26 2024-01-23 Experian Information Solutions, Inc. Systems and methods for entity resolution

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5276868A (en) * 1990-05-23 1994-01-04 Digital Equipment Corp. Method and apparatus for pointer compression in structured databases
CA2117846C (en) * 1993-10-20 2001-02-20 Allen Reiter Computer method and storage structure for storing and accessing multidimensional data
US5848416A (en) * 1994-06-06 1998-12-08 Nokia Telecommunications Oy Method and apparatus for storing and retrieving data and a memory arrangement
US5787430A (en) * 1994-06-30 1998-07-28 International Business Machines Corporation Variable length data sequence backtracking a trie structure
JP3152868B2 (en) * 1994-11-16 2001-04-03 富士通株式会社 Search device and dictionary / text search method

Cited By (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9563916B1 (en) 2006-10-05 2017-02-07 Experian Information Solutions, Inc. System and method for generating a finance attribute from tradeline data
US9342783B1 (en) 2007-03-30 2016-05-17 Consumerinfo.Com, Inc. Systems and methods for data verification
US9251541B2 (en) 2007-05-25 2016-02-02 Experian Information Solutions, Inc. System and method for automated detection of never-pay data sets
US8954459B1 (en) 2008-06-26 2015-02-10 Experian Marketing Solutions, Inc. Systems and methods for providing an integrated identifier
US9152727B1 (en) 2010-08-23 2015-10-06 Experian Marketing Solutions, Inc. Systems and methods for processing consumer information for targeted marketing applications
US9147042B1 (en) 2010-11-22 2015-09-29 Experian Information Solutions, Inc. Systems and methods for data verification
US9483606B1 (en) 2011-07-08 2016-11-01 Consumerinfo.Com, Inc. Lifescore
US9529851B1 (en) 2013-12-02 2016-12-27 Experian Information Solutions, Inc. Server architecture for electronic data quality processing
US11847693B1 (en) 2014-02-14 2023-12-19 Experian Information Solutions, Inc. Automatic generation of code for attributes
US9576030B1 (en) 2014-05-07 2017-02-21 Consumerinfo.Com, Inc. Keeping up with the joneses

Also Published As

Publication number Publication date
FI102425B (en) 1998-11-30
FI971066A (en) 1998-09-15
AU6623998A (en) 1998-10-12
WO1998041932A1 (en) 1998-09-24
FI971066A0 (en) 1997-03-14
FI102425B1 (en) 1998-11-30
EP0970430A1 (en) 2000-01-12

Similar Documents

Publication Publication Date Title
WO1998041932A8 (en) Method for implementing an associative memory based on a digital trie structure
WO1998041933A8 (en) Method for implementing an associative memory based on a digital trie structure
US7324519B2 (en) Method and apparatus for encoding a plurality of pre-defined codes into a search key and for locating a longest matching pre-defined code
US7356033B2 (en) Method and apparatus for performing network routing with use of power efficient TCAM-based forwarding engine architectures
US7526603B1 (en) High-speed low-power CAM-based search engine
EP1008063B1 (en) Method for implementing an associative memory based on a digital trie structure
US7562196B2 (en) Method and apparatus for determining precedence in a classification engine
US6910043B2 (en) Compression of nodes in a trie structure
US7219184B2 (en) Method and apparatus for longest prefix matching in processing a forwarding information database
EP1551141A1 (en) Apparatus and method using hashing for efficiently implementing an IP lookup solution in hardware
US6804230B1 (en) Communication device with forwarding database having a trie search facility
US7013367B2 (en) Caching associative memory using non-overlapping data
US6574701B2 (en) Technique for updating a content addressable memory
US6636956B1 (en) Memory management of striped pipelined data structures
US6532516B1 (en) Technique for updating a content addressable memory
US5870584A (en) Method and apparatus for sorting elements
JP2003224581A (en) Longest match retrieval circuit, its method, its program, and recording medium
US5659733A (en) Sort processing method and apparatus for sorting data blocks using work buffer merge data records while sequentially transferring data records from work buffers
JPH07118719B2 (en) Pattern search method and apparatus
SE516703C2 (en) Device, system and method related to routing of packets in a data communication network
Tao et al. Guided multiple hashing: Achieving near perfect balance for fast routing lookup
KR100459542B1 (en) Internet protocol address look-up device
Jih-Kwon et al. Guided Multiple Hashing: Achieving Near Perfect Balance for Fast Routing Lookup

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): AL AM AT AU AZ BA BB BG BR BY CA CH CN CU CZ DE DK EE ES FI GB GE GH GM GW HU ID IL IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MD MG MK MN MW MX NO NZ PL PT RO RU SD SE SG SI SK SL TJ TM TR TT UA UG US UZ VN YU ZW

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): GH GM KE LS MW SD SZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH DE DK ES FI FR GB GR IE IT LU MC NL PT SE BF BJ CF CG CI CM GA GN ML MR NE SN TD TG

DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
121 Ep: the epo has been informed by wipo that ep was designated in this application
AK Designated states

Kind code of ref document: C1

Designated state(s): AL AM AT AU AZ BA BB BG BR BY CA CH CN CU CZ DE DK EE ES FI GB GE GH GM GW HU ID IL IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MD MG MK MN MW MX NO NZ PL PT RO RU SD SE SG SI SK SL TJ TM TR TT UA UG US UZ VN YU ZW

AL Designated countries for regional patents

Kind code of ref document: C1

Designated state(s): GH GM KE LS MW SD SZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH DE DK ES FI FR GB GR IE IT LU MC NL PT SE BF BJ CF CG CI CM GA GN ML MR NE SN TD TG

WR Later publication of a revised version of an international search report
WWE Wipo information: entry into national phase

Ref document number: 1998908122

Country of ref document: EP

WWE Wipo information: entry into national phase

Ref document number: 09389498

Country of ref document: US

WWP Wipo information: published in national office

Ref document number: 1998908122

Country of ref document: EP

REG Reference to national code

Ref country code: DE

Ref legal event code: 8642

NENP Non-entry into the national phase in:

Ref country code: JP

Ref document number: 1998540157

Format of ref document f/p: F

NENP Non-entry into the national phase in:

Ref country code: CA

WWW Wipo information: withdrawn in national office

Ref document number: 1998908122

Country of ref document: EP