Proceedings of the Twelfth International Conference on Data Engineering

Feb. 26 1996-March 1 1996

Filter Results

Displaying Results 1 - 25 of 80
  • IN MEMORIAM James Clifford

    Publication Year: 1996
    Request permission for commercial reuse | |PDF file iconPDF (33 KB)
    Freely Available from IEEE
  • IN MEMORIAM Gennady Antoshenkov

    Publication Year: 1996
    Request permission for commercial reuse | |PDF file iconPDF (73 KB)
    Freely Available from IEEE
  • Transaction coordination for the new millennium: SQL Server meets OLE transactions

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

    Summary form only given, as follows. Computing hardware is now available at a price, performance, and reliability point such that enterprise computing tasks may be performed on "commodity" class machines. These economic benefits have been achieved through producing large numbers of systems from standardized components. The OLE Transaction Architecture defines a set of distributed component object ... View full abstract»

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

    Publication Year: 1996
    Request permission for commercial reuse | |PDF file iconPDF (149 KB)
    Freely Available from IEEE
  • PICSDESK: a case study in business re-engineering

    Publication Year: 1996, Page(s):300 - 306
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (932 KB)

    Presents first-hand experiences from an actual re-engineering project. Business re-engineering is a process affecting not only the software system involved, but the underlying business model as well. Indeed, it is the changed business model along with the new technologies that determine the design of the new system. This paper is a walkthrough of the design of PICSDESK, a prototype incorporating s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • DSDT: Durable Scripts containing Database Transactions

    Publication Year: 1996, Page(s):624 - 633
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1048 KB)

    DSDT is a proposed method for creating durable scripts which contain short ACID transactions as components. Workflow scripts are an example. The context of the script is made durable by writing a log record whenever an event occurs which cannot be replayed. Log checkpoints are used to minimize the recovery time. DSDT can be written in stand-alone mode, communicating with a DBMS by transactional re... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Representing retroactive and proactive versions in bi-temporal databases (2TDB)

    Publication Year: 1996, Page(s):85 - 94
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (872 KB)

    Bi temporal databases allow users to record retroactive (past) and proactive (future planned) versions of an entity, and to retrieve the appropriate versions for bi temporal queries that involve both valid time and transaction time. Currently used timestamp representations are mainly for either valid time or transaction time databases. We first categorize the types of problems that can occur in ex... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Energy-efficient caching for wireless mobile computing

    Publication Year: 1996, Page(s):336 - 343
    Cited by:  Papers (42)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (736 KB)

    Caching can reduce the bandwidth requirement in a mobile computing environment. However, due to battery power limitations, a wireless mobile computer may often be forced to operate in a doze (or even totally disconnected) mode. As a result, the mobile computer may miss some cache invalidation reports broadcast by a server, forcing it to discard the entire cache contents after waking up. In this pa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SONET configuration management with OpenPM

    Publication Year: 1996, Page(s):295 - 299
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (360 KB)

    SONET (Synchronous Optical NETwork) has been proposed as the backbone of future information superhighway infrastructure. SONET network management, however, is a complex process that involves many heterogeneous systems and applications, as well as human interactions. In this paper, we describe a prototype system developed at Hewlett-Packard (HP) that provides a service for configuring large SONET n... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Database extensions for complex domains

    Publication Year: 1996, Page(s):200 - 202
    Cited by:  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (260 KB)

    Future versions of the Oracle Server will provide an open and extensible framework for supporting complex data domains including, but not limited to, text, image, spatial, video, and OLAP. This framework encompasses features for defining, storing, updating, indexing, and retrieving complex forms of data with full transaction semantics. The underpinning for these features is an extended Oracle Serv... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel pointer-based join algorithms in memory mapped environments

    Publication Year: 1996, Page(s):266 - 275
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1124 KB)

    Three pointer based parallel join algorithms are presented and analyzed for environments in which secondary storage is made transparent to the programmer through memory mapping. P.A. Buhr et al. (1992) show that data structures such as B Trees, R Trees and graph data structures can be implemented as efficiently and effectively in this environment as in a traditional environment using explicit I/O.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Synthesizing distributed constrained events from transactional workflow specifications

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

    Workflows are the semantically appropriate composite activities in heterogeneous computing environments. Such environments typically comprise a great diversity of locally autonomous databases, applications and interfaces. Much good research has focused on the semantics of workflows and how to capture them in different extended transaction models. We address the complementary issues pertaining to h... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • HiTi graph model of topographical road maps in navigation systems

    Publication Year: 1996, Page(s):76 - 84
    Cited by:  Papers (4)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (728 KB)

    In navigation systems, a primary task is to compute the minimum cost route from the current location to the destination. One of the major problems for navigation systems is that a significant amount of computation time is required to find a minimum cost path when the topographical road map is large. Since navigation systems are real time systems, it is critical that the path be computed while sati... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reusing (shrink wrap) schemas by modifying concept schemas

    Publication Year: 1996, Page(s):326 - 333
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (764 KB)

    A shrink-wrap schema is a well-crafted, complete, global schema that represents an application. A concept schema is a subset of the shrink-wrap schema that addresses one particular point of view in an application. We define schema modification operations to customize each concept schema, to match the designer's perception of the application. We maintain the integrated, customized user schema. We e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Mentor project: steps towards enterprise-wide workflow management

    Publication Year: 1996, Page(s):556 - 565
    Cited by:  Papers (25)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1228 KB)

    Enterprise-wide workflow management where workflows may span multiple organizational units require particular consideration of scalability, heterogeneity, and availability issues. The Mentor project, introduced in this paper, aims to reconcile a rigorous workflow specification method with a distributed middleware architecture as a step towards enterprise-wide solutions. The project uses the formal... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Workflow and data management in InConcert

    Publication Year: 1996, Page(s):497 - 499
    Cited by:  Papers (3)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (268 KB)

    InConcert is an object-oriented client-server workflow management system. An overview is provided of the functionality of InConcert and how it is implemented on an underlying relational database management system. Data management issues in supporting distributed workflow are briefly reviewed View full abstract»

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

    Publication Year: 1996, Page(s):666 - 672
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (620 KB)

    The third major generation of the standard for the SQL database language, known as SQL3, is nearing completion. Many significant new features have been added to SQL, both in areas traditionally addressed by SQL and in pursuit of adding object technology to the language. The standard has been partitioned into a number of distinct parts, each of which may progress at its own rate. Publication of SQL... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • DB2 LOBs: the teenage years

    Publication Year: 1996, Page(s):192 - 199
    Cited by:  Papers (1)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (740 KB)

    Previous versions of DB2 Common Server had large objects (LOBs) that were neither large nor functional. Their size was limited to 32,700 bytes and, until recently when support for SUBSTR and CONCAT was added, there was no function available on these objects at all. DB2 LOBs were infants. However, with the latest release of DB2 Common Server, Version 2.1, LOBs have matured considerably supporting s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel processing of spatial joins using R-trees

    Publication Year: 1996, Page(s):258 - 265
    Cited by:  Papers (21)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (916 KB)

    We show that spatial joins are very suitable to be processed on a parallel hardware platform. The parallel system is equipped with a so called shared virtual memory which is well suited for the design and implementation of parallel spatial join algorithms. We start with an algorithm that consists of three phases: task creation, task assignment and parallel task execution. In order to reduce CPU an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • MedMaker: a mediation system based on declarative specifications

    Publication Year: 1996, Page(s):132 - 141
    Cited by:  Papers (22)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (972 KB)

    Mediators are used for integration of heterogeneous information sources. We present a system for declaratively specifying mediators. It is targeted for integration of sources with unstructured or semi-structured data and/or sources with changing schemas. We illustrate the main features of the Mediator Specification Language (MSL), show how they facilitate integration, and describe the implementati... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Consistency and performance of concurrent interactive database applications

    Publication Year: 1996, Page(s):602 - 609
    Cited by:  Papers (1)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (972 KB)

    In many modern database applications, there is an emerging need for interactive environments where users directly manipulate the contents of the database. Graphical user interfaces (GUIs) display images of the database which must reflect a consistent up-to-date state of the data with minimum perceivable delay to the user. Moreover, the possibility of several applications concurrently displaying di... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Applying a flexible OODBMS-IRS-coupling to structured document handling

    Publication Year: 1996, Page(s):10 - 19
    Cited by:  Papers (3)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (904 KB)

    In document management systems, it is desirable to provide content-based access to documents going beyond regular expression search in addition to access based on structural characteristics or associated attributes. We present a new approach for coupling OODBMSs (object-oriented database management systems) and IRSs (information retrieval systems) that provides enhanced flexibility and functionali... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Refined triggering graphs: a logic-based approach to termination analysis in an active object-oriented database

    Publication Year: 1996, Page(s):384 - 391
    Cited by:  Papers (6)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (752 KB)

    Presents the notion of refined triggering graphs (RTG) for analyzing termination of active rules in object-oriented databases (OODBs). The RTG method consists of mapping the possibility that one active rule can trigger another to the satisfiability of a well-defined logic formula called a triggering formula. The unsatisfiability of the triggering formula is then an indication that the rule trigger... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improving the performance of multi-dimensional access structures based on k-d-trees

    Publication Year: 1996, Page(s):68 - 75
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (688 KB)

    In recent years, various k-d-tree based multidimensional access structures have been proposed. All these structures share an average bucket utilization of at most ln 2≈69.3%. We present two algorithms which perform local redistributions of objects to improve the storage utilization of these access structures. We show that under fair conditions a good improvement algorithm can save up to 20% of ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Evaluation and optimization of the LIVING IN A LATTICE rule language

    Publication Year: 1996, Page(s):318 - 325
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (848 KB)

    We introduce an evaluation technique for a declarative object-oriented database (OODB) query language. The query language is rule-based and can be evaluated and optimized using an appropriate object algebra. We introduce a new framework which uses concepts of the object-oriented data model to define adequate accesses to the database. Additionally, problems according to the evaluation of recursive ... View full abstract»

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