CA2323098A1 - Method and access means for determining the storage address of a data value in a memory device - Google Patents

Method and access means for determining the storage address of a data value in a memory device Download PDF

Info

Publication number
CA2323098A1
CA2323098A1 CA002323098A CA2323098A CA2323098A1 CA 2323098 A1 CA2323098 A1 CA 2323098A1 CA 002323098 A CA002323098 A CA 002323098A CA 2323098 A CA2323098 A CA 2323098A CA 2323098 A1 CA2323098 A1 CA 2323098A1
Authority
CA
Canada
Prior art keywords
address
previous
access means
data value
calculated
Prior art date
Legal status (The legal status 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 status listed.)
Granted
Application number
CA002323098A
Other languages
French (fr)
Other versions
CA2323098C (en
Inventor
Bengt Erik Ingemar Gard
Sten Edvard Johnsson
Lars-Orjan Kling
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Telefonaktiebolaget LM Ericsson AB
Original Assignee
Individual
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 Individual filed Critical Individual
Publication of CA2323098A1 publication Critical patent/CA2323098A1/en
Application granted granted Critical
Publication of CA2323098C publication Critical patent/CA2323098C/en
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

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/9014—Indexing; Data structures therefor; Storage structures hash tables
    • 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/99931—Database or file accessing
    • Y10S707/99932—Access augmentation or optimizing

Abstract

The invention relates to a method and an access means for determining the storage address of a predetermined data value in a memory device. The data values are stored in an increasing order sequentially in a column direction according to a binary tree data structure. A
new subtree root node is calculated from the previous leaf node address when the data value to be searched is not located in the previous subtree. Since a new subtree root node is always calculated from a previous leaf node address and the comparison result between the searched and read out value, the number of row address changes can be kept to a minimum whilst a high speed for the subtree searching is maintained. The search method and the access means is memory efficient since no pointers are used and fast, since the address of a next memory location to be investigated can always be calculated from the previous address and the last comparison result.
CA002323098A 1998-03-12 1999-03-11 Method and access means for determining the storage address of a data value in a memory device Expired - Lifetime CA2323098C (en)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
DE19810843A DE19810843B4 (en) 1998-03-12 1998-03-12 Method and access device for determining the storage address of a data value in a storage device
DE19810843.5 1998-03-12
PCT/EP1999/001588 WO1999046696A1 (en) 1998-03-12 1999-03-11 Method and access means for determining the storage address of a data value in a memory device

Publications (2)

Publication Number Publication Date
CA2323098A1 true CA2323098A1 (en) 1999-09-16
CA2323098C CA2323098C (en) 2005-12-27

Family

ID=7860713

Family Applications (1)

Application Number Title Priority Date Filing Date
CA002323098A Expired - Lifetime CA2323098C (en) 1998-03-12 1999-03-11 Method and access means for determining the storage address of a data value in a memory device

Country Status (10)

Country Link
US (1) US6415279B1 (en)
EP (1) EP1062597B1 (en)
JP (1) JP4807686B2 (en)
KR (1) KR20010041803A (en)
CN (1) CN1292903A (en)
AU (1) AU2729299A (en)
BR (1) BR9908733A (en)
CA (1) CA2323098C (en)
DE (1) DE19810843B4 (en)
WO (1) WO1999046696A1 (en)

Families Citing this family (27)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6444072B1 (en) * 1999-08-11 2002-09-03 Southpac Trust International Process for producing holographic material
AU2001240061A1 (en) * 2000-03-09 2001-09-17 The Web Access, Inc. Method and apparatus for organizing data by overlaying a searchable database with a directory tree structure
US6567815B1 (en) * 2000-08-01 2003-05-20 International Business Machines Corporation Technique of clustering and compaction of binary trees
GB0100331D0 (en) * 2001-01-06 2001-02-14 Secr Defence Method of querying a structure of compressed data
US6757780B2 (en) * 2002-01-09 2004-06-29 Hywire Ltd. Multiple module content addressable memories
KR100484375B1 (en) * 2002-02-05 2005-04-20 이영섭 statistic classification method of data using one-sided extreme splitting criteria for classification trees in data mining
US6941314B2 (en) * 2002-04-15 2005-09-06 Lsi Logic Corporation User selectable editing protocol for fast flexible search engine
US6901476B2 (en) * 2002-05-06 2005-05-31 Hywire Ltd. Variable key type search engine and method therefor
US8335779B2 (en) 2002-08-16 2012-12-18 Gamroe Applications, Llc Method and apparatus for gathering, categorizing and parameterizing data
US7017005B2 (en) * 2002-08-28 2006-03-21 Hywire Ltd. Implementation of a content addressable memory using a RAM-cell structure
US7653010B2 (en) * 2003-06-03 2010-01-26 Casient Limited System and method for wireless mesh networking
US7627616B2 (en) * 2004-08-30 2009-12-01 Hywire Ltb. Database storage and maintenance using row index ordering
US9171100B2 (en) * 2004-09-22 2015-10-27 Primo M. Pettovello MTree an XPath multi-axis structure threaded index
US20090106289A1 (en) * 2004-10-01 2009-04-23 Turbo Data Laboratories Inc. Array Generation Method And Array Generation Program
JP4507991B2 (en) * 2005-06-09 2010-07-21 ソニー株式会社 Information processing apparatus, information processing method, and program
US20070174309A1 (en) * 2006-01-18 2007-07-26 Pettovello Primo M Mtreeini: intermediate nodes and indexes
US20100017700A1 (en) * 2008-06-13 2010-01-21 Skribel, Inc. Methods and Systems for Handling Annotations and Using Calculation of Addresses in Tree-Based Structures
US8631028B1 (en) 2009-10-29 2014-01-14 Primo M. Pettovello XPath query processing improvements
JP5220047B2 (en) * 2009-11-30 2013-06-26 株式会社高速屋 Bit string search device, search method and program
JP5220057B2 (en) * 2010-05-27 2013-06-26 株式会社高速屋 Bit string search device, search method and program
CN102741841A (en) * 2009-11-30 2012-10-17 新叶股份有限公司 Bit stream retrieval device, retrieval method, and program
US9280575B2 (en) * 2012-07-20 2016-03-08 Sap Se Indexing hierarchical data
CN103984636B (en) * 2013-02-08 2017-09-29 上海芯豪微电子有限公司 Storage organization and information storage, reading, addressing method
KR101666307B1 (en) 2015-05-14 2016-10-13 영남대학교 산학협력단 Method and device of heap sorting based on a memory device
US11220107B2 (en) 2016-02-05 2022-01-11 Hewlett-Packard Development Company, L.P. Printheads
US10977106B2 (en) * 2018-02-09 2021-04-13 Microsoft Technology Licensing, Llc Tree-based anomaly detection
CN113570176B (en) * 2020-04-28 2024-03-26 顺丰科技有限公司 Cargo packing scheme output method, device, computer equipment and storage medium

Family Cites Families (19)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US3611435A (en) 1969-03-24 1971-10-05 Itt Satellite communication system
US5204967A (en) 1984-05-29 1993-04-20 Armstrong Philip N Sorting system using cascaded modules with levels of memory cells among which levels data are displaced along ordered path indicated by pointers
GB8515482D0 (en) * 1985-06-19 1985-07-24 Int Computers Ltd Search apparatus
US5155837A (en) 1989-03-02 1992-10-13 Bell Communications Research, Inc. Methods and apparatus for software retrofitting
US5495610A (en) 1989-11-30 1996-02-27 Seer Technologies, Inc. Software distribution system to build and distribute a software release
US5442783A (en) 1990-01-22 1995-08-15 Motorola, Inc. Method and apparatus for transferring data base information
US5481721A (en) 1991-07-17 1996-01-02 Next Computer, Inc. Method for providing automatic and dynamic translation of object oriented programming language-based message passing into operation system message passing using proxy objects
US5410703A (en) 1992-07-01 1995-04-25 Telefonaktiebolaget L M Ericsson System for changing software during computer operation
US5418947A (en) * 1992-12-23 1995-05-23 At&T Corp. Locating information in an unsorted database utilizing a B-tree
US5734791A (en) * 1992-12-31 1998-03-31 Apple Computer, Inc. Rapid tree-based method for vector quantization
US5459606A (en) 1993-05-10 1995-10-17 At&T Ipm Corp. In-service upgrade for a telecommunication system
DE4316500C2 (en) 1993-05-17 1995-03-16 Siemens Ag Procedure for changing a system software
WO1995012846A1 (en) 1993-11-02 1995-05-11 Paracom Corporation Apparatus for accelerating processing of transactions on computer databases
JP3177117B2 (en) 1994-05-11 2001-06-18 インターナショナル・ビジネス・マシーンズ・コーポレ−ション Method and apparatus for updating control codes in multiple nodes
DE4429969A1 (en) 1994-08-24 1996-02-29 Sel Alcatel Ag Process for exchanging program packages in a multi-computer system and computer therefor
US5487166A (en) * 1994-09-19 1996-01-23 Amdahl Corporation Computer with two-dimensional merge tournament sort using offset-value coding
DE4438697A1 (en) 1994-10-29 1996-05-02 Sel Alcatel Ag Method for loading multi-computer systems
DE19533961A1 (en) 1995-09-13 1997-03-20 Siemens Ag Method for loading software in communication systems with non-redundant, decentralized devices
US5991541A (en) 1996-08-12 1999-11-23 Adc Telecommunications, Inc. Dynamically modifiable call processing methods and apparatus

Also Published As

Publication number Publication date
CA2323098C (en) 2005-12-27
AU2729299A (en) 1999-09-27
US6415279B1 (en) 2002-07-02
DE19810843B4 (en) 2004-11-25
EP1062597B1 (en) 2002-06-05
JP4807686B2 (en) 2011-11-02
WO1999046696A1 (en) 1999-09-16
CN1292903A (en) 2001-04-25
DE19810843A1 (en) 1999-09-30
EP1062597A1 (en) 2000-12-27
JP2002507026A (en) 2002-03-05
BR9908733A (en) 2000-11-21
KR20010041803A (en) 2001-05-25

Similar Documents

Publication Publication Date Title
CA2323098A1 (en) Method and access means for determining the storage address of a data value in a memory device
US5497485A (en) Method and apparatus for implementing Q-trees
US5706224A (en) Content addressable memory and random access memory partition circuit
CA1291574C (en) Data retrieval system
JP3196720B2 (en) Associative memory control circuit and control method
US20030093646A1 (en) RAM-based range content addressable memory
US6963868B2 (en) Multi-bit Patricia trees
US7231383B2 (en) Search engine for large-width data
WO2003054739A3 (en) Hybrid search memory for network processor and computer systems
CA2136300A1 (en) Method and apparatus for storing and retrieving multi-dimensional data in computer memory
US7565482B1 (en) Method and device for scalable multiple match extraction from search data
US20040139274A1 (en) Virtual content addressable memory with high speed key insertion and deletion and pipelined key search
US6532457B1 (en) Look-ahead tree structure
KR950704788A (en) Pattern Search and Replay Logic in Dynamic Memory
EP0121072A3 (en) Method for accessing a data set in a word processing system
US6901476B2 (en) Variable key type search engine and method therefor
KR900002170A (en) Variable Length Data Processing Unit
KR950012260A (en) Method and apparatus for accessing specific subset of data items
WO1997034275A3 (en) Storage medium carrying geographical location data
GB1533326A (en) Storage arrangements
WO2001067456A2 (en) Multiple entry matching in a content addressable memory
CA2371029A1 (en) Data storage and retrieval
GB1022794A (en) Addressing system for computer data store
US6901396B1 (en) Packed radix search tree implementation
Shishibori et al. An efficient compression method for Patricia tries

Legal Events

Date Code Title Description
EEER Examination request
MKEX Expiry

Effective date: 20190311