JPH0384671A - Pointer array data storing/retrieving system - Google Patents

Pointer array data storing/retrieving system

Info

Publication number
JPH0384671A
JPH0384671A JP1222052A JP22205289A JPH0384671A JP H0384671 A JPH0384671 A JP H0384671A JP 1222052 A JP1222052 A JP 1222052A JP 22205289 A JP22205289 A JP 22205289A JP H0384671 A JPH0384671 A JP H0384671A
Authority
JP
Japan
Prior art keywords
pointer
pointers
chain
data storage
pointer array
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
JP1222052A
Other languages
Japanese (ja)
Inventor
Ryuichi Takahashi
隆一 高橋
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.)
NEC Corp
Original Assignee
NEC Corp
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 NEC Corp filed Critical NEC Corp
Priority to JP1222052A priority Critical patent/JPH0384671A/en
Publication of JPH0384671A publication Critical patent/JPH0384671A/en
Pending legal-status Critical Current

Links

Landscapes

  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

PURPOSE:To facilitate the dynamic change of a pointer array chain by using the chain of pointer arrays containing a pointer which points the data store unit and other pointers. CONSTITUTION:The data store units D1-Dn are pointed by the pointers Q1-Qn of a pointer array. The respective pointers Q1,Q2-Qn point the following pointers via the pointers R1,R2-Rn to form a chain of pointer arrays. Thus it is not required to successively arrange the units D1,D2-Dn and the dynamic change of the change is facilitated. At the same time, it is not required to set all pointers Q1,Q2-Qn forming a chain at the units D1,D2-Dn. Then the memory areas are not required for the pointers Q1,Q2-Qn for each data.

Description

【発明の詳細な説明】 〔産業上の利用分野〕 本発明は、データの格納単位が動的に変化するヂ１イン
を成す場合にこの格納単位を効率よく格納し、検索する
方式に関する。DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to a system for efficiently storing and retrieving data storage units when the data storage units form dynamically changing units.

〔従来の技術） 従来は、第２図に示すように、データの格納単位Ｄ１．
Ｄ２．Ｄ３．・・・、Ｄｎを順に並べることによってチ
ェインを構成する、あるいは、第３図に示すように、各
データの格納単位Ｄ１．Ｄ２゜Ｄ　３．・・・、Ｄｎに
、次の格納単位へのポインタＰ１゜Ｐ２．Ｐ３．・・・
、Ｐｎを添えてチェインを構成するなどしていた。[Prior Art] Conventionally, as shown in FIG. 2, data storage units D1.
D2. D3. . . , Dn are arranged in order to form a chain, or as shown in FIG. 3, each data storage unit D1 . D2゜D 3. ..., Dn is a pointer to the next storage unit P1゜P2 . P3. ...
, Pn were added to form a chain.

〔発明が解決しようとする課題〕[Problem to be solved by the invention]

上述した従来の格納検索方式では、格納単位を順に並べ
ることによってチェインを構成した場合は動的にチェイ
ンを変化させることが困難であり、各データ単位に次の
格納単位へのポインタを添えてチェインを構成した場合
はすべてのデータ単位にポインタのためのメモリ領域を
要するという欠点があった。In the conventional storage retrieval method described above, if a chain is constructed by arranging storage units in order, it is difficult to dynamically change the chain. When configured, there was a drawback that a memory area for a pointer was required for every data unit.

本発明の目的は、動的なチェインの変化が容易で、しか
もチェインを構成するためのポインタをすべてのデータ
の格納単位においておく必要がｉいポインタアレイデー
タ格納検索方式を提供することである。SUMMARY OF THE INVENTION An object of the present invention is to provide a pointer array data storage and retrieval method that allows easy dynamic chain changes and does not require pointers for configuring the chain to be stored in all data storage units.

（課題を解決するためのｆ段〕 本発明のポインタアレイデータ格納検索方式は、データ
格納単位へのポインタと他のポインタへのポインタを有
するポインタアレイのチェインを用いてデータ格納単位
のヂ１インの構成を表現する。(F stages for solving the problem) The pointer array data storage retrieval method of the present invention uses a chain of pointer arrays each having a pointer to a data storage unit and a pointer to another pointer. express the composition of

〔作用〕[Effect]

したがって、データの格納単位を順に並べる必要がない
ため、動的なチェインの変化が容易であり、またチェイ
ンを構成するためのポインタをすべてのデータの格納単
位においておく必要がないため、データ単位にポインタ
のためのメモリ領域が不要になる。Therefore, since there is no need to arrange the data storage units in order, it is easy to dynamically change the chain, and there is no need to keep pointers for configuring the chain in all data storage units. Memory area for pointers is no longer required.

〔実施例〕〔Example〕

次に、本発明の実施例について図面を参照して説明する
。Next, embodiments of the present invention will be described with reference to the drawings.

第１図は本発明の一実施例のポインタアレイデータ格納
検索方式の概念図である。FIG. 1 is a conceptual diagram of a pointer array data storage and retrieval method according to an embodiment of the present invention.

データの格納単位Ｄ１．Ｄ２．〜．Ｄｎはポインタアレ
イのポインタＱ１．Ｑ２．〜Ｑｎからポインタされ、個
々のポインタはそのポインタＲ１゜Ｒ２，〜、Ｒｎを用
いて次のポインタをボインチすることによりポインタア
レイのチェインを構成する。Data storage unit D1. D2. ~． Dn is the pointer Q1. of the pointer array. Q2. .about.Qn, and each pointer constructs a chain of pointer arrays by using its pointer R1°R2, .about., Rn to point to the next pointer.

（発明の効果） 以上説明したように本発明は、データの格納単位へのポ
インタと他のポインタへのポインタを有するポインタア
レイのチェインを用いることにより、動的なチェインの
変化が容易でしかもチェインを構成するためのポインタ
をすべてのデータの格納単位においておく必要がないた
め多くの領域を要さないという効果がある。(Effects of the Invention) As explained above, the present invention uses a chain of pointer arrays having pointers to data storage units and pointers to other pointers, thereby making it easy to dynamically change the chain. Since there is no need to store pointers for configuring the data in the storage unit of all data, there is an effect that a large area is not required.

【図面の簡単な説明】[Brief explanation of drawings]

第１図は本発明の一実施例のポインタアレイデータ格納
検索方式の概念図、第２図、３図は従来のデータ格納検
索方式の概念図である。 Ｄｌ、Ｄ２．Ｄ３．〜．Ｄｎ　−・・データの格納単位
、 Ｐｌ、Ｒ２，Ｒ３，〜、Ｐｎ　、Ｑｌ、Ｑ２゜Ｑ３．〜
．Ｑｎ・・・他の格納単位のポインタ、Ｒ１、Ｒ２，Ｒ
３，〜、　Ｒｎ　−データの格納単位へのポインタ。 特１許出願人　ｔｉ本電気株式会社 代　浬　人　　ブＦ理十　内　原　　昔第 図 第 図FIG. 1 is a conceptual diagram of a pointer array data storage and retrieval system according to an embodiment of the present invention, and FIGS. 2 and 3 are conceptual diagrams of conventional data storage and retrieval systems. Dl, D2. D3. ~． Dn - Data storage unit, Pl, R2, R3, ~, Pn, Ql, Q2゜Q3. ~
．． Qn...Pointer to other storage units, R1, R2, R
3, ~, Rn - Pointer to the storage unit of data. Patent No. 1 Applicant: TI Hon Electric Co., Ltd., Akihito, BUF Riju, Hara Uchi

Claims (1)

【特許請求の範囲】[Claims] １、データの格納単位へのポインタと他のポインタへの
ポンイタを有するポインタアレイのチェインを用いるこ
とによるポインタアレイデータ格納検索方式。1. A pointer array data storage and retrieval method using a chain of pointer arrays having pointers to data storage units and pointers to other pointers.
JP1222052A 1989-08-28 1989-08-28 Pointer array data storing/retrieving system Pending JPH0384671A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP1222052A JPH0384671A (en) 1989-08-28 1989-08-28 Pointer array data storing/retrieving system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP1222052A JPH0384671A (en) 1989-08-28 1989-08-28 Pointer array data storing/retrieving system

Publications (1)

Publication Number Publication Date
JPH0384671A true JPH0384671A (en) 1991-04-10

Family

ID=16776346

Family Applications (1)

Application Number Title Priority Date Filing Date
JP1222052A Pending JPH0384671A (en) 1989-08-28 1989-08-28 Pointer array data storing/retrieving system

Country Status (1)

Country Link
JP (1) JPH0384671A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2006136873A (en) * 2004-10-13 2006-06-01 Fukusuke Kogyo Kk Fog generator for air conditioning

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2006136873A (en) * 2004-10-13 2006-06-01 Fukusuke Kogyo Kk Fog generator for air conditioning

Similar Documents

Publication Publication Date Title
EP0066061A2 (en) Relational algebra engine
WO2002003190A8 (en) System for linking data cells through permutation
van Kreveld et al. Divided kd trees
CA2434081A1 (en) Data structures utilizing objects and pointers in the form of a tree structure
KR950025840A (en) Multi-Bank Synchronous Memory System with Cascaded Memory Cell Structure
JPH0236417A (en) First-in first-out type semiconductor memory
KR20210024751A (en) Graph processing system including different kind memory device and an operation method thereof
CN107741947B (en) Method for storing and acquiring random number key based on HDFS file system
US20030163475A1 (en) In-place dynamically re-sizeable persistent historical database
KR940024603A (en) Video data storage device and method
JPH0384671A (en) Pointer array data storing/retrieving system
CN102207964A (en) Real-time massive data index construction method and system
EP0459703B1 (en) Content addressable memory
US20040049485A1 (en) Method for storing data, method for reading data, apparatus for storing data and apparatus for reading data
WO1999003105A1 (en) Memory device having selectable redundancy for high endurance and reliability and method therefor
KR950001477A (en) Memory circuit
CA2352342A1 (en) A digital memory structure and device, and methods for the management thereof
JPH02289005A (en) Alignment processing system for count information
Otoo et al. Using chunked extendible array for physical storage of scientific datasets
JPS6061842A (en) Access system of structure memory
van Kreveld et al. 3 É. Department of Computer Science
JPS59178669A (en) Storage device provided with three-dimensional memory module
JP2680010B2 (en) Hash bit array configuration method
US20060156089A1 (en) Method and apparatus utilizing defect memories
JPH02257230A (en) How to manage 2D image memory