A Relational Algebra for Basic Terms in a Higher-Order Logic: Technical Report CSTR-13-004

Research output: Working paperWorking paper and Preprints

183 Downloads (Pure)

Abstract

We define a relational algebra on basic terms, strongly typed terms in a higher-order logic, that are well suited to the representation of heterogeneous data, irrespective of whether the data originated from relational, unstructured, semi-structured or structured sources. This higher-order generalisation of the relational model has potential applications in NoSQL databases and Big Variety, Big Data applications.
Original languageEnglish
PublisherUniversity of Bristol
Number of pages17
VolumeCSTR-13-004
Publication statusPublished - Jul 2013

Structured keywords

  • Jean Golding

Keywords

  • Database
  • Big Data
  • heterogeneous data
  • Logic

Fingerprint Dive into the research topics of 'A Relational Algebra for Basic Terms in a Higher-Order Logic: Technical Report CSTR-13-004'. Together they form a unique fingerprint.

Cite this