JP2001527240A - データ構造内の管理 - Google Patents
データ構造内の管理Info
- Publication number
- JP2001527240A JP2001527240A JP2000525830A JP2000525830A JP2001527240A JP 2001527240 A JP2001527240 A JP 2001527240A JP 2000525830 A JP2000525830 A JP 2000525830A JP 2000525830 A JP2000525830 A JP 2000525830A JP 2001527240 A JP2001527240 A JP 2001527240A
- Authority
- JP
- Japan
- Prior art keywords
- record
- current
- symbols
- 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
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; 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/9024—Graphs; Linked lists
-
- 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
-
- 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
-
- 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/99933—Query processing, i.e. searching
-
- 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/99951—File or database maintenance
- Y10S707/99952—Coherency, e.g. same view to multiple users
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Software Systems (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
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 true JP2001527240A (ja) | 2001-12-25 |
| JP2001527240A5 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) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2003228515A (ja) * | 2001-12-21 | 2003-08-15 | Agere Systems Inc | チャンク・ベースの構造を使用してリンク・リスト待ち行列を形成するための方法および装置 |
| CN116745756A (zh) * | 2021-01-29 | 2023-09-12 | 易享信息技术有限公司 | 快速跳跃列表清除 |
Families Citing this family (12)
| 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 |
| 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 |
Family Cites Families (10)
| 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 |
-
1997
- 1997-12-19 SE SE9704767A patent/SE513248C2/sv not_active IP Right Cessation
-
1998
- 1998-12-04 JP JP2000525830A patent/JP2001527240A/ja active Pending
- 1998-12-04 EP EP98962774A patent/EP1040430B1/en not_active Expired - Lifetime
- 1998-12-04 AU AU17932/99A patent/AU1793299A/en not_active Abandoned
- 1998-12-04 DE DE69840875T patent/DE69840875D1/de not_active Expired - Fee Related
- 1998-12-04 KR KR1020007006459A patent/KR20010033096A/ko not_active Ceased
- 1998-12-04 WO PCT/SE1998/002221 patent/WO1999032994A2/en not_active Ceased
- 1998-12-18 US US09/215,122 patent/US6298339B1/en not_active Expired - Lifetime
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2003228515A (ja) * | 2001-12-21 | 2003-08-15 | Agere Systems Inc | チャンク・ベースの構造を使用してリンク・リスト待ち行列を形成するための方法および装置 |
| CN116745756A (zh) * | 2021-01-29 | 2023-09-12 | 易享信息技术有限公司 | 快速跳跃列表清除 |
| JP2024504806A (ja) * | 2021-01-29 | 2024-02-01 | セールスフォース インコーポレイテッド | 高速スキップリストパージ |
| JP7661656B2 (ja) | 2021-01-29 | 2025-04-15 | セールスフォース インコーポレイテッド | 高速スキップリストパージ |
Also Published As
| Publication number | Publication date |
|---|---|
| WO1999032994A3 (en) | 1999-08-26 |
| AU1793299A (en) | 1999-07-12 |
| SE513248C2 (sv) | 2000-08-07 |
| KR20010033096A (ko) | 2001-04-25 |
| SE9704767D0 (sv) | 1997-12-19 |
| WO1999032994A2 (en) | 1999-07-01 |
| DE69840875D1 (de) | 2009-07-16 |
| SE9704767L (sv) | 1999-06-20 |
| US6298339B1 (en) | 2001-10-02 |
| EP1040430A2 (en) | 2000-10-04 |
| EP1040430B1 (en) | 2009-06-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US6910043B2 (en) | Compression of nodes in a trie structure | |
| US5664179A (en) | Modified skip list database structure and method for access | |
| US8255398B2 (en) | Compression of sorted value indexes using common prefixes | |
| CN1552032B (zh) | 数据库 | |
| US6353873B1 (en) | Apparatus and method to determine a longest prefix match in a content addressable memory | |
| US5495609A (en) | System and method for managing concurrent access to data files consisting of data entries referenced by keys comprising sequence of digits | |
| JP3771271B2 (ja) | コンパクト0完全木における順序付けられたキーの集まりの記憶と検索のための装置及び方法 | |
| EP1066570B1 (en) | Fast string searching and indexing | |
| CA2305475C (en) | Forwarding information retrieval technique | |
| JP2001527240A (ja) | データ構造内の管理 | |
| US6691131B2 (en) | Functional memory based on a trie structure | |
| JPH10504407A (ja) | データを記憶し検索する方法及びメモリ構成体 | |
| US8086641B1 (en) | Integrated search engine devices that utilize SPM-linked bit maps to reduce handle memory duplication and methods of operating same | |
| US6675171B2 (en) | Memory based on a digital trie structure | |
| CN112269784A (zh) | 一种基于硬件实现的哈希表结构以及插入、查询和删除方法 | |
| US7953721B1 (en) | Integrated search engine devices that support database key dumping and methods of operating same | |
| US7395262B1 (en) | Techniques for searching for best matches in tables of information | |
| US6223174B1 (en) | Method and apparatus for performing radix lookups using valid bit tables with pointers | |
| US20110066638A1 (en) | Bit strings search apparatus, search method, and program | |
| JP2675958B2 (ja) | 情報検索用計算機システム及びその記憶装置の動作方法 | |
| JPH10162013A (ja) | デジタル探索装置 | |
| US20110208782A1 (en) | Method and computer program product for creating ordered data structure | |
| JP4412291B2 (ja) | 記憶装置 | |
| GB2638191A (en) | Data storage | |
| CN120849406A (zh) | 数据访问及索引建立方法、设备、存储介质和程序 |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| A521 | Request for written amendment filed |
Free format text: JAPANESE INTERMEDIATE CODE: A523 Effective date: 20051205 |
|
| A621 | Written request for application examination |
Free format text: JAPANESE INTERMEDIATE CODE: A621 Effective date: 20051205 |
|
| A131 | Notification of reasons for refusal |
Free format text: JAPANESE INTERMEDIATE CODE: A131 Effective date: 20081024 |
|
| A02 | Decision of refusal |
Free format text: JAPANESE INTERMEDIATE CODE: A02 Effective date: 20090403 |