[1989] Proceedings. Fifth International Conference on Data Engineering

6-10 Feb. 1989

Filter Results

Displaying Results 1 - 25 of 84
  • Proceedings Fifth International Conference on Data Engineering (IEEE Cat. No.89CH2695-5)

    Publication Year: 1989
    Request permission for commercial reuse | PDF file iconPDF (32 KB)
    Freely Available from IEEE
  • Automatic validation of object-oriented database structures

    Publication Year: 1989, Page(s):2 - 9
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (623 KB)

    The philosophy of explicitly representing simple range classes for properties and explicitly specifying range and/or cardinality restrictions on inherited properties is adopted so that the membership of an object in classes is characterized by the object's property values. The motivation for this approach is twofold: first, it is in keeping with the database philosophy of emphasizing the represent... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Constraint analysis for specifying perspectives of class objects

    Publication Year: 1989, Page(s):10 - 17
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (610 KB)

    An approach known as constraint analysis is presented for specifying updatable perspectives of class objects in an object-oriented data schema. Perspectives provide a way of defining the scope of a user's view of a schema. Operations on class objects are then defined in terms of specific perspectives based on the semantics associated with the schema. Schema semantics are represented as a set of in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An overview of the Object-Oriented Functional Data Language

    Publication Year: 1989, Page(s):18 - 26
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (821 KB)

    The Object-Oriented Functional Data Language (O/sup 2/FDL), an interactive, strongly typed database programming language, is discussed. It features inheritance and encapsulation of object-oriented languages and a functional notation for message expressions. The main contributions of the O/sup 2/FDL are: (1) functions of indefinite nesting levels that simplify nested list processing and form the ba... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Object exchange service for an object-oriented database system

    Publication Year: 1989, Page(s):27 - 34
    Cited by:  Papers (2)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (552 KB)

    An object exchange service (OXS) and an external object representation (EXTOR) are described in the context of a distributed object-oriented database. EXTOR is the common representation that facilitates the sharing of information among a network of machines. The aim is to represent complex structured information in an efficient external form and to provide maximal sharing of information among comp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performing operations over mismatched domains

    Publication Year: 1989, Page(s):36 - 45
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (618 KB)

    A solution is proposed to the problem of providing support for operations over partially matched domains. Mismatched domains occur when information must be obtained from databases that were developed independently. Domain differences are resolved by mapping conflicting attributes to a common domain and the applying a set of extended relational operations to the resulting values. The values that re... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The inter-database instance identification problem in integrating autonomous systems

    Publication Year: 1989, Page(s):46 - 55
    Cited by:  Papers (33)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (743 KB)

    The issue of joining information about the same instance across disparate databases in a composite information system (CIS) environment is discussed. A technique called interdatabase instance identification is presented that is a combination of database management systems and artificial intelligence techniques. Common attributes in the disparate databases are applied first to reduce the number of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Negotiating data access in federated database systems

    Publication Year: 1989, Page(s):56 - 65
    Cited by:  Papers (6)  |  Patents (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (714 KB)

    A protocol is presented for negotiating access to data in a federated database. This protocol deals with several important aspects of data sharing in an environment where databases belonging to different organizations coexist and cooperate. It is based on the concept of quasicopies. These are cached values that are allowed to deviate from the central value in a controlled fashion. The degree of co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • LINDA: a system for loosely integrated databases

    Publication Year: 1989, Page(s):66 - 73
    Cited by:  Papers (9)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (617 KB)

    LINDA, an experimental system for database access in heterogeneous environments, is discussed. The goal is to achieve maximum site autonomy and as much database access homogenization as possible. The problems to be solved are discussed, and design priorities are justified. Major heterogeneity problems are sketched, and the applied techniques are briefly described. An overview of the implementation... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Pragmatic estimation of join sizes and attribute correlations

    Publication Year: 1989, Page(s):76 - 84
    Cited by:  Papers (6)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (689 KB)

    A method is presented for modeling attribute value distributions in database relations for the purpose of obtaining accurate estimates of intermediate relation sizes during query evaluation. The basic idea is that instead of keeping a single (average) value to represent the number of occurrences of each attribute value, m (typically ten) parameters are kept, each representing the number of occurre... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Join strategies on KD-tree indexed relations

    Publication Year: 1989, Page(s):85 - 93
    Cited by:  Papers (5)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (692 KB)

    Join algorithms on KD-tree indexed relations are proposed. The join algorithms are based on a concept called wave. The wave is a set of pages that is the object of joining and that propagates over the relation space in the direction of the join attribute axis. Four basic join algorithms that determine the wave from one of the relations and one algorithm that determines the wave from both relations... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Relational division: four algorithms and their performance

    Publication Year: 1989, Page(s):94 - 101
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (716 KB)

    Three known algorithms for relational division, the algebra operator used to express universal quantification (for-all conditions) and an algorithm called hash-division are outlined. By comparing the algorithms analytically and experimentally, it is shown that the algorithm provides performance competitive with or superior to that of techniques used to date, namely techniques using sorting or aggr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Composition of database relations

    Publication Year: 1989, Page(s):102 - 108
    Cited by:  Papers (3)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (551 KB)

    The authors argue for implementing composition as a primitive operation and present a single-sided composition algorithm that performs join protection and duplicate elimination as one unified operation. They report experimental results that show an operating region in which this algorithm outperforms composition by the standard method. This operating region is characterized by a join result many t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Identifying and update of derived functions in functional databases

    Publication Year: 1989, Page(s):110 - 117
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (627 KB)

    The consistency problems that arise in the design and implementation of functional databases are investigated. The notion of derived functions is used to capture the redundancies that are a common feature of the specification of fundamental databases. To maintain the consistency of databases in the presence of redundant specification, the derived functions in the conceptual schema are identified, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generalized events in temporal databases

    Publication Year: 1989, Page(s):118 - 125
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (685 KB)

    The concepts of temporal entities and temporal events are distinguished, and the conventional crisp notion of events is extended to define generalized events. Novel definitions are provided for temporal operators used for generalized events. A temporal data model is chosen which is independent of conventional data models, but is similar to temporal data models proposed by other researchers and is ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Indexing techniques for historical databases

    Publication Year: 1989, Page(s):127 - 137
    Cited by:  Papers (23)  |  Patents (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (824 KB)

    Two indexing structures based on R-trees are proposed for historical data, which can span magnetic disk and optical disk media. The performance of these indexes is compared to that of two other indexing candidates that are each contained entirely on one medium. Test results indicate that the proposed indexes perform well when compared to an index that is contained entirely on optical disk.<<... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Processor scheduling for multiprocessor joins

    Publication Year: 1989, Page(s):140 - 148
    Cited by:  Papers (11)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (598 KB)

    A family of practical algorithms is presented to schedule join execution in a shared-memory multiprocessor environment. The algorithms are based on page connectivity graphs and determine when to read each data page into memory and how to schedule page joins on the available processors. The goal is to overlap page reads with parallel join execution in such a way that both the number of processors a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Locking performance in a shared nothing parallel database machine

    Publication Year: 1989, Page(s):149 - 158
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (792 KB)

    A quantitative performance study of two-phase locking in a parallel database machine using a simulation-based methodology is presented. The DBSIM simulation methodology uses a Petri-net model at the higher level and a queuing network model at the lower level. The Petri net model captures the characteristics of parallelism and synchronization at the workload level, while the queuing network model c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Query execution for large relations on functional disk system

    Publication Year: 1989, Page(s):159 - 167
    Cited by:  Papers (11)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (708 KB)

    The second version of FDS-R (functional disk system with relational database engine), FDS-RII, which is designed to handle large relations efficiently, is discussed. On FDS-RII, the processing algorithm is selected at run time from two algorithms (nested loop algorithms, grace hash algorithm) by comparing their estimated I/O costs. The processing strategy is discussed in detail. The I/O cost formu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Experience in applying conceptual modelling to interface with a real-life business application

    Publication Year: 1989, Page(s):172 - 179
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (722 KB)

    An insurance underwriting expert system is designed and implemented around an existing mainframe program, driven by a sizable old-fashioned database. It is shown how modeling helped not only to identify real user needs but also to untangle many accumulated complications in the existing repository of information. The author also highlights which conceptual modeling mechanisms are most needed to sup... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A pictorial index mechanism for model-based matching

    Publication Year: 1989, Page(s):180 - 187
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (659 KB)

    An external index mechanism for generating hypotheses in a data-driven object recognition system has been designed, implemented, and tested. The index serves to improve the speed of recognizing objects in a scene. A secondary memory implementation of this approach is discussed. The philosophy behind the present conception of image databases is quite different from that of other researchers in that... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Searching in a hyperlibrary

    Publication Year: 1989, Page(s):188 - 197
    Cited by:  Papers (9)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (687 KB)

    A novel facility in hypermedia systems is proposed to provide search using queries. The search mechanism is shown to complement linking, making the creation of rich linked structures easier. A prototype hypermedia system that provides search is described, and user experiences to date and some future directions are discussed.<<ETX>> View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementation and measurements of efficient communication facilities for distributed database systems

    Publication Year: 1989, Page(s):200 - 207
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (687 KB)

    Experimentation with several methods of providing efficient communication facilities for distributed database systems is described. These studies give insight into the delays incurred by applications running on distributed systems. Five different mechanisms for local interprocess communications (two variations with message queues, named pipes, shared memory, and UDP sockets) have been implemented,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On software and hardware techniques of data engineering

    Publication Year: 1989, Page(s):208 - 215
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (417 KB)

    Methods are discussed to enhance the efficiency and speed of data compression techniques in DBMS (database management systems). Arithmetic coding utilizes the skewness of character distribution by assigning larger intervals (code ranges) to characters having higher probabilities of occurrence. A scheme is presented which effectively increases the code ranges of individual characters by splitting t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Incremental protocol verification using deductive database systems

    Publication Year: 1989, Page(s):216 - 223
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (570 KB)

    A deductive approach which incorporates first-order logic into a relational database is proposed to remedy the problems incurred in the relational algebraic approach. The method not only allows recursive definitions for more complex logical reasoning but also provides a uniform query interface to the users for verifying functional properties of a protocol. Most important, with the deductibility of... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.