JP2001527240A5 - - Google Patents

Download PDF

Info

Publication number
JP2001527240A5
JP2001527240A5 JP2000525830A JP2000525830A JP2001527240A5 JP 2001527240 A5 JP2001527240 A5 JP 2001527240A5 JP 2000525830 A JP2000525830 A JP 2000525830A JP 2000525830 A JP2000525830 A JP 2000525830A JP 2001527240 A5 JP2001527240 A5 JP 2001527240A5
Authority
JP
Japan
Prior art keywords
record
symbols
current
sequence
symbol
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.)
Pending
Application number
JP2000525830A
Other languages
English (en)
Japanese (ja)
Other versions
JP2001527240A (ja
Filing date
Publication date
Priority claimed from SE9704767A external-priority patent/SE513248C2/sv
Application filed filed Critical
Publication of JP2001527240A publication Critical patent/JP2001527240A/ja
Publication of JP2001527240A5 publication Critical patent/JP2001527240A5/ja
Pending legal-status Critical Current

Links

JP2000525830A 1997-12-19 1998-12-04 データ構造内の管理 Pending JP2001527240A (ja)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
SE9704767-4 1997-12-19
SE9704767A SE513248C2 (sv) 1997-12-19 1997-12-19 Metod för hantering av datastrukturer
PCT/SE1998/002221 WO1999032994A2 (en) 1997-12-19 1998-12-04 Management in data structures

Publications (2)

Publication Number Publication Date
JP2001527240A JP2001527240A (ja) 2001-12-25
JP2001527240A5 true JP2001527240A5 (enExample) 2006-02-02

Family

ID=20409473

Family Applications (1)

Application Number Title Priority Date Filing Date
JP2000525830A Pending JP2001527240A (ja) 1997-12-19 1998-12-04 データ構造内の管理

Country Status (8)

Country Link
US (1) US6298339B1 (enExample)
EP (1) EP1040430B1 (enExample)
JP (1) JP2001527240A (enExample)
KR (1) KR20010033096A (enExample)
AU (1) AU1793299A (enExample)
DE (1) DE69840875D1 (enExample)
SE (1) SE513248C2 (enExample)
WO (1) WO1999032994A2 (enExample)

Families Citing this family (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7249149B1 (en) 1999-08-10 2007-07-24 Washington University Tree bitmap data structures and their use in performing lookup operations
US6560610B1 (en) 1999-08-10 2003-05-06 Washington University Data structure using a tree bitmap and method for rapid classification of data in a database
US6725326B1 (en) 2000-08-15 2004-04-20 Cisco Technology, Inc. Techniques for efficient memory management for longest prefix match problems
US6775737B1 (en) 2001-10-09 2004-08-10 Cisco Technology, Inc. Method and apparatus for allocating and using range identifiers as input values to content-addressable memories
US6754795B2 (en) * 2001-12-21 2004-06-22 Agere Systems Inc. Methods and apparatus for forming linked list queue using chunk-based structure
US6970971B1 (en) 2002-01-08 2005-11-29 Cisco Technology, Inc. Method and apparatus for mapping prefixes and values of a hierarchical space to other representations
US7899067B2 (en) 2002-05-31 2011-03-01 Cisco Technology, Inc. Method and apparatus for generating and using enhanced tree bitmap data structures in determining a longest prefix match
US7558775B1 (en) 2002-06-08 2009-07-07 Cisco Technology, Inc. Methods and apparatus for maintaining sets of ranges typically using an associative memory and for using these ranges to identify a matching range based on a query point or query range and to maintain sorted elements for use such as in providing priority queue operations
US7299317B1 (en) 2002-06-08 2007-11-20 Cisco Technology, Inc. Assigning prefixes to associative memory classes based on a value of a last bit of each prefix and their use including but not limited to locating a prefix and for maintaining a Patricia tree data structure
US7441074B1 (en) 2002-08-10 2008-10-21 Cisco Technology, Inc. Methods and apparatus for distributing entries among lookup units and selectively enabling less than all of the lookup units when performing a lookup operation
US7415463B2 (en) * 2003-05-13 2008-08-19 Cisco Technology, Inc. Programming tree data structures and handling collisions while performing lookup operations
US7415472B2 (en) * 2003-05-13 2008-08-19 Cisco Technology, Inc. Comparison tree data structures of particular use in performing lookup operations
US7478109B1 (en) 2004-03-15 2009-01-13 Cisco Technology, Inc. Identification of a longest matching prefix based on a search of intervals corresponding to the prefixes
US11625386B2 (en) * 2021-01-29 2023-04-11 Salesforce.Com, Inc. Fast skip list purge

Family Cites Families (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4468728A (en) * 1981-06-25 1984-08-28 At&T Bell Laboratories Data structure and search method for a data base management system
US4611272A (en) * 1983-02-03 1986-09-09 International Business Machines Corporation Key-accessed file organization
US5497485A (en) * 1993-05-21 1996-03-05 Amalgamated Software Of North America, Inc. Method and apparatus for implementing Q-trees
US5560007A (en) * 1993-06-30 1996-09-24 Borland International, Inc. B-tree key-range bit map index optimization of database queries
SE503376C2 (sv) * 1994-06-13 1996-06-03 Ericsson Telefon Ab L M Kundprofilerad telekommunikationstjänst
DE69422935T2 (de) * 1994-06-30 2000-08-17 International Business Machines Corp., Armonk Verfahren und vorrichtung zum vergleichen von datensequenzen variabler länge
JP3152871B2 (ja) 1995-11-10 2001-04-03 富士通株式会社 ラティスをキーとした検索を行う辞書検索装置および方法
US5758353A (en) * 1995-12-01 1998-05-26 Sand Technology Systems International, Inc. Storage and retrieval of ordered sets of keys in a compact 0-complete tree
US6065046A (en) * 1997-07-29 2000-05-16 Catharon Productions, Inc. Computerized system and associated method of optimally controlled storage and transfer of computer programs on a computer network
US6141655A (en) * 1997-09-23 2000-10-31 At&T Corp Method and apparatus for optimizing and structuring data by designing a cube forest data structure for hierarchically split cube forest template

Similar Documents

Publication Publication Date Title
JP2001527240A5 (enExample)
US4677550A (en) Method of compacting and searching a data index
CA2117846C (en) Computer method and storage structure for storing and accessing multidimensional data
Huddleston et al. A new data structure for representing sorted lists
Comer et al. The complexity of trie index construction
CN102929936B (zh) 日志记录方法、日志查询方法及系统
KR910006873A (ko) 부분적인 키이 브랜치를 구비한 접두사 서치트리
SG42807A1 (en) Concurrent record access database system
KR20010090840A (ko) 분할형 포멧으로 저장된 가변 크기의 레코드를 빠르게램덤 액세스하는 장치 및 방법
CA2524033A1 (en) Methods and systems for joining database tables using indexing data structures
JP2001043290A5 (enExample)
NO20014399L (no) En datastruktur og lagrings- og hentemetode som stötter ordinal-tallbasert datasöking og henting
WO1999032994A3 (en) Management in data structures
US8204882B2 (en) Method for accessing a storage unit during the search for substrings, and a corresponding storage unit
KR100618966B1 (ko) 데이터 열의 임시 삭제 방법, 복원 방법, 임시 삭제된 데이터 열들을 신속하게 영구 삭제하는 방법과 임시 삭제된 데이터 열들을 복원하거나 영구 삭제하기 위한 부가 정보를 저장하는 기록 매체
WO2005066835A1 (en) A method for quickly retrieving a record in a data page of a database
Shneiderman Reduced combined indexes for efficient multiple attribute retrieval
CN111625543A (zh) 一种基于HBase表实现全局单调递增的序列的方法
CA2675915C (en) Content addressable storage systems and methods employing searchable blocks
JP2675958B2 (ja) 情報検索用計算機システム及びその記憶装置の動作方法
CN101656953B (zh) 号码匹配方法和装置
Plesník Towards minimum k‐geodetically connected graphs
Battiti Partially persistent dynamic sets for history-sensitive heuristics.
US7139763B1 (en) Method and system for processing data selected for recording to optical media
Nicklas et al. Index structuring in inverted data bases by TRIES