GCH-OSQL: a temporally-oriented object-oriented query language based on a three-valued logic

Author(s):  
C. Combi ◽  
G. Cucchi
1998 ◽  
Vol 07 (03) ◽  
pp. 341-371 ◽  
Author(s):  
STANLEY Y. W. SU ◽  
HSIN-HSING M. CHEN

There has been a considerable amount of work on object-oriented databases, active databases, and deductive databases. The common objective of these efforts is to produce highly intelligent and active systems for supporting the next generation of database applications. These future systems must be capable of capturing the concepts of time and managing not just temporal data but temporal knowledge expressed by knowledge rules. In this paper, we describe our efforts on a temporal object-oriented knowledge model, OSAM*/T, its associated temporal query language, OQL/T, an underlying temporal algebra, TA-algebra, and some implementation techniques. In addition to the features of the traditional object-oriented paradigm, the model is characterized by its strong support of association types and its incorporation of temporal knowledge rules for specifying temporal and other types of semantic constraints associated with object classes and their temporal object instances. The query language is featured by its pattern-based specification of temporal object associations, which allows complex queries with various time constraints to be formulated in a relatively simple way. The temporal algebra provides a set of primitive operators for manipulating homogeneous and/or heterogeneous patterns of temporal object associations, thus providing the needed mathematical foundation for processing and optimizing temporal queries. The implementation techniques include a Delta-Instance and Multi-Snapshot Storage Model, as well as data partitioning and clustering schemes for storage management of temporal knowledge bases.


2003 ◽  
Vol 2 (3) ◽  
pp. 113 ◽  
Author(s):  
Wook-Shin Han ◽  
Ki-Hoon Lee ◽  
Byung Suk Lee

2005 ◽  
Vol 19 (1) ◽  
pp. 43-74 ◽  
Author(s):  
Roger S. Debreceny ◽  
Paul L. Bowen

Object-oriented (OO) advocates assert that concepts such as generalization-specialization hierarchies (GSHs) and abstract data types (ADTs) make information systems more usable by increasing the level of abstraction of the data structure. This study analyzes the effects of GSHs and ADTs on the performance of end-users of accounting information systems. Two groups of experimental participants interactively developed Structured Query Language (SQL) queries to answer ten business questions. The control group (n = 28) used data stored in a traditional relational schema. The experimental group (n = 31) used the same data stored in an OO schema that included GSHs and ADTs. Both schemas implemented the same database accounting model of the sales cycle of a hypothetical company. Participants using the higher abstraction (OO) schema with GSHs and ADTs made fewer semantic errors than did participants using the traditional relational schema. The OO participants also required less time to formulate their queries. These results have several important implications. First, relational database vendors should continue, if not accelerate, their efforts to incorporate OO features such as GSHs and ADTs into their database systems. Second, users of accounting information systems need to improve their understanding of the implications of various data structures on their interactive queries. Third, research should investigate the effects of other abstraction mechanisms, including classification/instantiation and aggregation/decomposition, on query performance.


Sign in / Sign up

Export Citation Format

Share Document