Data Record

From GM-RKB
(Redirected from Structured Data Record)
Jump to navigation Jump to search

A Data Record is a data item that represents a tuple (of data attributes according to some metadata).



References

2013

  • (Wikipedia, 2013) ⇒ http://en.wikipedia.org/wiki/Record_(computer_science)#science Retrieved:2013-11-30.
    • In computer science, records (also called tuples, structs, or compound data) [1][page needed] are among the simplest data structures. A record is a value that contains other values, typically in fixed number and sequence and typically indexed by names. The elements of records are usually called fields or members.

      For example, a date could be stored as a record containing a numeric year field, a month field represented as a string, and a numeric day-of-month field. As another example, a Personnel record might contain a name, a salary, and a rank. As yet another example, a Circle record might contain a center and a radius. In this instance, the center itself might be represented as a Point record containing x and y coordinates.

      Records are distinguished from arrays by the fact that their number of fields is typically fixed, each field has a name, and that each field may have a different type.

      A record type is a data type that describes such values and variables. Most modern computer languages allow the programmer to define new record types. The definition includes specifying the data type of each field and an identifier (name or label) by which it can be accessed. In type theory, product types (with no field names) are generally preferred due to their simplicity, but proper record types are studied in languages such as System F-sub. Since type-theoretical records may contain first-class function-typed fields in addition to data, they can express many features of object-oriented programming.

      Records can exist in any storage medium, including main memory and mass storage devices such as magnetic tapes or hard disks. Records are a fundamental component of most data structures, especially linked data structures. Many files are organized as arrays of logical records, often grouped into larger physical records or blocks for efficiency.

      The parameters of a function or procedure can often be viewed as the fields of a record variable; and the arguments passed to that function can be viewed as a record value that gets assigned to that variable at the time of the call. Also, in the call stack that is often used to implement procedure calls, each entry is an

      activation record or call frame, containing the procedure parameters and local variables, the return address, and other internal fields.

      An object in object-oriented language is essentially a record that contains procedures specialized to handle that record; and object data types (often called object classes) are an elaboration of record types. Indeed, in most object-oriented languages, records are just special cases of objects.

      A record can be viewed as the computer analog of a mathematical tuple. In the same vein, a record type can be viewed as the computer language analog of the Cartesian product of two or more mathematical sets, or the implementation of an abstract product type in a specific language.

  1. Felleisen et al., How To Design Programs, MIT Press, 2001

2013

  1. International Foundation for Information Technology, The (2010). "Definition of Record". International Foundation for Information Technology, The. http://www.if4it.com/SYNTHESIZED/GLOSSARY/R/Record.html. Retrieved September 2013. 
  2. ARMA International. "Glossary of Records and Information Management Terms, 3rd Edition". ARMA International. http://archive.arma.org/standards/glossaryw2/index.cfm?id_term=369. Retrieved September 2013. 

2009

  • ???
    • A concept about which data are to be stored in a database.
    • Representation of facts, concepts, or instructions in a formalized manner suitable for communication, interpretation or processing by humans or automatic means.
    • An instance of an entity type is data about one specific thing. E.g. a specific customer
    • Object: A fundamental element of a conceptual representation that reflects the "real world" at levels of abstraction and resolution appropriate for interoperability.
    • For any given value of time, the state of an object is defined as the enumeration of all its attribute values.
    • Anything that exists in storage and on which operations can be performed. Examples include files, programs, and arrays.
    • A Data Object is any persistent entity within a relational database that is exposed to the applications as an object. An example is a row within the "users" table.
    • Data Object: Basic definition of the Data Element. Set of ideas, abstractions, or things that can be identified with explicit business meaning
    • In a non-relational database system, a record is an entry in a file, consisting of individual elements of information, which together provide full details about an aspect of the information needed by the system. Individual elements are held in fields and all records are held in files.
    • In a relational system, record is an alternate word for row.
    • An instance of data in a table, a record is a collection of all the facts related to one physical or conceptual entity; often referring to a single object or person, usually represented as a row of data in a table, and sometimes referred to as a tuple in some, particularly older, database management systems.

2008

2005

2000

1996

  • (Wall et al., 1996) ⇒ Larry Wall, Tom Christiansen, and Randal L. Schwartz. (1996). “Programming Perl, 2nd edition." O'Reilly. ISBN:1565921496
    • QUOTE:
      • record: A set of related data values in a file or stream, often associated with a unique key field. In UNIX, often commensurate with a line, or a blank-line-delimited set of lines (a "paragraph"). Each line of the /etc/passwd file is a record, keyed on login name, containing information about that user.
      • tuple: In the lingo of relational databases, a record or line containing fields. See relation.

2024

  • (Wikipedia, 2024) ⇒ https://en.wikipedia.org/wiki/Record_(computer_science) Retrieved:2024-4-9.
    • In computer science, a record (also called a structure, struct, or compound data) is a basic data structure. Records in a database or spreadsheet are usually called "rows". A record is a collection of fields, possibly of different data types, typically in a fixed number and sequence. The fields of a record may also be called members, particularly in object-oriented programming; fields may also be called elements, though this risks confusion with the elements of a collection. For example, a date could be stored as a record containing a numeric year field, a month field represented as a string, and a numeric day-of-month field. A personnel record might contain a name, a salary, and a rank. A Circle record might contain a center and a radius—in this instance, the center itself might be represented as a point record containing x and y coordinates. Records are distinguished from arrays by the fact that their number of fields is determined in the definition of the record, and by the fact the records are a heterogenous data type; not all of the fields must contain the same type of data.

      A record type is a data type that describes such values and variables. Most modern computer languages allow the programmer to define new record types. The definition includes specifying the data type of each field and an identifier (name or label) by which it can be accessed. In type theory, product types (with no field names) are generally preferred due to their simplicity, but proper record types are studied in languages such as System F-sub. Since type-theoretical records may contain first-class function-typed fields in addition to data, they can express many features of object-oriented programming.

      Records can exist in any storage medium, including main memory and mass storage devices such as magnetic tapes or hard disks. Records are a fundamental component of most data structures, especially linked data structures. Many computer files are organized as arrays of logical records, often grouped into larger physical records or blocks for efficiency.

      The parameters of a function or procedure can often be viewed as the fields of a record variable; and the arguments passed to that function can be viewed as a record value that gets assigned to that variable at the time of the call. Also, in the call stack that is often used to implement procedure calls, each entry is an activation record or call frame, containing the procedure parameters and local variables, the return address, and other internal fields.

      An object in object-oriented language is essentially a record that contains procedures specialized to handle that record; and object types are an elaboration of record types. Indeed, in most object-oriented languages, records are just special cases of objects, and are known as plain old data structures (PODSs), to contrast with objects that use OO features.

      A record can be viewed as the computer analog of a mathematical tuple, although a tuple may or may not be considered a record, and vice versa, depending on conventions and the specific programming language. In the same vein, a record type can be viewed as the computer language analog of the Cartesian product of two or more mathematical sets, or the implementation of an abstract product type in a specific language.