The ordered relational model is an extension of the relational model which incorporates partial orderings into data domains. We demonstrate that the ordered relational model is suitable for modelling advanced applications involving tree-structured information, incomplete information and temporal information. We describe OSQL, which is an extension of SQL for the ordered relational model, and show that OSQL combines the capabilities of standard SQL with the power of user-defined semantic orderings. The syntax of OSQL is a minimal extension of SQL and thus it should be easy for current SQL users to adapt to OSQL. Although it is a minimal extension, OSQL allows the users to formulate a wide range of queries, such as fuzzy or temporal, which ar...
In this thesis, a mathematical model that describes a “Unique Constraint Domain” is defined. Followi...
We present a formalism whose purpose is to serve as a rigid basis for describing SQL-like queries an...
In this paper, we present algorithms which allow an object-oriented querying of existing relational...
The ordered relational model is an extension of the relational model which incorporates partial orde...
Data warehousing is a corporate strategy that needs to integrate information from several sources of...
Data warehousing is a corporate strategy that needs to integrate information from several sources of...
In this thesis, we extend the relational data model to incorporate partial orderings into data domai...
In this thesis, we extend the relational data model to incorporate partial orderings into data domai...
In this thesis, we extend the relational data model to incorporate partial orderings into data domai...
We extend the relational data model to incorporate partial orderings into data domains, which we cal...
Database Management Systems (DBMS) are used by software applications, to store, manipulate, and retr...
A relation is an unordered collection of records. Often, however, there is an underlying order (e.g....
We present a formalism whose purpose is to serve as a rigid basis for describing SQL-like queries an...
: In this paper, we present algorithms which allow an object-oriented querying of existing relationa...
Abstract: In this paper, we present algorithms which allow an object-oriented querying of existing r...
In this thesis, a mathematical model that describes a “Unique Constraint Domain” is defined. Followi...
We present a formalism whose purpose is to serve as a rigid basis for describing SQL-like queries an...
In this paper, we present algorithms which allow an object-oriented querying of existing relational...
The ordered relational model is an extension of the relational model which incorporates partial orde...
Data warehousing is a corporate strategy that needs to integrate information from several sources of...
Data warehousing is a corporate strategy that needs to integrate information from several sources of...
In this thesis, we extend the relational data model to incorporate partial orderings into data domai...
In this thesis, we extend the relational data model to incorporate partial orderings into data domai...
In this thesis, we extend the relational data model to incorporate partial orderings into data domai...
We extend the relational data model to incorporate partial orderings into data domains, which we cal...
Database Management Systems (DBMS) are used by software applications, to store, manipulate, and retr...
A relation is an unordered collection of records. Often, however, there is an underlying order (e.g....
We present a formalism whose purpose is to serve as a rigid basis for describing SQL-like queries an...
: In this paper, we present algorithms which allow an object-oriented querying of existing relationa...
Abstract: In this paper, we present algorithms which allow an object-oriented querying of existing r...
In this thesis, a mathematical model that describes a “Unique Constraint Domain” is defined. Followi...
We present a formalism whose purpose is to serve as a rigid basis for describing SQL-like queries an...
In this paper, we present algorithms which allow an object-oriented querying of existing relational...