SE9704767L - Hantering i datastrukturer - Google Patents

Hantering i datastrukturer

Info

Publication number
SE9704767L
SE9704767L SE9704767A SE9704767A SE9704767L SE 9704767 L SE9704767 L SE 9704767L SE 9704767 A SE9704767 A SE 9704767A SE 9704767 A SE9704767 A SE 9704767A SE 9704767 L SE9704767 L SE 9704767L
Authority
SE
Sweden
Prior art keywords
records
symbols
data structures
sequences
management
Prior art date
Application number
SE9704767A
Other languages
English (en)
Other versions
SE9704767D0 (sv
SE513248C2 (sv
Inventor
Stefan Bjoernson
Original Assignee
Ericsson Telefon Ab L M
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 Ericsson Telefon Ab L M filed Critical Ericsson Telefon Ab L M
Priority to SE9704767A priority Critical patent/SE513248C2/sv
Publication of SE9704767D0 publication Critical patent/SE9704767D0/sv
Priority to JP2000525830A priority patent/JP2001527240A/ja
Priority to KR1020007006459A priority patent/KR20010033096A/ko
Priority to PCT/SE1998/002221 priority patent/WO1999032994A2/en
Priority to AU17932/99A priority patent/AU1793299A/en
Priority to EP98962774A priority patent/EP1040430B1/en
Priority to DE69840875T priority patent/DE69840875D1/de
Priority to US09/215,122 priority patent/US6298339B1/en
Publication of SE9704767L publication Critical patent/SE9704767L/sv
Publication of SE513248C2 publication Critical patent/SE513248C2/sv

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/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)
SE9704767A 1997-12-19 1997-12-19 Metod för hantering av datastrukturer SE513248C2 (sv)

Priority Applications (8)

Application Number Priority Date Filing Date Title
SE9704767A SE513248C2 (sv) 1997-12-19 1997-12-19 Metod för hantering av datastrukturer
JP2000525830A JP2001527240A (ja) 1997-12-19 1998-12-04 データ構造内の管理
KR1020007006459A KR20010033096A (ko) 1997-12-19 1998-12-04 데이터 구조의 관리
PCT/SE1998/002221 WO1999032994A2 (en) 1997-12-19 1998-12-04 Management in data structures
AU17932/99A AU1793299A (en) 1997-12-19 1998-12-04 Management in data structures
EP98962774A EP1040430B1 (en) 1997-12-19 1998-12-04 Management in data structures
DE69840875T DE69840875D1 (de) 1997-12-19 1998-12-04 Verwaltung von datenstrukturen
US09/215,122 US6298339B1 (en) 1997-12-19 1998-12-18 Management in data structures

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
SE9704767A SE513248C2 (sv) 1997-12-19 1997-12-19 Metod för hantering av datastrukturer

Publications (3)

Publication Number Publication Date
SE9704767D0 SE9704767D0 (sv) 1997-12-19
SE9704767L true SE9704767L (sv) 1999-06-20
SE513248C2 SE513248C2 (sv) 2000-08-07

Family

ID=20409473

Family Applications (1)

Application Number Title Priority Date Filing Date
SE9704767A SE513248C2 (sv) 1997-12-19 1997-12-19 Metod för hantering av datastrukturer

Country Status (8)

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

Families Citing this family (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
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
US7249149B1 (en) 1999-08-10 2007-07-24 Washington University Tree bitmap data structures and their use in performing lookup operations
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
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
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
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
US7415472B2 (en) * 2003-05-13 2008-08-19 Cisco Technology, Inc. Comparison tree data structures of particular use in performing lookup operations
US7415463B2 (en) * 2003-05-13 2008-08-19 Cisco Technology, Inc. Programming tree data structures and handling collisions while 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)

* 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
US5787430A (en) * 1994-06-30 1998-07-28 International Business Machines Corporation Variable length data sequence backtracking a trie structure
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

Also Published As

Publication number Publication date
SE9704767D0 (sv) 1997-12-19
WO1999032994A3 (en) 1999-08-26
US6298339B1 (en) 2001-10-02
DE69840875D1 (de) 2009-07-16
EP1040430A2 (en) 2000-10-04
WO1999032994A2 (en) 1999-07-01
JP2001527240A (ja) 2001-12-25
AU1793299A (en) 1999-07-12
KR20010033096A (ko) 2001-04-25
EP1040430B1 (en) 2009-06-03
SE513248C2 (sv) 2000-08-07

Similar Documents

Publication Publication Date Title
SE9704767L (sv) Hantering i datastrukturer
Valentine et al. Fossils, molecules and embryos: new perspectives on the Cambrian explosion
Rigato et al. The great chain of being is still here
Becerra Timing the origin and expansion of the Mexican tropical dry forest
BR9907227A (pt) Estrutura de dados em um suporte de armazenamento, ìndice em camadas,processo para construir um ìndice em camadas distribuìdo em blocos em um sistema de gerenciamento de arquivos de base de dados, processos para construir um ìndice sobre as chaves dos registros de dados, para acessar um registro de dados pesquisado r pela chave k no ìndice em camadas, para inserir um registro de dados r pela chave k no ìndice em camadas, e para suprimir um registro de dados r pela chave k no ìndice em camadas, sistema de processamento de dados, processos para inserir um novo registro de dados em um arquivo paif existente, e para obter um ìndice paif balanceado, e, suporte de armazenamento usado por um sistema de gerenciamento de arquivos de base de dados
BR9912015A (pt) Sistema de pesquisa para recuperação de informações, processo para recuperação de informações em um sistema de pesquisa, e, uso de um sistema de pesquisa
CA2524033A1 (en) Methods and systems for joining database tables using indexing data structures
Jarzembowski et al. Insect origination and extinction in the Phanerozoic
ATE164696T1 (de) Dateisystem mit erweiterten attributen
WO2005103882A3 (en) Data structure for a hardware database management system
NO20014399L (no) En datastruktur og lagrings- og hentemetode som stötter ordinal-tallbasert datasöking og henting
JP2001527240A5 (sv)
Kaiser et al. The taxonomic history of Indo-Papuan groundsnakes, genus Stegonotus Duméril et al., 1854 (Colubridae), with some taxonomic revisions and the designation of a neotype for S. parvus (Meyer, 1874)
WO2003083720A3 (en) Database searching method and system
Simon Sequence comparison: some theory and some practice
Jagatap et al. The complete mitogenome of the springtail Tullbergia bisetosa: a subterranean springtail from the sub-Antarctic region
Ayad et al. Longest property-preserved common factor
CN100426285C (zh) 依照时间顺序和优先权顺序组织和跟踪信息的方法
CN116010422A (zh) 一种基于数据依赖的数据处理方法及装置
Shrawankar et al. Prefix matching for keystroke minimization using B+ tree
Framinan Efficient heuristic approaches to transform job shops into flow shops
CN101009058A (zh) 用数字来标识地理位置
Pratt Alperin, Lynn M.," Custodians of the Coast: History of the United States Army Engineers at Galveston"(Book Review)
Owen The Selfish Gene, by Richard Dawkins. Oxford University Press, London: vii+ 224 pp., 14.2× 22.2+ 2.5 cm,£ 2.95, 1976.
Williams et al. Ethnic assimilation and pluralism in Nebraska.

Legal Events

Date Code Title Description
NUG Patent has lapsed