Abstract: Computer-implemented methods, program products and data structures for tagging data assets are disclosed. An interface which can receive location information to identify a storage location identifier for a data asset to be saved is presented to a user. The location information for the data asset to be saved and a selection identifying a concept and a relation between the concept and the data asset to be saved are received from the user through the interface. The asset reference for the data asset to be saved is stored in a tag database and an association is created in the tag database representing the relation between the data asset to be saved and the identified concept.

Abstract: The invention improves processing time when accessing information in a byte stream and avoids the step of deserializing unneeded portions of the byte stream when the byte stream encodes an information structure corresponding to a schema with arbitrarily nested lists and tuples. It facilitates efficient keyed access when lists of tuples represent tables with key columns by storing tables in nested column order, which extends the well-known concept of column-order so as to apply to arbitrarily nested tables. Using well-known offset calculation techniques within the nested lists that result from nested column order, the invention achieves greater efficiency by grouping together all scalar information items that correspond to the same node in a tree representation of the schema.