By Topic

[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 (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (628 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.
  • A seamless integration in object-oriented database systems

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

    A discussion is given on the use of object-oriented database systems for supporting database applications such as office information systems, knowledge-based systems, engineering design databases, (computer-aided design/manufacturing), hypermedia and software engineering databases. Typically, the research on object-oriented database systems has been addressed from two different disciplines: the pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling semantic constraints with logic in the EARL data model

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

    The authors present a portion of the EARL semantic data model, an augmentation of the entity-relationship model, which uses notational constructs based on propositional logic to allow a greater selection of semantic integrity constraints to be captured during the specification and design of a domain schema. The use of these logic-based constructs is shown to allow more subtle constraints to be spe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Communications issues in data engineering: `have bandwidth-will move data'

    Publication Year: 1989
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (112 KB)

    It is argued that those areas of data engineering research which are based on the assumption that communication bandwidth is a constraint, should be investigated. Some additional distributed database issues that require reinvestigation include concurrency control, network partitioning, backup storage and recovery algorithms. With the availability of increased bandwidth, global flooding of informat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Aggregative closure: an extension of transitive closure

    Publication Year: 1989, Page(s):384 - 391
    Cited by:  Papers (9)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (616 KB)

    The aggregative closure operator is defined and its usefulness is demonstrated in a wide variety of applications. The concepts and definitions of closed semirings and the aggregating relational operators provide a mathematical framework for the presentation of algorithms for these applications. A novel algorithm is also presented which is intended for the computation of the aggregate closure. All ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Relational storage and efficient retrieval of rules in a deductive DBMS

    Publication Year: 1989, Page(s):644 - 651
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (600 KB)

    A method is proposed to store and efficiently retrieve rules in a deductive database. The rules are compiled into an execution model called a PCN (production compilation network). The PCN is stored as a particular relational database which consists of three relations. For a given end-user query the first step of the inference process consists of searching for the relevant rules by traversing the P... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Classification as a query processing technique in the CANDIDE semantic data model

    Publication Year: 1989, Page(s):572 - 581
    Cited by:  Papers (17)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (860 KB)

    The use of classification and subsumption to process database queries is discussed. The data model, called CANDIDE, is essentially an extended version of the FL-1, KANDOR and BACK, frame-based knowledge representation languages. A novel feature of the approach is that the data-description language and data-manipulation language are identical, thus providing uniform treatment of data objects, query... 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 (576 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.
  • Time-critical database scheduling: a framework for integrating real-time scheduling and concurrency control

    Publication Year: 1989, Page(s):470 - 480
    Cited by:  Papers (30)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (856 KB)

    A framework is presented for analysis of time-critical scheduling algorithms. The main assumptions are analyzed behind real-time scheduling and concurrency control algorithms, and a unified approach is proposed. Two main classes of schedulers are identified according to the availability of information about resource requirements and execution times: conflict-resolving schedulers resolve conflicts ... 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 (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (692 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.
  • Global information system issues

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

    A global information system (GIS) is an umbrella system that presents a global schema of the data available in its underlying, component, autonomous information systems and provides its users with the capability to ask queries of the global scheme and to receive integrated answers. The major research areas confronting GIS developers are examined. They are: development of global schema; query proce... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Materialization and incremental update of path information

    Publication Year: 1989, Page(s):374 - 383
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (756 KB)

    The problem of efficiently processing recursive path queries in deductive database systems is discussed, and a semimaterialized encoding structure is proposed as an attractive approach that provides a balance between efficiency of retrieval and feasibility of storage. Incremental algorithms are presented that enable the effects of updates to the underlying database to be reflected in the materiali... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A feasibility and performance study of dependency inference [database design]

    Publication Year: 1989, Page(s):635 - 641
    Cited by:  Papers (7)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (616 KB)

    The feasibility of inferring functional dependencies from an example relation is investigated. The problem occurs in the context of automatic database design, when a tool is needed to assist the database designer in the process of specifying logical dependencies. The complexity of the dependency inference problem is inherently exponential. However, algorithms could be developed that perform well w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cyclic query processing in object-oriented databases

    Publication Year: 1989, Page(s):564 - 571
    Cited by:  Papers (11)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (640 KB)

    Cyclic query processing issues in object-oriented databases are investigated. A data and cyclic query model is defined for an object-oriented database system, using a graph model. Then the efficient processing of a general object-oriented cyclic query is discussed. For efficient processing, a general cyclic query and the access plans generated for a given query are defined and a cost model is deve... 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 (424 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.
  • A buffer management model for use in predicting overall database system performance

    Publication Year: 1989, Page(s):463 - 469
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (600 KB)

    A performance model of buffer management is presented that is appropriate for use in the context of a multilayer database performance model. Some empirical evidence that supports the model's hypothesis that database page references are Bradford-Zipf-distributed is provided. A validation of the buffer performance model against data from a real-life environment is reported. Overall, the database buf... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The personal model of data towards a privacy oriented information system

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

    A general report is presented on an approach problem of privacy-oriented information systems. The report is based on extensive research experiences in specifying the structure of such a system, including the underlying data model and the privacy policy, as well as on the insight gained from a prototype implementation of selected parts of the specification. The system is called DORIS (datenschutz-o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An implementation and performance analysis of spatial data access methods

    Publication Year: 1989, Page(s):606 - 615
    Cited by:  Papers (21)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (784 KB)

    Four spatial data access methods, R-trees, K-D-B-trees, R+trees, and 2-D-Isam, have been implemented within a preliminary version of the POSTGRES DBMS (database management system). These access methods have been tested over a range of shapes and sizes of two-dimensional objects and for a range of logical page sizes. The CPU time, number of disk reads and writes, and the resulting tree sizes have b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An object-based query evaluation scheme for deductive databases in massively parallel computing environment

    Publication Year: 1989, Page(s):497 - 504
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (800 KB)

    An algorithm is introduced to evaluate queries in a massively parallel computing environment under an object-based representation of a database. By distributing facts into connected networks of processing elements, it is shown that parallel execution of a query can be achieved in a cooperative way, so that the conventional tuple-by-tuple evaluation can be avoided. Furthermore, it is shown that dep... 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 (632 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.
  • Pragmatic estimation of join sizes and attribute correlations

    Publication Year: 1989, Page(s):76 - 84
    Cited by:  Papers (4)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (696 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 o... 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 (828 KB)

    The Object-Oriented Functional Data Language (O2FDL), 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 O2FDL are: (1) functions of indefinite nesting levels that simplify nested list processing and f... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • KDA: a knowledge-based database assistant

    Publication Year: 1989, Page(s):402 - 409
    Cited by:  Papers (1)  |  Patents (54)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (592 KB)

    A knowledge-based database assistant, KDA, is described that has a query-guide function, an SQL-like database query generator, and an interface for subset-English. KDA can be used to design the front end of an SQL database system or a computer-based SQL tutorial system. A method is discussed for transforming a semantic network representing a user's conceptual query into one providing the informati... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Semantics and efficient compilation for quantitative deductive databases

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

    A coherent approach is presented that extends relational and deductive database technology toward an integration of expert-system applications, which require sound and efficient capabilities to deal with uncertainty. Extending logic programming, the authors define the semantics of quantitative deductive databases, where fixpoint theory plays a central role. Calculus gives the rule programmer a gre... View full abstract»

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