A note on information organization and storage
Since the logical structure of a data base can be represented by a tree or graph, it is quite natural for us to view the process of designing a data base as that of constructing a tree or a graph. A general method for constructing such a tree or graph is provided. There are three important elements...
Saved in:
Published in | Communications of the ACM Vol. 16; no. 7; pp. 406 - 410 |
---|---|
Main Author | |
Format | Magazine Article |
Language | English |
Published |
New York, NY, USA
ACM
01.07.1973
|
Subjects | |
Online Access | Get full text |
ISSN | 0001-0782 1557-7317 1557-7317 |
DOI | 10.1145/362280.362285 |
Cover
Abstract | Since the logical structure of a data base can be represented by a tree or graph, it is quite natural for us to view the process of designing a data base as that of constructing a tree or a graph. A general method for constructing such a tree or graph is provided. There are three important elements in this general construction method; namely, a set of binary relations, an algorithm for constructing subsets of a set, and an algorithm for selecting an element from the given set of objects. The use of different relations and algorithms results in different information structures, as list, tree, ring, etc. Thus the problem of information organization and storage is reduced to that of defining relations and formulating algorithms under a given set of constraints. The results presented may be valuable to designers as useful design concepts, and may serve as a basis for developing a formal theory on the subject. |
---|---|
AbstractList | Since the logical structure of a data base can be represented by a tree or graph, it is quite natural for us to view the process of designing a data base as that of constructing a tree or a graph. A general method for constructing such a tree or graph is provided. There are three important elements in this general construction method; namely, a set of binary relations, an algorithm for constructing subsets of a set, and an algorithm for selecting an element from the given set of objects. The use of different relations and algorithms results in different information structures, as list, tree, ring, etc. Thus the problem of information organization and storage is reduced to that of defining relations and formulating algorithms under a given set of constraints. The results presented may be valuable to designers as useful design concepts, and may serve as a basis for developing a formal theory on the subject. |
Author | Huang, J. C. |
Author_xml | – sequence: 1 givenname: J. C. surname: Huang fullname: Huang, J. C. organization: Univ. of Houston, Houston, TX |
BookMark | eNqFUE1Lw0AUXKSCbfXowVtO3hJ3N9mvYylahYIXPYeX7UuJJLt1N0Xqrzc2xYMgnuYNb2Z482Zk4rxDQq4ZzRgrxF0uOdc0O4I4I1MmhEpVztSETCmlLKVK8wsyi_FtoFRIMSXZInG-x8S7pHG1Dx30zTD7sAXXfI4E3CaJvQ-wxUtyXkMb8eqEc_L6cP-yfEzXz6un5WKdQs7zPgVtakqltUowTa3kgKxmulAFYoXCGCHRctxoUVWiYgahkqCkpsJUlVV1PifZmLt3Ozh8QNuWu9B0EA4lo-V323JsO4IYDLejYRf8-x5jX3ZNtNi24NDvY8nN8ABT6EGYj0IbfIwB69I2_bFnH6Bp_4xPf7n-O-dm1IPtfqSn3ReZGHxj |
CitedBy_id | crossref_primary_10_1145_1095515_1095516 |
Cites_doi | 10.1145/511285.511305 10.1145/356546.356550 10.5555/540149 10.5555/260999 |
ContentType | Magazine Article |
Copyright | ACM |
Copyright_xml | – notice: ACM |
DBID | AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D ADTOC UNPAY |
DOI | 10.1145/362280.362285 |
DatabaseName | CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Unpaywall for CDI: Periodical Content Unpaywall |
DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
DatabaseTitleList | CrossRef Computer and Information Systems Abstracts |
Database_xml | – sequence: 1 dbid: UNPAY name: Unpaywall url: https://proxy.k.utb.cz/login?url=https://unpaywall.org/ sourceTypes: Open Access Repository |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Engineering Mathematics Computer Science |
EISSN | 1557-7317 |
EndPage | 410 |
ExternalDocumentID | 10.1145/362280.362285 10_1145_362280_362285 362285 |
GroupedDBID | --Z -DZ -ET -~X .4S .DC 29F 2FS 3R3 4.4 53G 5GY 5VS 6J9 85S 8US 8VB 9M8 AAIKC AAKMM AALFJ AAMNW AAWTO AAYFX ABCQX ABEFU ABPPZ ACBMB ACGFO ACGOD ACM ACNCT ADBCU ADL ADMLS AEBYY AEFXT AEGXH AEMOZ AENEX AENSD AETEA AFWIH AFWXC AGHSJ AI. AIAGR AIDUJ AIKLT AKRVB ALMA_UNASSIGNED_HOLDINGS ARCSS ASPBG AVWKF BDXCO CCLIF CS3 DU5 E.L EBS EDO EJD F5P FEDTE GUFHI HGAVV I-F I07 ICD L7B LHSKQ LXL LXN MK~ ML~ MVM P1C P2P PQQKQ QWB RNS ROL SC5 TN5 TUS UHB UKR UMC UPT VH1 WH7 XJT XOL XSW YYP ZCA ZL0 ZRQ ZY4 ~02 .GJ 1OL 4R4 77I AAFWJ AAYXX ABFSI ACTDY ADXHL AEJOY AGNAY AHQJS AKVCP BAAKF BKOMP CITATION EBE EBO EBR EBU EMK EPL FJW HF~ H~9 IAO IBB IEA IGS IMI IOF IPO ITC K1G N95 NEJ NHB OHT RWL TAE TH9 VOH XH6 YXB ZCG ZHY 7SC 8FD JQ2 L7M L~C L~D ADTOC UNPAY |
ID | FETCH-LOGICAL-a323t-a89f006cc75180c62ae1f18474eebe59956ec2ed85bb5b19eab6a768059bbc7f3 |
IEDL.DBID | UNPAY |
ISSN | 0001-0782 1557-7317 |
IngestDate | Tue Aug 19 18:17:44 EDT 2025 Fri Sep 05 14:32:15 EDT 2025 Wed Oct 01 06:03:06 EDT 2025 Thu Apr 24 22:55:25 EDT 2025 Mon May 12 16:30:29 EDT 2025 |
IsDoiOpenAccess | true |
IsOpenAccess | true |
IsPeerReviewed | false |
IsScholarly | false |
Issue | 7 |
Keywords | data base storage allocation data-base management information retrieval tree information structure file organization graph |
Language | English |
License | Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Permissions@acm.org |
LinkModel | DirectLink |
MergedId | FETCHMERGED-LOGICAL-a323t-a89f006cc75180c62ae1f18474eebe59956ec2ed85bb5b19eab6a768059bbc7f3 |
Notes | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
OpenAccessLink | https://proxy.k.utb.cz/login?url=https://dl.acm.org/doi/pdf/10.1145/362280.362285 |
PQID | 29001948 |
PQPubID | 23500 |
PageCount | 5 |
ParticipantIDs | unpaywall_primary_10_1145_362280_362285 proquest_miscellaneous_29001948 crossref_citationtrail_10_1145_362280_362285 crossref_primary_10_1145_362280_362285 acm_primary_362285 |
ProviderPackageCode | CITATION AAYXX |
PublicationCentury | 1900 |
PublicationDate | 1973-07-01 |
PublicationDateYYYYMMDD | 1973-07-01 |
PublicationDate_xml | – month: 07 year: 1973 text: 1973-07-01 day: 01 |
PublicationDecade | 1970 |
PublicationPlace | New York, NY, USA |
PublicationPlace_xml | – name: New York, NY, USA |
PublicationTitle | Communications of the ACM |
PublicationTitleAbbrev | ACM CACM |
PublicationYear | 1973 |
Publisher | ACM |
Publisher_xml | – name: ACM |
References | Flores, I. Data Structure and Management. Prentice-Hall, Englewood Cliffs, N.J., 1970. Knott, G.D. A balanced tree storage and retrieval algorithm. Proc. Symp. Inf. Storage and Retrieval, College Park, Md., Apr. 1971. 10.1145/511285.511305 Dodd, G.G. Elements of data management systems. Computing Reviews 1, 2 (June 1969), 117-133. 10.1145/356546.356550 Gorn, S. Explicit definitions and linguistic dominoes. Presented at Syst. and Comput. Sci. Conf., U. of Western Ontario, 1965. Knuth, D.E. The Art of Computer Programming, Vol. 1. Addison-Wesley, Reading, Mass., 1968, Ch.2. Nelson, R.J. Introduction to Automata. Wiley, New York, 1968, p. 46. e_1_2_1_6_2 Gorn S. (e_1_2_1_4_2) 1965 e_1_2_1_2_2 Nelson R.J. (e_1_2_1_5_2) 1968 e_1_2_1_3_2 e_1_2_1_1_2 |
References_xml | – reference: Nelson, R.J. Introduction to Automata. Wiley, New York, 1968, p. 46. – reference: Flores, I. Data Structure and Management. Prentice-Hall, Englewood Cliffs, N.J., 1970. – reference: Gorn, S. Explicit definitions and linguistic dominoes. Presented at Syst. and Comput. Sci. Conf., U. of Western Ontario, 1965. – reference: Knuth, D.E. The Art of Computer Programming, Vol. 1. Addison-Wesley, Reading, Mass., 1968, Ch.2. – reference: Knott, G.D. A balanced tree storage and retrieval algorithm. Proc. Symp. Inf. Storage and Retrieval, College Park, Md., Apr. 1971. 10.1145/511285.511305 – reference: Dodd, G.G. Elements of data management systems. Computing Reviews 1, 2 (June 1969), 117-133. 10.1145/356546.356550 – ident: e_1_2_1_6_2 doi: 10.1145/511285.511305 – ident: e_1_2_1_3_2 doi: 10.1145/356546.356550 – volume-title: Syst. and Comput. Sci. Conf., U. of Western Ontario year: 1965 ident: e_1_2_1_4_2 – ident: e_1_2_1_2_2 doi: 10.5555/540149 – volume-title: Introduction to Automata year: 1968 ident: e_1_2_1_5_2 – ident: e_1_2_1_1_2 doi: 10.5555/260999 |
SSID | ssj0000565 |
Score | 1.1483512 |
Snippet | Since the logical structure of a data base can be represented by a tree or graph, it is quite natural for us to view the process of designing a data base as... |
SourceID | unpaywall proquest crossref acm |
SourceType | Open Access Repository Aggregation Database Enrichment Source Index Database Publisher |
StartPage | 406 |
SubjectTerms | Information systems Information systems / Data management systems Information systems / Data management systems / Database design and models Information systems / Information storage systems Information systems / Information storage systems / Record storage systems Information systems / Information storage systems / Record storage systems / Directory structures Information systems / Information storage systems / Record storage systems / Directory structures / B-trees Mathematics of computing Mathematics of computing / Discrete mathematics Mathematics of computing / Discrete mathematics / Graph theory Mathematics of computing / Discrete mathematics / Graph theory / Graph algorithms Mathematics of computing / Discrete mathematics / Graph theory / Trees |
SubjectTermsDisplay | Information systems Information systems / Data management systems Information systems / Data management systems / Database design and models Information systems / Information storage systems Information systems / Information storage systems / Record storage systems Information systems / Information storage systems / Record storage systems / Directory structures Information systems / Information storage systems / Record storage systems / Directory structures / B-trees Mathematics of computing Mathematics of computing / Discrete mathematics Mathematics of computing / Discrete mathematics / Graph theory Mathematics of computing / Discrete mathematics / Graph theory / Graph algorithms Mathematics of computing / Discrete mathematics / Graph theory / Trees |
Title | A note on information organization and storage |
URI | https://dl.acm.org/doi/10.1145/362280.362285 https://www.proquest.com/docview/29001948 https://dl.acm.org/doi/pdf/10.1145/362280.362285 |
UnpaywallVersion | publishedVersion |
Volume | 16 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT9tAEB6F5FC4pOEhUl57qMqlDvFjX8eIFiFEUKsSCU7W7nr3QmJHxRGiv76z2E4DUhGcLEuzI3tnZ2dGM_MNwGcdMcuVD0s4t0HiwiQQiZVBRB2jPOYYMvh-5_EVO58kFzf0pgXDphcmmyKf2VMK3-v0PHM1oC09was2Ehhk-gddgw7zKaU2dCZXP0a3lZeLkTF_mg-FVpIHHG1jA6v5cr03Rmb23Bj98zA_LPK5enxQ0-mKsTnrws_mM6sak7vBotQD8-cFguN7_uMjdBskaTKqzkoPWjbfhG4z1oHUWr4JGysYhfg2XgK73m_BYETyorSkyEkNueoFS4qVjk6i8oz4mku8qbZhcvb9-vQ8qEcuBCqO4jJQQjrUQ2N8NmZoWKRs6DAI5IlFaXtwMmZNZDNBtaY6lFZppjBiQSdNa8NdvAPtvMjtLhAmGXeKZi5xMnHCykyoUEgmfGsvM1EferhD6bwC1Uir7ejD10YgqalByv2sjGlaNVDTim64JP-yJG8Y_YfwqJFuivrjkyIqt8XiPo2k93IT0YfjpdBf5_XpzZR7sB5KHlfVvfvQLn8v7AH6MKU-hM7o2_jy12F9fP8C6M3kwA |
linkProvider | Unpaywall |
linkToUnpaywall | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8RADA66HtTL-sT1OQfRi123j3kdF1FEUBRc0FOZmc5cXNtFu4j-ejO2XVdB0VMpZEI7mUwSknwB2NcRs1z5sIRzGyQuTAKRWBlE1DHKY44hg-93vrxi54Pk4o7ezUCv6YXJhsjn8SOF73V6lLka0JYe41UbCQwy_YPOwhzzKaUWzA2urvv3lZeLkTH_mA-FVpIHHG1jA6v5fb03RubxqzH69DDnx_lIvb6o4XDK2Jy14ab5zKrG5KE7LnXXvH1DcPzPfyxBu0GSJv3qrCzDjM1XoN2MdSC1lq_A4hRGIb5dToBdn1eh2yd5UVpS5KSGXPWCJcVURydReUZ8zSXeVGswODu9PTkP6pELgYqjuAyUkA710BifjekZFikbOgwCeWJR2h6cjFkT2UxQrakOpVWaKYxY0EnT2nAXr0MrL3K7AYRJxp2imUucTJywMhMqFJIJ39rLTNSBZdyhdFSBaqTVdnTgqBFIamqQcj8rY5hWDdS0outNyA8m5A2jHwj3GummqD8-KaJyW4yf00h6LzcRHTicCP13Xpt_ptyChVDyuKru3YZW-TS2O-jDlHq3Prbvyq_jLA |
openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+note+on+information+organization+and+storage&rft.jtitle=Communications+of+the+ACM&rft.au=Huang%2C+J.+C.&rft.date=1973-07-01&rft.pub=ACM&rft.issn=0001-0782&rft.eissn=1557-7317&rft.volume=16&rft.issue=7&rft.spage=406&rft.epage=410&rft_id=info:doi/10.1145%2F362280.362285&rft.externalDocID=362285 |
thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0001-0782&client=summon |
thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0001-0782&client=summon |
thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0001-0782&client=summon |