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.

Proceedings of 1994 IEEE 10th International Conference on Data Engineering

14-18 Feb. 1994

Filter Results

Displaying Results 1 - 25 of 56
  • Proceedings of 1994 IEEE 10th International Conference on Data Engineering

    Publication Year: 1994
    Request permission for commercial reuse | PDF file iconPDF (82 KB)
    Freely Available from IEEE
  • QBISM: extending a DBMS to support 3D medical images

    Publication Year: 1994, Page(s):314 - 325
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (936 KB)

    Describes the design and implementation of QBlSM (Query By Interactive, Spatial Multimedia), a prototype for querying and visualizing 3D spatial data. The first application is in an area in medical research, in particular, Functional Brain Mapping. The system is built on top of the Starburst DBMS extended to handle spatial data types, specifically, scalar fields and arbitrary regions of space with... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A method for transforming relational schemas into conceptual schemas

    Publication Year: 1994, Page(s):190 - 201
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (888 KB)

    A major problem with currently existing database systems is that there often does not exist a conceptual understanding of the data. Such an understanding can be obtained by describing the data using a semantic data model, such as the ER model. Consequently, there is a need for methods that translate a schema in a traditional data model into a conceptual schema. We present a method for translating ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Data management in delayed conferencing

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

    Abstract only given, as follows. Video conferencing has become an alternative way to get people to communicate with each other without having to travel long distances. Though it has proven to be very useful in many occasions, in order to have a successful video conference, (1) it requires preliminary scheduling to have all involved parties present at the same time, (2) all parties need to be fully... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Supporting data mining of large databases by visual feedback queries

    Publication Year: 1994, Page(s):302 - 313
    Cited by:  Papers (17)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1628 KB)

    Describes a query system that provides visual relevance feedback in querying large databases. The goal is to support the process of data mining by representing as many data items as possible on the display. By arranging and coloring the data items as pixels according to their relevance for the query, the user gets a visual impression of the resulting data set. Using an interactive query interface,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mariposa: a new architecture for distributed data

    Publication Year: 1994, Page(s):54 - 65
    Cited by:  Papers (29)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1064 KB)

    We describe the design of Mariposa, an experimental distributed data management system that provides high performance in an environment of high data mobility and heterogeneous host capabilities. The Mariposa design unifies the approaches taken by distributed file systems and distributed databases. In addition, Mariposa provides a general, flexible platform for the development of new algorithms for... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Polymorphic reuse mechanisms for object-oriented database specifications

    Publication Year: 1994, Page(s):180 - 189
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (644 KB)

    A polymorphic approach to the incremental design and reuse of object-oriented methods and query specifications is presented. Using this approach, the effort required for manually reprogramming methods and queries due to schema modifications can be avoided or minimized. The salient features of of our approach are the use of propagation patterns and a mechanism for propagation pattern refinement. Pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • X.500 Directory Schema management

    Publication Year: 1994, Page(s):393 - 400
    Cited by:  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (628 KB)

    The X.500 Directory Service provides a powerful mechanism for storing and retrieving information about objects in a distributed computing environment. This requires the functional components of the Directory Service to have knowledge of the structure and representation, or schema, of the information held within the directory. The management of the Directory Schema is a subject requiring further re... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Supporting high-bandwidth navigation in object-bases

    Publication Year: 1994, Page(s):294 - 301
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (760 KB)

    Magritte is an attempt to construct a high-bandwidth front-end to an object-base containing meta-data about SCAD designs. SCAD is a small part of a family of visualization applications where the end-user concurrently manipulates large collections of active data. Such end-user interfaces require a different paradigm of interaction than the object-at-a-time interfaces of current databases. Proposals... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Knowledge-based handling of design expertise

    Publication Year: 1994, Page(s):368 - 374
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (596 KB)

    Research issues in the domain of AI for design can be organized in three categories: decision making, representation and knowledge handling. In the area of knowledge handling, this paper addresses issues concerning the management of design experience to guide a priori the generation of candidate solutions. The approach is based on keeping the trace of a previous design experience as a hierarchical... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Transactional workflow management in distributed object computing environments

    Publication Year: 1994
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (80 KB)

    Focuses on transactional workflows, i.e., the advanced transaction technology required to (i) ensure the reliability of tasks in a workflow, and the correctness and reliability of concurrent workflows, and (ii) support the specification and management of extended transactions models. In addition, the author discusses research and development at GTE Laboratories to produce a Transaction Specificati... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exploiting uniqueness in query optimization

    Publication Year: 1994, Page(s):68 - 79
    Cited by:  Papers (2)  |  Patents (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (924 KB)

    Consider an SQL query that specifies duplicate elimination via a DISTINCT clause. Because duplicate elimination often requires an expensive sort of the query result, it is often worthwhile to identify unnecessary DISTINCT clauses and avoid the sort altogether. We prove a necessary and sufficient condition for deciding if a query requires duplicate elimination. The condition exploits knowledge abou... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Managing change in the Rufus system

    Publication Year: 1994, Page(s):170 - 179
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (824 KB)

    Rufus is an information system that models user data with objects taken from a class system. Due to the importance of coping with changes to the schema, Rufus has adopted the conformity-based model of Melampus. This model enables Rufus to cope with schema changes more easily than traditional class- and inheritance-based data models. The paper reviews the Melampus data model and describes how it wa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance analysis of RAIDS disk arrays with a vacationing server model for rebuild mode operation

    Publication Year: 1994, Page(s):111 - 119
    Cited by:  Papers (14)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (752 KB)

    We analyze the performance of RAIDS disk arrays in normal, degraded, and rebuild modes. The analysis, which is shown to be highly accurate through validation against simulation results, achieves its accuracy by (1) modeling detailed disk characteristics; (2) developing a simple approximation to compute the mean response time for fork-join requests arising in degraded mode operation; and (3) using ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implementing calendars and temporal rules in next generation databases

    Publication Year: 1994, Page(s):264 - 273
    Cited by:  Papers (21)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (716 KB)

    In applications like financial trading, scheduling, manufacturing and process control, time based predicates in queries and rules are very important. There is also a need to define lists of time points or intervals. The authors refer to these lists as calendars. The authors present a system of calendars that allow specification of natural-language time-based expressions, maintenance of valid time ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Index structures for information filtering under the vector space model

    Publication Year: 1994, Page(s):337 - 347
    Cited by:  Papers (14)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (792 KB)

    The authors study what data structures and algorithms can be used to efficiently perform large-scale information filtering under the vector space model, a retrieval model established as being effective. They apply the idea of the standard inverted index to index user profiles. They devise an alternative to the standard inverted index, in which they, instead of indexing every term in a profile, sel... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Supporting partial data accesses to replicated data

    Publication Year: 1994, Page(s):32 - 42
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (864 KB)

    Partial data access operations occur frequently in distributed systems. This paper presents new approaches for efficiently supporting partial data access operations to replicated data. We propose the replica modularization (RM) technique which suggests partitioning replicas into modules, which now become the minimum unit of data access. RM is shown to increase the availability of both partial read... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Papyrus: a history-based VLSI design process management system

    Publication Year: 1994, Page(s):385 - 392
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (808 KB)

    This paper describes the design and implementation of a VLSI design process management system called Papyrus, which is built upon a history-based design process model that supports both routine and exploratory VLSI design processes. Emphasis of this paper is put on the descriptions of Papyrus's basic data models, design decisions, and implementation details. The operational prototype features a tr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient evaluation of the valid-time natural join

    Publication Year: 1994, Page(s):282 - 292
    Cited by:  Papers (25)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (988 KB)

    Joins are arguably the most important relational operators. Poor implementations are tantamount to computing the Cartesian product of the input relations. In a temporal database, the problem is more acute for two reasons. First, conventional techniques are designed for the optimization of joins with equality predicates, rather than the inequality predicates prevalent in valid-time queries. Second,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance evaluation of grid based multi-attribute record declustering methods

    Publication Year: 1994, Page(s):356 - 365
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (680 KB)

    We focus on multi-attribute declustering methods which are based on some type of grid-based partitioning of the data space. Theoretical results are derived which show that no declustering method can be strictly optimal for range queries if the number of disks is greater than 5. A detailed performance evaluation is carried out to see how various declustering schemes perform under a wide range of qu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Approximate analysis of real-time database systems

    Publication Year: 1994, Page(s):10 - 19
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (648 KB)

    During the past few years, several studies have been made on the performance of real-time database systems with respect to the number of transactions that miss their deadlines. These studies have used either simulation models or database testbeds as their performance evaluation tools. We present a preliminary analytical performance study of real-time transaction processing. Using a series of appro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the selection of optimal index configuration in OO databases

    Publication Year: 1994, Page(s):526 - 537
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1076 KB)

    An operation in object-oriented databases gives rise to the processing of a path. Several database operations may result into the same path. The authors address the problem of optimal index configuration for a single path. As it is shown an optimal index configuration for a path can be achieved by splitting the path into subpaths and by indexing each subpath with the optimal index organization. Th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A multi-set extended relational algebra: a formal approach to a practical issue

    Publication Year: 1994, Page(s):80 - 88
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (592 KB)

    The relational data model is based on sets of tuples, i.e. it does not allow duplicate tuples an a relation. Many database languages and systems do require multi-set semantics though, either because of functional requirements or because of the high costs of duplicate removal in database operations. Several proposals have been presented that discuss multi-set semantics. As these proposals tend to b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Resolving attribute incompatibility in database integration: an evidential reasoning approach

    Publication Year: 1994, Page(s):154 - 163
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (776 KB)

    Resolving domain incompatibility among independently developed databases often involves uncertain information. DeMichiel (1989) showed that uncertain information can be generated by the mapping of conflicting attributes to a common domain, based on some domain knowledge. The authors show that uncertain information can also arise when the database integration process requires information not direct... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Data placement and buffer management for concurrent mergesorts with parallel prefetching

    Publication Year: 1994, Page(s):418 - 427
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (748 KB)

    Various data placement policies are studied for the merge phase of concurrent mergesorts using parallel prefetching, where initial sorted runs (input) of a merge and its final sorted run (output) are stored on multiple disks but each run resides only on a single disk. Since the merge phase involves only sequential references, parallel prefetching can be attractive an reducing the average response ... View full abstract»

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