Scinovex
article Open Access

Analysis of data structures of unified algebra

Abstract

For contrast, a set represents a collection of objects in a package or container. The contents of a set is a bunch. These vague descriptions are made precise as follows. A data structure is a collection, or aggregate, of data. The kinds of structuring we consider are packaging and indexing. These two kinds of structure give us four data structures.1.unpackaged, unindexed: bunch2.packaged, unindexed: set3.unpackaged, indexed: string4.packaged, indexed: listAny binary or number is an elementary bunch, or element.

Formal Methods in VerificationLogic, programming, and type systemsData Management and AlgorithmsSearch engine indexingContainer (type theory)Set (abstract data type)Computer scienceAggregate (composite)Data structureStructuringInformation retrievalMathematicsEngineering
Citations
0
FWCI
0.00
field-weighted impact
References
3
Percentile
19%
vs. same field & year
Citation Network

How this paper connects to the literature. Drag to explore, click any node to open that paper.

Analysis of data structures of unified algebra · Scinovex