Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Gary H. Sockut is active.

Publication


Featured researches published by Gary H. Sockut.


ACM Transactions on Information Systems | 1987

Office-by-example: an integrated office system and database manager

Kyu-Young Whang; Arthur C. Ammann; Anthony Bolmarcich; Maria Hanrahan; Guy Hochgesang; Kuan-Tsae Huang; Al Khorasani; Ravi Krishnamurthy; Gary H. Sockut; Paula Sweeney; Vance E. Waddle; Moshé M. Zloof

Office-by-Example (OBE) is an integrated office information system that has been under development at IBM Research. OBE, an extension of Query-by-Example, supports various office features such as database tables, word processing, electronic mail, graphics, images, and so forth. These seemingly heterogeneous features are integrated through a language feature called example elements. Applications involving example elements are processed by the database manager, an integrated part of the OBE system. In this paper we describe the facilities and architecture of the OBE system and discuss the techniques for integrating heterogeneous objects.


data and knowledge engineering | 1993

GRAQULA: a graphical query language for entity-relationship or relational databases

Gary H. Sockut; Luanne M. Burns; Ashok Malhotra; Kyu-Young Whang

Abstract GRAQULA is a graphical language for querying and updating a database. One version of GRAQULA provides a user interface for the entity-relationship data model, and another version (with almost identical syntax) provides a user interface for the relational model. Each version is relationally complete, and each depicts relationships (or expected joins) graphically, GRAQULA provides logical operations (e.g. negation) on graphical objects; these operations have user-specified scopes, allow nesting, and can involve existential or universal quantification. Aggregates (e.g. average) also have user-specified scopes. Queries can invoke other queries, and users and queries can pass parameters to queries. The design reflects a specified set of goals, including expressive power, consistency, and limitation of required memorization.


IEEE Transactions on Software Engineering | 1992

Two-dimensional specification of universal quantification in a graphical database query language

Kyu-Young Whang; Ashok Malhotra; Gary H. Sockut; Luanne M. Burns; Key-Sun Choi

A technique is proposed for specifying universal quantification and existential quantification (combined with negation) in a two-dimensional (graphical) database query language. Unlike other approaches that provide set operators to simulate universal quantification, this technique allows a direct representation of universal quantification. Syntactic constructs for specifying universal and existential quantifications, two-dimensional translation of universal quantification to existential quantification (with negation), and translation of existentially quantified two-dimensional queries to relational queries are presented. The resulting relational queries can be processed directly by many existing database systems. The authors claim that this technique renders universal quantifications easy to understand. To substantiate this claim, they provide a simple, easy-to-follow guideline for constructing universally quantified queries. >


international conference on data engineering | 1990

Supporting universal quantification in a two-dimensional database query language

Kyu-Young Whang; Ashok Malhotra; Gary H. Sockut; Luanne M. Burns

A technique for specifying universal quantification and existential quantification (combined with negation) in a two-dimensional graphical database query language is proposed. Unlike other approaches that provide set operators to simulate universal quantification, this technique allows a direct representation of universal quantification. The authors present syntactic constructs for specifying universal and existential quantifications, two-dimensional translation of universal quantification to existential quantification (with negation), and translation of existentially quantified two-dimensional queries to relational queries. The resulting relational queries can be processed directly by many existing database systems. Traditionally, universal quantification has been considered a difficult concept for typical database programmers. The authors claim that this technique renders universal quantification easy to understand. To substantiate this claim, they provide a simple, easy-to-follow guideline for constructing universally quantified queries.<<ETX>>


IEEE Software | 1988

A full-screen facility for defining relational and entity-relationship database schemas

Gary H. Sockut; Ashok Malhotra

An easy-to-use, interactive facility for defining schemas for a mainframe database system has been developed that is more convenient than a linear language. The facility called Dbdefs, has several features that make it easy to use. It provides similar interfaces for defining schemas for two data models, relational and entity-relationship. An overview of Dbdefs is followed by discussion of the relational and entity-relationship interfaces.<<ETX>>


systems man and cybernetics | 1991

AERIAL: Ad hoc entity-relationship investigation and learning

Luanne M. Burns; Ashok Malhotra; Gary H. Sockut; Kyu-Young Whang

A discussion is presented of browsing, an alternate style of working with databases, that facilitates the unplanned exploration of the structure and contents of a database by a novice user. The authors argue that browsing facilitates learning and helps bring the users mental model of the problem space into correspondence with the model stored in the database. Browsing is illustrated through a learning scenario using AERIAL, a facility that allows the user to browse an entity-relationship database. The facilities provided by AERIAL are discussed in detail as is their use in building a correspondence between the users model of the problem space and the model stored in the database.<<ETX>>


International Journal of Human-computer Studies \/ International Journal of Man-machine Studies | 1993

AERIAL: ad-hoc entity-relationship investigation and learning

Luanne M. Burns; Ashok Malhotra; Gary H. Sockut; Kyu-Young Whang

Abstract This paper discusses Browsing, an alternate style of working with databases, that facilitates the unplanned exploration of the structure and contents of a database by a novice user. We argue that Browsing promotes learning and helps bring the users mental model of the problem space into correspondence with the model stored in the database. Browsing is illustrated through a learning scenario using AERIAL, a facility that allows the user to browse an Entity-Relationship database. The facilities provided by AERIAL are discussed in detail as well as their effectiveness in building the above correspondence.


ACM Sigsoft Software Engineering Notes | 1997

Issues in designing an information model for application development

Gary H. Sockut; Helen P. Arzu; Robert W. Matthews; David E. Shough

IBMs object-oriented information model lets a customer share data among various tools for application development. This paper discusses several issues in designing the information model, namely (1) techniques for diagrams (an essential part of communication between an information model designer and other designers or tool writers), (2) organization of the design of the information model (an essential step when many designers design anything large), and (3) technical content. These discussions of the experience of designing the information model should be valuable for further design of the information model and for other design efforts, e.g., involving other models or other integration of tools.


Archive | 1995

Interaction between application of a log and maintenance of a table that maps record identifiers during online reorganization of a database

Gary H. Sockut; Thomas A. Beavin


Archive | 1998

Methods for in-place online reorganization of a database

Balakrishna R. Iyer; Gary H. Sockut

Researchain Logo
Decentralizing Knowledge