Scheduled System Maintenance
On Tuesday, May 22, IEEE Xplore will undergo scheduled maintenance. Single article sales and account management will be unavailable
from 6:00am–5:00pm ET. There may be intermittent impact on performance from noon–6:00pm ET.
We apologize for the inconvenience.

[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
  • Parallel computing with distributed shared data

    Publication Year: 1989
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (84 KB)

    Summary form only given. The issue of ease of using shared data in a data-intensive parallel computing environment is discussed. An approach is investigated for transparently supporting data sharing in a loosely coupled parallel computing environment, where a moderate to a large number of individual computing elements are connected via a high-bandwidth network without necessarily physically sharin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Set-oriented disk access to large complex objects

    Publication Year: 1989, Page(s):426 - 433
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (740 KB)

    The use of set-oriented disk access whereby a variable-sized set of pages can be fetched or flushed to disk in a single call to the I/O system is proposed. This solution provides fast access to variable-length complex objects, yet retains the advantages of a page-structured buffer pool with a conventional frame size. A set-oriented I/O manager has been implemented in the Darmstadt database kernel ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generic computer aided software engineering (CASE) databases requirements

    Publication Year: 1989, Page(s):422 - 423
    Cited by:  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (168 KB)

    Generic requirements are discussed for a CASE (computer-aided software engineering) database based on a study, performed in a programming-in-the-large environment, of a project which involves the interaction of thousands of software developers and over a million lines of source code and other related design objects. The discussion covers data modeling in software engineering and version control, a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Inference-security analysis using resolution theorem-proving

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

    A nonnumeric analog of statistical methods for proving security is described and implemented. The approach involves analyzing facts and inference rules assumed to be known to a compromiser and deriving all their possible consequences using resolution theorem-proving, a technique which is argued to be far more appropriate to this problem than rule-based expert systems or information-flow analysis. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Integrating AI and DBMS through stream processing

    Publication Year: 1989, Page(s):259 - 260
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (164 KB)

    An approach is presented for integrating AI (artificial intelligence) systems with DBMS (database management systems). The impedance mismatch that has made this integration a problem is, in essence, a difference in the two system models of data processing. The present approach is to avoid the mismatch by forcing both AI systems and DBMS into the common model of stream processing. The approach take... 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 (80)
    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.
  • Coupling knowledge based systems with large data stores

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

    Loose and tight couplings of knowledge-based systems with large underlying information bases are defined and discussed. Two points of discussion presented are whether it is possible to achieve tight coupling of the kind defined, and whether it is of some benefit to reach for tight coupling. It is concluded that in addition to a gain in performance, the tight integration of all system components wi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Knowledge-based support for the development of database-centered applications

    Publication Year: 1989, Page(s):394 - 401
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (764 KB)

    Using the Application Development Toolkit (ADT) as an example, it is shown that by borrowing some techniques from the artificial-intelligence field, database-centered application-development productivity tools can be made more acceptable to end users and more useful to expert developers. Experience with ADT has indicated that a more end-user-oriented approach, and, in particular, more accommodatin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance analysis of distributed commit protocols

    Publication Year: 1989, Page(s):505 - 512
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (568 KB)

    An analytic model is presented for the performance of a commit protocol which considers both the communication and local processing. It is shown that the local queuing delays are significant when the number of atomic actions is sufficiently large. The single most important parameter in determining the effect of commit protocols on the system performance is believed to be the heavy dependence on lo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The role of loose coupling in expert database system architectures

    Publication Year: 1989, Page(s):255 - 256
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (220 KB)

    The author maintains that loose AI-DBMS (artificial intelligence-database-management system) coupling will thrive in the future. The specific approaches adopted for the coupling (loose or tight) of AI-DBMS systems will depend on engineering, economic, social, organizational factors. A number of applications involving the processing of knowledge and data are presented and classified in terms of the... 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.
  • 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.
  • 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.
  • Does loose AI-DBMS coupling stand a chance?

    Publication Year: 1989, Page(s):252 - 254
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (232 KB)

    The concept of loose coupling of artificial intelligence systems and database systems is defined. The issues that arise in determining the scope of loose integration are identified. A cache-based architecture being implemented in a knowledge management system project is described. The objective is to develop an interface that is useful for generalized database access from an expert system 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 (12)
    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.
  • Relational division: four algorithms and their performance

    Publication Year: 1989, Page(s):94 - 101
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (724 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.
  • Limiting factors of join performance on parallel processors

    Publication Year: 1989, Page(s):488 - 496
    Cited by:  Papers (15)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (684 KB)

    The effectiveness of parallel processing of relational join operations is examined. The skew in the distribution of join attribute values and the stochastic nature of the task processing times are identified as the major factors that can affect the effective utilization of parallelism. When many small processors are used in the parallel architecture, the skew can result in some processors becoming... 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 scheme for maintaining consistency and availability of replicated files in a partitioned distributed system

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

    A dynamic voting scheme is presented that enhances the availability of replicated files in a distributed system in the presence of network partitions. In such situations, the proposed scheme maintains consistency of replicated files by imposing the following constraint; a node can commit a file update only if its current enclosing group is a majority of the nodes that participated in the most rece... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A data model and access method for summary data management

    Publication Year: 1989, Page(s):242 - 249
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (688 KB)

    A data model and an access method for summary data management are proposed. Summary data, represented as a trinary tuple <statistical function, category, summary>, consist of metaknowledge summarized by a statistical function of a category of individual information typically stored in a conventional database. The concept of category (type or class) and the additivity property of statistical ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Tangram stream query processing system

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

    Tangram, an environment for modeling which is under development at UCLA, is discussed. One of the driving concepts behind Tangram has been the combination of large-scale data access and data reduction with a powerful programming environment. The Tangram environment is based on PROLOG, extending it with a number of features, including process management, distributed database access, and generalized... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automated logical navigation among relations using Steiner trees

    Publication Year: 1989, Page(s):582 - 588
    Cited by:  Papers (1)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (508 KB)

    The use of the Steiner tree (or the shortest connection) as a model for automatic logical navigation among relations is described. An efficient approximation algorithm is introduced for finding shortest connections. The model is extended to allow for ambiguous words in queries. The capability of this method is demonstrated by a simple database interface which is both easy to build and easy to use.... View full abstract»

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

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

    A direct extension to the counting method is presented which can deal efficiently with both acyclic and cyclic relations. The extension to cycle cases, called the synchronized counting method, is simulated and studied using a Petri net model. Worst-case analysis shows that n2 semijoin operations are required, where n is the number of nodes in the graph representing the... 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.