Tables as a paradigm for querying and restructuring (extended abstract)

Published 3 June 1996

Marc Gyssens, Laks V. S. Lakshmanan, Iyer N. Subramanian

Citations38

TL;DR

The tabular database model is proposed for handling a broad class of natural data representations and tabular algebra is developed as a language for querying and restructuring tabular data.

Abstract

Article Tables as a paradigm for querying and restructuring (extended abstract) Share on Authors: Marc Gyssens Dept. WNI, University of Limburg, B-3590 Diepenbeek, Belgium Dept. WNI, University of Limburg, B-3590 Diepenbeek, BelgiumView Profile , Laks V. S. Lakshmanan Dept. of Computer Science, Concordia University, Montreal, Quebec, Canada Dept. of Computer Science, Concordia University, Montreal, Quebec, CanadaView Profile , Iyer N. Subramanian Dept. of Computer Science, Concordia University, Montreal, Quebec, Canada Dept. of Computer Science, Concordia University, Montreal, Quebec, CanadaView Profile Authors Info & Claims PODS '96: Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systemsJune 1996 Pages 93–103https://doi.org/10.1145/237661.237688Published:03 June 1996 34citation394DownloadsMetricsTotal Citations34Total Downloads394Last 12 Months3Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access

Keywords

Computer ScienceDecision Sciences

Journal of Computer and System SciencesComputable queries for relational data bases

440 Citations1980Ashok K. Chandra, David Harel

The main result is the completeness of a simple programming language which can be thought of as consisting of the relational algebra augmented with the power of iteration.

ACM SIGMOD RecordObject identity as a query language primitive

363 Citations1989Serge Abiteboul, Paris C. Kanellakis

View PDF

A graph-oriented object database model

129 Citations1990Marc Gyssens, Jan Paredaens +1 more

A simple, graph-oriented database model, supporting object-identity, is presented and it is shown that the transformation language supports both set-operations (except for the powerset operator) and recursive functions.

View PDF

Lecture notes in computer scienceOn the logical foundations of schema integration and evolution in heterogeneous database systems

78 Citations1993Laks V. S. Lakshmanan, Fereidoon Sadri +1 more

A fixpoint theory as well as a sound and complete proof theory for the definite clause fragment of SchemaLog are developed and shown their equivalence to the model-theoretic semantics.

Medical Entomology and ZoologyMultidatabase Systems: An Advanced Solution for Global Information Sharing

57 Citations1993Ali R. Hurson, M. W. Bright +1 more

A tutorial comprising reprinted papers that explore issues associated with multidatabases and present the current status of work in the field.

Tables As a Paradigm for Querying and Restructuring

51 Citations1996Marc Gyssens, Laks V. S. Lakshmanan +1 more

The Journal of Logic ProgrammingLogic and algebraic languages for interoperability in multidatabase systems

41 Citations1997Laks V. S. Lakshmanan, Fereidoon Sadri +1 more

A simple logic called SchemaLog which is syntactically higher-order but has a first-order semantics, and an extension to classical relational algebra, capable of retrieving and manipulating data and schema from databases in a multidatabase system, is proposed.

Journal of the ACMOn the completeness of object-creating database transformation languages

35 Citations1997Jan Van den Bussche, Dirk Van Gucht +2 more

It is shown that the constructive transformations are precisely the transformations that can be expressed in said extensions of complete standard languages, which are not complete for the determinate transformations.

View PDF

On the completeness of object-creating query languages

24 Citations1992Jan Van den Bussche, Dirk Van Gucht +2 more

This paper provides a precise characterization for the class of queries that can be expressed in database query languages and motivates this class the constructive queries by establishing a close correspondence between object creation and the construction of hereditarily finite sets.

Journal of Computer and System SciencesOn Instance-Completeness for Database Query Languages involving Object Creation

7 Citations1996Marc Andries, Jan Paredaens

This paper uses the graph-oriented object database model GOOD as a framework to propose an alternative formulation of the BP-completeness criterion, adapted to the context of languages involving object creation.