JPS648448A - Expression system for tree structure data - Google Patents

Expression system for tree structure data

Info

Publication number
JPS648448A
JPS648448A JP62162317A JP16231787A JPS648448A JP S648448 A JPS648448 A JP S648448A JP 62162317 A JP62162317 A JP 62162317A JP 16231787 A JP16231787 A JP 16231787A JP S648448 A JPS648448 A JP S648448A
Authority
JP
Japan
Prior art keywords
node
data
flag
field
slave
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
JP62162317A
Other languages
Japanese (ja)
Inventor
Tadashi Hirose
Kazuo Nakao
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.)
Hitachi Ltd
Original Assignee
Hitachi Ltd
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 Hitachi Ltd filed Critical Hitachi Ltd
Priority to JP62162317A priority Critical patent/JPS648448A/en
Publication of JPS648448A publication Critical patent/JPS648448A/en
Pending legal-status Critical Current

Links

Abstract

PURPOSE:To omit the address saving of node data even for the copying of a part of tree structure data and to efficiently execute copy processing by storing the length of node data for all nodes and setting up the arrangement order of node data in accordance with depth priority. CONSTITUTION:Node data consist of a node value field 13 and a partial tree size field 14. The data of the low-order partial tree of a node named (f) are expressed by 6 continuous node data. Or, the node data are constituted of a node value field 13, a node classification field 15, a leading slave node flag 16, and a terminal node flag 17, whether the node has a slave node or not is indicated by the flag 15, whether the slave node is the 1st slave node of the high-order field or not is indicated by the flag 16 and whether the slave node is the final node of the upper field or not is indicated by the flag 17. In said constitution, the copy processing of tree structure data can be efficiently processed without saving the address of the node data corresponding to the slave node.
JP62162317A 1987-07-01 1987-07-01 Expression system for tree structure data Pending JPS648448A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP62162317A JPS648448A (en) 1987-07-01 1987-07-01 Expression system for tree structure data

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP62162317A JPS648448A (en) 1987-07-01 1987-07-01 Expression system for tree structure data

Publications (1)

Publication Number Publication Date
JPS648448A true JPS648448A (en) 1989-01-12

Family

ID=15752227

Family Applications (1)

Application Number Title Priority Date Filing Date
JP62162317A Pending JPS648448A (en) 1987-07-01 1987-07-01 Expression system for tree structure data

Country Status (1)

Country Link
JP (1) JPS648448A (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH09138762A (en) * 1995-11-14 1997-05-27 Nec Software Ltd Memory developing method for tree structure table
WO2006001241A1 (en) * 2004-06-23 2006-01-05 Turbo Data Laboratories Inc. Node inserting method, device, and program
WO2006038498A1 (en) * 2004-10-01 2006-04-13 Turbo Data Laboratories Inc. Arrangement generation method and arrangement generation program
WO2006080268A1 (en) * 2005-01-25 2006-08-03 Turbo Data Laboratories Inc. Tree search, totalizing, sort method, information processing device, and tree search, totalizing, and sort program

Cited By (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH09138762A (en) * 1995-11-14 1997-05-27 Nec Software Ltd Memory developing method for tree structure table
WO2006001241A1 (en) * 2004-06-23 2006-01-05 Turbo Data Laboratories Inc. Node inserting method, device, and program
JPWO2006001241A1 (en) * 2004-06-23 2008-07-31 株式会社ターボデータラボラトリー Node insertion method, information processing apparatus, and node insertion program
JP4681555B2 (en) * 2004-06-23 2011-05-11 株式会社ターボデータラボラトリー Node insertion method, information processing apparatus, and node insertion program
WO2006038498A1 (en) * 2004-10-01 2006-04-13 Turbo Data Laboratories Inc. Arrangement generation method and arrangement generation program
JP4712718B2 (en) * 2004-10-01 2011-06-29 株式会社ターボデータラボラトリー Array generation method and array generation program
KR101254544B1 (en) * 2004-10-01 2013-04-19 가부시키가이샤 터보 데이터 라보라토리 Arrangement generation method and recording medium storing computer program for excuting the same
WO2006080268A1 (en) * 2005-01-25 2006-08-03 Turbo Data Laboratories Inc. Tree search, totalizing, sort method, information processing device, and tree search, totalizing, and sort program
JPWO2006080268A1 (en) * 2005-01-25 2008-08-07 株式会社ターボデータラボラトリー Tree search, aggregation, and sorting method, information processing device, and tree search, aggregation, and sorting program
JP4653157B2 (en) * 2005-01-25 2011-03-16 株式会社ターボデータラボラトリー Tree search, aggregation, sorting method, information processing apparatus, and tree search, aggregation, sorting program
US7937399B2 (en) 2005-01-25 2011-05-03 Turbo Data Laboratories, Inc. Method, information processing apparatus, and program of searching for, aggregating and sorting trees

Similar Documents

Publication Publication Date Title
BR7901939A (en) PROCESSING IN PROCESS TO SEPARATE NORMAL SCREWS FROM THE MIXTURE WITH STANDARD SCREWS
ES546472A0 (en) A DATA PROCESSING PROVISION
KR850700279A (en) Computer and its improvement
JPS5611532A (en) Computer control system
DE2966118D1 (en) Process for modifying starch and pregelatinized modified starch for use in instant puddings
JPS648448A (en) Expression system for tree structure data
EP0400820A3 (en) Content addressable memory
JPS6415826A (en) System for designating transfer register of microprogram
JPS5318931A (en) Information processor
JPS6428756A (en) Buffer control system
JPS6421554A (en) Migration control system
JPS5282035A (en) Data processing unit
JPS6435593A (en) Character lithographing system
FI870951A0 (en) ANORDNING VID ETT FARTYG FOER UPPSAMLING AV OLJA ELLER ANDRA FOERORENINGAR FRAON VATTENYTAN.
JPS57153356A (en) Auxiliary storage controller
JPS56111961A (en) Data file control device
JPS5621230A (en) Character processing unit
JPS6462724A (en) Information inquiry processing system
JPS5786970A (en) Doubled computer system
JPS6418858A (en) Storing control system
JPS55157064A (en) Word memory system
JPS5498125A (en) Control storage unit of computer
Ingram et al. Effects of industrial wastes on stream life
JPS54127647A (en) Microprogram control system
JPS5621238A (en) Address calculation processing system