By Topic

Data Engineering, 1994. Proceedings.10th International Conference

Date 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
  • Efficient organization of large multidimensional arrays

    Publication Year: 1994, Page(s):328 - 336
    Cited by:  Papers (56)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (640 KB)

    Large multidimensional arrays are widely used in scientific and engineering database applications. The authors present methods of organizing arrays to make their access on secondary and tertiary memory devices fast and efficient. They have developed four techniques for doing this: (1) storing the array in multidimensional “chunks” to minimize the number of blocks fetched, (2) reorderin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • QBISM: extending a DBMS to support 3D medical images

    Publication Year: 1994, Page(s):314 - 325
    Cited by:  Papers (11)
    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.
  • Supporting data mining of large databases by visual feedback queries

    Publication Year: 1994, Page(s):302 - 313
    Cited by:  Papers (15)  |  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.
  • 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.
  • 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.
  • Object allocation in distributed databases and mobile computers

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

    This paper makes two contributions. First, we introduce a model for evaluating the performance of data allocation and replication algorithms in distributed databases. The model is comprehensive in the sense that it accounts for I/O cost, for communication cost, and for limits on the minimum number of copies of the object (to ensure availability). The second contribution of this paper is the introd... 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.
  • A method for transforming relational schemas into conceptual schemas

    Publication Year: 1994, Page(s):190 - 201
    Cited by:  Papers (15)
    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.
  • Analysis of reorganization overhead in log-structured file systems

    Publication Year: 1994, Page(s):102 - 110
    Cited by:  Papers (5)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (608 KB)

    In a log-structured file system (LFS), in general each block written to disk causes another disk block to become invalid data, resulting in one block of free space. Over time free disk space becomes highly fragmented, and a high level of dynamic reorganization may be required to coalesce free blocks into physically contiguous areas that subsequently can be used for logs. By consuming available dis... 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 (19)  |  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.
  • 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.
  • Declustering techniques for parallelizing temporal access structures

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

    This paper addresses the issues of declustering temporal index and access structures for a single processor multiple independent disk architecture. The temporal index is the Monotonic B+-Tree which uses the time index temporal access structure. We devise a new algorithm, called multi-level round robin, for assigning tree nodes to multiple disks. The multi-level round robin declustering ... 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.
  • An efficient relational implementation of recursive relationships using path signatures

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

    The `parts explosion' is a classical problem, which is hard for relational database systems, due to recursion. A simple solution is suggested, which packs information of an ancestor path of a tuple into a fixed-length code, called signature. The coding technique is carefully adjusted to enable an efficient retrieval of the transitive closure, in terms of both disk accesses and DBMS calls. The code... 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.
  • On a more realistic lock contention model and its analysis

    Publication Year: 1994, Page(s):2 - 9
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (640 KB)

    Most performance modeling studies of lock contention in transaction processing systems are deficient in that they postulate a homogeneous database access model. The non-homogeneous database access model described in this paper allows multiple transaction classes with different access patterns to the database regions. The performance of the system from the viewpoint of lock contention is analyzed i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cooperative problem solving using database conversations

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

    Cooperative problem solving is a joint style of producing and consuming data. Unfortunately, most database mechanisms developed so far; are more appropriate for competitive usage than for a cooperative working style. They mostly adopt an operational point of view which binds data to applications. Data-oriented mechanisms like check-in/out avoid this binding but do not improve synchronization towar... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Object placement in parallel object-oriented database systems

    Publication Year: 1994, Page(s):253 - 262
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (900 KB)

    Parallelism is a viable solution to constructing high performance object-oriented database systems. In parallel systems based on a shared-nothing architecture, the database is horizontally declustered across multiple processors, enabling the system to employ multiple processors to speedup the execution time of a query. The placement of objects across the processors has a significant impact on the ... 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.
  • The TP-Index: a dynamic and efficient indexing mechanism for temporal databases

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

    To support temporal operators efficiently, indexing based on temporal attributes must be supported. The authors propose a dynamic and efficient index scheme called the time polygon (TP-index) for temporal databases. In the scheme, temporal data are mapped into a two-dimensional temporal space, where the data can be clustered based on time. The date space is then partitioned into time polygons wher... 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.
  • Efficient support for partial write operations in replicated databases

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

    We present a new replica control technique targeted at replicated systems in which write operations update a portion of the information in the data item rather than replacing it entirely. The existing protocols capable of supporting partial writes must either perform the writes on all accessible replicas of the data item, or always apply the writes to the same group (quorum set) of replicas. In th... 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.
  • Discovering database summaries through refinements of fuzzy hypotheses

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

    Recently, many applications such as scientific databases and decision supporting systems that require comprehensive analysis of a very large amount of data, have been evolved. Summary discovery techniques, which extract compact representations grasping the meanings of large databases, can play a major role in those applications. We present an effective and robust method to discover simple linguist... View full abstract»

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