WO1998041933A8 - 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
WO1998041933A8
WO1998041933A8 PCT/FI1998/000192 FI9800192W WO9841933A8 WO 1998041933 A8 WO1998041933 A8 WO 1998041933A8 FI 9800192 W FI9800192 W FI 9800192W WO 9841933 A8 WO9841933 A8 WO 9841933A8
Authority
WO
WIPO (PCT)
Prior art keywords
node
address
replaced
nodes
trie
Prior art date
Application number
PCT/FI1998/000192
Other languages
Finnish (fi)
French (fr)
Other versions
WO1998041933A1 (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 EP98908123A priority Critical patent/EP0976066A1/en
Priority to AU66240/98A priority patent/AU6624098A/en
Publication of WO1998041933A1 publication Critical patent/WO1998041933A1/en
Publication of WO1998041933A8 publication Critical patent/WO1998041933A8/en
Priority to US09/389,574 priority patent/US6505206B1/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/901—Indexing; Data structures therefor; Storage structures
    • G06F16/9027—Trees
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
    • Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10S707/00—Data processing: database and file management or data structures
    • Y10S707/953—Organization of data
    • Y10S707/956—Hierarchical
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
    • Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10S707/00—Data processing: database and file management or data structures
    • Y10S707/99941—Database schema or data structure
    • Y10S707/99942—Manipulating data structure, e.g. compression, compaction, compilation

Abstract

The invention relates to a method for implementing a memory. The memory is implemented as a directory structure comprising a tree-shaped hierachy 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, the number of elements in the array corresponding to a power of two, 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 a node in another directory structure and another directory structure. To optimize storage space occupancy and memory efficiency, in at least part of the directory structure sets of successive trie nodes are replaced with compressed nodes in such a way that an individual set made up by successive trie nodes, from each of which there is only one address to a trie node at a lower level, is replaced with a compressed node (CN) storing an address to the 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.
PCT/FI1998/000192 1997-03-14 1998-03-04 Method for implementing an associative memory based on a digital trie structure WO1998041933A1 (en)

Priority Applications (3)

Application Number Priority Date Filing Date Title
EP98908123A EP0976066A1 (en) 1997-03-14 1998-03-04 Method for implementing an associative memory based on a digital trie structure
AU66240/98A AU6624098A (en) 1997-03-14 1998-03-04 Method for implementing an associative memory based on a digital trie structure
US09/389,574 US6505206B1 (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
FI971067A FI102426B (en) 1997-03-14 1997-03-14 Procedure for memory formation
FI971067 1997-03-14

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US09/389,574 Continuation US6505206B1 (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
WO1998041933A1 WO1998041933A1 (en) 1998-09-24
WO1998041933A8 true WO1998041933A8 (en) 1999-06-03

Family

ID=8548389

Family Applications (1)

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

Country Status (5)

Country Link
US (1) US6505206B1 (en)
EP (1) EP0976066A1 (en)
AU (1) AU6624098A (en)
FI (1) FI102426B (en)
WO (1) WO1998041933A1 (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
US11847693B1 (en) 2014-02-14 2023-12-19 Experian Information Solutions, Inc. Automatic generation of code for attributes
US11954089B2 (en) 2007-09-27 2024-04-09 Experian Information Solutions, Inc. Database system for triggering event notifications based on updates to database records

Families Citing this family (46)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
FI991262A (en) 1999-06-02 2000-12-03 Nokia Networks Oy Memory based on digital tree structure
FI991261A (en) 1999-06-02 2000-12-03 Nokia Networks Oy Functional memory based on 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
US6563439B1 (en) * 2000-10-31 2003-05-13 Intel Corporation Method of performing Huffman decoding
US6735595B2 (en) 2000-11-29 2004-05-11 Hewlett-Packard Development Company, L.P. Data structure and storage and retrieval method supporting ordinality based searching and data retrieval
US6654760B2 (en) * 2001-06-04 2003-11-25 Hewlett-Packard Development Company, L.P. System and method of providing a cache-efficient, hybrid, compressed digital tree with wide dynamic ranges and simple interface requiring no configuration or tuning
US6671694B2 (en) * 2001-06-04 2003-12-30 Hewlett-Packard Development Company, L.P. System for and method of cache-efficient digital tree with rich pointers
US6785687B2 (en) 2001-06-04 2004-08-31 Hewlett-Packard Development Company, L.P. System for and method of efficient, expandable storage and retrieval of small datasets
US6816856B2 (en) * 2001-06-04 2004-11-09 Hewlett-Packard Development Company, L.P. System for and method of data compression in a valueless digital tree representing a bitset
US6807618B1 (en) * 2001-08-08 2004-10-19 Emc Corporation Address translation
JP2004164318A (en) * 2002-11-13 2004-06-10 Hitachi Ltd Generation management method for backup data and storage controller to be used for this method
DE10329680A1 (en) * 2003-07-01 2005-02-10 Universität Stuttgart Processor architecture for exact pointer identification
US8180802B2 (en) * 2003-09-30 2012-05-15 International Business Machines Corporation Extensible decimal identification system for ordered nodes
AU2003292288A1 (en) * 2003-10-28 2005-06-17 France Telecom Trie-type memory device comprising a compression mechanism
US7634500B1 (en) 2003-11-03 2009-12-15 Netlogic Microsystems, Inc. Multiple string searching using content addressable memory
US7814129B2 (en) * 2005-03-11 2010-10-12 Ross Neil Williams Method and apparatus for storing data with reduced redundancy using data clusters
US8356021B2 (en) * 2005-03-11 2013-01-15 Ross Neil Williams Method and apparatus for indexing in a reduced-redundancy storage system
US8051252B2 (en) * 2005-03-11 2011-11-01 Ross Neil Williams Method and apparatus for detecting the presence of subblocks in a reduced-redundancy storage system
US7565380B1 (en) * 2005-03-24 2009-07-21 Netlogic Microsystems, Inc. Memory optimized pattern searching
US7908242B1 (en) 2005-04-11 2011-03-15 Experian Information Solutions, Inc. Systems and methods for optimizing database queries
US7353332B2 (en) * 2005-10-11 2008-04-01 Integrated Device Technology, Inc. Switching circuit implementing variable string matching
US8005759B2 (en) 2006-08-17 2011-08-23 Experian Information Solutions, Inc. System and method for providing a score for a used vehicle
US7783654B1 (en) 2006-09-19 2010-08-24 Netlogic Microsystems, Inc. Multiple string searching using content addressable memory
US7912865B2 (en) 2006-09-26 2011-03-22 Experian Marketing Solutions, Inc. System and method for linking multiple entities in a business database
US7917486B1 (en) 2007-01-18 2011-03-29 Netlogic Microsystems, Inc. Optimizing search trees by increasing failure size parameter
JP4402120B2 (en) * 2007-01-24 2010-01-20 株式会社エスグランツ Bit string search device, search method and program
US8606666B1 (en) 2007-01-31 2013-12-10 Experian Information Solutions, Inc. System and method for providing an aggregation tool
US20080288527A1 (en) * 2007-05-16 2008-11-20 Yahoo! Inc. User interface for graphically representing groups of data
US8122056B2 (en) 2007-05-17 2012-02-21 Yahoo! Inc. Interactive aggregation of data on a scatter plot
US7739229B2 (en) 2007-05-22 2010-06-15 Yahoo! Inc. Exporting aggregated and un-aggregated data
US7756900B2 (en) * 2007-05-22 2010-07-13 Yahoo!, Inc. Visual interface to indicate custom binning of items
US8874663B2 (en) * 2009-08-28 2014-10-28 Facebook, Inc. Comparing similarity between documents for filtering unwanted documents
US9853959B1 (en) 2012-05-07 2017-12-26 Consumerinfo.Com, Inc. Storage and maintenance of personal data
US9378304B2 (en) * 2013-01-16 2016-06-28 Google Inc. Searchable, mutable data structure
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
US9576030B1 (en) 2014-05-07 2017-02-21 Consumerinfo.Com, Inc. Keeping up with the joneses
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
CN116205724A (en) 2017-01-31 2023-06-02 益百利信息解决方案公司 Large scale heterogeneous data ingestion and user resolution
US11093450B2 (en) * 2017-09-27 2021-08-17 Vmware, Inc. Auto-tuned write-optimized key-value store
CN108319667B (en) * 2018-01-22 2021-03-05 上海星合网络科技有限公司 Multidimensional knowledge system display method and device
US11204905B2 (en) * 2018-06-27 2021-12-21 Datastax, Inc. Trie-based indices for databases
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 (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CA2001390C (en) 1988-12-19 1997-12-30 Ming-Chien Shan View composition in a data-base management system
AU620994B2 (en) 1989-07-12 1992-02-27 Digital Equipment Corporation Compressed prefix matching database searching
US5276868A (en) * 1990-05-23 1994-01-04 Digital Equipment Corp. Method and apparatus for pointer compression in structured databases
US5319777A (en) 1990-10-16 1994-06-07 Sinper Corporation System and method for storing and retrieving information from a multidimensional array
CA2117846C (en) * 1993-10-20 2001-02-20 Allen Reiter Computer method and storage structure for storing and accessing multidimensional data
ATE210856T1 (en) * 1994-06-06 2001-12-15 Nokia Networks Oy METHOD FOR STORING AND FINDING DATA AND A STORAGE ARRANGEMENT
WO1996000945A1 (en) * 1994-06-30 1996-01-11 International Business Machines Corp. Variable length data sequence matching method and apparatus
JP3152868B2 (en) * 1994-11-16 2001-04-03 富士通株式会社 Search device and dictionary / text search method
US6115716A (en) * 1997-03-14 2000-09-05 Nokia Telecommunications Oy Method for implementing an associative memory based on a digital trie structure

Cited By (11)

* 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
US11954731B2 (en) 2006-10-05 2024-04-09 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
US11954089B2 (en) 2007-09-27 2024-04-09 Experian Information Solutions, Inc. Database system for triggering event notifications based on updates to database records
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

Also Published As

Publication number Publication date
WO1998041933A1 (en) 1998-09-24
AU6624098A (en) 1998-10-12
US6505206B1 (en) 2003-01-07
FI102426B1 (en) 1998-11-30
FI971067A0 (en) 1997-03-14
FI971067A (en) 1998-09-15
FI102426B (en) 1998-11-30
EP0976066A1 (en) 2000-02-02

Similar Documents

Publication Publication Date Title
WO1998041933A8 (en) Method for implementing an associative memory based on a digital trie structure
WO1998041931A8 (en) Method for implementing an associative memory based on a digital trie structure
AU5519899A (en) Compression of nodes in a trie structure
WO1995034155A3 (en) A method for storing and retrieving data and a memory arrangement
US8325721B2 (en) Method for selecting hash function, method for storing and searching routing table and devices thereof
WO1998041932A8 (en) Method for implementing an associative memory based on a digital trie structure
US7356033B2 (en) Method and apparatus for performing network routing with use of power efficient TCAM-based forwarding engine architectures
Rivest et al. How to reuse a “write-once≓ memory
US7296113B2 (en) Memory and power efficient mechanism for fast table lookup
EP1551141A1 (en) Apparatus and method using hashing for efficiently implementing an IP lookup solution in hardware
US20070192303A1 (en) Method and Apparatus for Longest Prefix Matching in Processing a Forwarding Information Database
US20040139274A1 (en) Virtual content addressable memory with high speed key insertion and deletion and pipelined key search
Chin et al. A fast algorithm for computing longest common subsequences of small alphabet size
CN102597973A (en) Method and device for improving scalability of longest prefix match
US7130859B2 (en) Data structure for search
US6941417B1 (en) High-speed low-power CAM-based search engine
US20030188090A1 (en) Content addressable memories having entries stored therein with independently searchable weight fields and methods of operating same
US6490650B1 (en) Method and apparatus for generating a device index in a content addressable memory
JPH09179743A (en) Method and device for sorting element
CA2371029A1 (en) Data storage and retrieval
CA2439243C (en) Organising data in a database
US6901396B1 (en) Packed radix search tree implementation
US6003768A (en) Call-unit count device
US6839825B1 (en) Method and apparatus for logically expanding the width of memory
EP0157080A3 (en) Probabilistic learning element

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: 1998908123

Country of ref document: EP

WWE Wipo information: entry into national phase

Ref document number: 09389574

Country of ref document: US

REG Reference to national code

Ref country code: DE

Ref legal event code: 8642

WWP Wipo information: published in national office

Ref document number: 1998908123

Country of ref document: EP

NENP Non-entry into the national phase

Ref country code: JP

Ref document number: 1998540158

Format of ref document f/p: F

NENP Non-entry into the national phase

Ref country code: CA

WWW Wipo information: withdrawn in national office

Ref document number: 1998908123

Country of ref document: EP