By Topic

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
  • 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.
  • 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.
  • 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.
  • A transactional nested process management system

    Publication Year: 1996, Page(s):566 - 573
    Cited by:  Papers (11)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (776 KB)

    Providing flexible transaction semantics and incorporating activities, data and agents are the key issues in workflow system development. Unfortunately, most of the commercial workflow systems lack the advanced features of transaction models, and an individual transaction model with specific emphasis lacks sufficient coverage for business process management. This report presents our solutions to t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Transaction management for a distributed object storage system WAKASHI-design, implementation and performance

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

    This paper presents the transaction management in a high performance distributed object storage system WAKASHI. Unlike other systems that use centralized client/server architecture and other conventional buffer management for distributed persistent object management, WAKASHI is based on symmetric peer-peer architecture and employs memory-mapping and distributed shared virtual memory techniques. Se... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A toolkit for constraint management in heterogeneous information systems

    Publication Year: 1996, Page(s):56 - 65
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1092 KB)

    We present a framework and a toolkit to monitor and enforce distributed integrity constraints in loosely coupled heterogeneous information systems. Our framework enables and formalizes weakened notions of consistency, which are essential in such environments. Our framework is used to describe: interfaces provided by a database for the data items involved in inter site constraints; strategies for m... 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 (24)  |  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.
  • 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.
  • Complex query decorrelation

    Publication Year: 1996, Page(s):450 - 458
    Cited by:  Papers (20)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1000 KB)

    Complex queries used in decision support applications use multiple correlated subqueries and table expressions, possibly across several levels of nesting. It is usually inefficient to directly execute a correlated query; consequently, algorithms have been proposed to decorrelate the query, i.e. to eliminate the correlation by rewriting the query. This paper explains the issues involved in decorrel... 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.
  • 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.
  • Query folding

    Publication Year: 1996, Page(s):48 - 55
    Cited by:  Papers (12)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (660 KB)

    Query folding refers to the activity of determining if and how a query can be answered using a given set of resources, which might be materialized views, cached results of previous queries, or queries answerable by other databases. We investigate query folding in the context where queries and resources are conjunctive queries. We develop an exponential time algorithm that finds all complete or par... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • HierarchyScan: a hierarchical similarity search algorithm for databases of long sequences

    Publication Year: 1996, Page(s):546 - 553
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (720 KB)

    We present a hierarchical algorithm, HierarchyScan, that efficiently locates one-dimensional subsequences within a collection of sequences of arbitrary length. The subsequences identified by HierarchyScan match a given template pattern in a scale- and phase-independent fashion. The idea is to perform correlation between the stored sequences and the template in the transformed domain hierarchically... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards eliminating random I/O in hash joins

    Publication Year: 1996, Page(s):422 - 429
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (692 KB)

    The widening performance gap between CPUs and disks is significant for hash join performance. Most current hash join methods try to reduce the volume of data transferred between memory and disk. In this paper, we try to reduce hash-join times by reducing random I/O. We study how current algorithms incur random I/O, and propose a new hash join method, Seq+, that converts much of the rand... 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 (19)  |  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.
  • A next-generation industry multimedia database system

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

    New multimedia applications have emerged on top of information infrastructures, such as on-demand services, digital libraries and museums, online shopping and document management, which require new databases. That is, next-generation database systems must enable users to efficiently and flexibly develop and execute such advanced multimedia applications. We focus on development of a database system... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A distributed query processing strategy using placement dependency

    Publication Year: 1996, Page(s):477 - 484
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (776 KB)

    We present an algorithm to make use of placement dependency information to process distributed queries. Our algorithm first partitions the referenced relations of a given query into a number of non-exclusive subsets such that the fragmented relations within a subset have placement dependency and the join operation(s) associated with the relations in the subset can be locally processed without data... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • High availability in clustered multimedia servers

    Publication Year: 1996, Page(s):645 - 654
    Cited by:  Papers (15)  |  Patents (59)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (964 KB)

    Clustered multimedia servers, consisting of interconnected nodes and disks, have been proposed for large-scale servers that are capable of supporting multiple concurrent streams which access the video objects stored in the server. As the number of disks and nodes in the cluster increases, so does the probability of a failure. With data striped across all disks in a cluster, the failure of a single... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient processing of outer joins and aggregate junctions

    Publication Year: 1996, Page(s):441 - 449
    Cited by:  Papers (1)  |  Patents (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (676 KB)

    Removal of redundant outer joins is essential for the reassociation of outer joins with other binary operations. We present a set of comprehensive algorithms that employ the properties of strong predicates along with the properties of aggregation, intersection, union, and except operations to remove redundant outer joins from a query. For the purpose of query simplification, we generate additional... 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.
  • Auditory browsing for acquisition of information in cyberspace

    Publication Year: 1996, Page(s):510 - 515
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (624 KB)

    Today, various novel telecommunication systems have been proposed. The idea of a virtual communication space shared by multiple distributed users via networks, so-called cyberspace, has received considerable communication. In cyberspace, there are tremendously many users, on-line services, and much information, and users have great opportunity to encounter all of these. We think the most serious p... View full abstract»

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