By Topic

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 (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.
  • Transactional workflows: research, enabling technologies and applications

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

    Abstract only given, as follows. Need to increase productivity and reduce cost have lead to reengineering and automation of operations across corporations. Some of the applications involve imaging, document processing and routing. These tasks can be effectively automated using current genre of workflow automation products. Some other applications involve tasks that can be modeled in client-server ... 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • Sort-merge-join: an idea whose time has(h) passed?

    Publication Year: 1994, Page(s):406 - 417
    Cited by:  Papers (7)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1048 KB)

    Matching two sets of data items is a fundamental operation required in relational, extensible, and object-oriented database systems alike. However, the pros and cons of sort- and hash-based query evaluation techniques in modern query processing systems are still not fully understood. After our earlier research clarified strengths and weaknesses of sort- and hash-based query processing techniques a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast ranking in limited space

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

    Ranking techniques have long been suggested as alternatives to conventional Boolean methods for searching document collections. The cost of computing a ranking is, however, greater than the cost of performing a Boolean search, in terms of both memory space and processing time. The authors consider the resources required by the cosine method of ranking, and show that, with a careful application of ... 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.
  • Distributed heterogeneous information systems

    Publication Year: 1994
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (28 KB)

    Abstract only given, as follows. Many organization have major investments in information systems, ranging from legacy programs written in COBOL to newer relational database management systems. These distributed heterogeneous information systems (DHISs) do not generally interoperate or share information. However, commercial-off-the-shelf (COTS) software products are becoming available that can make... 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • Object Skeletons: an efficient navigation structure for object-oriented database systems

    Publication Year: 1994, Page(s):508 - 517
    Cited by:  Papers (5)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (812 KB)

    One common requirement of object-oriented applications is the efficient support of complex objects. This requirement is one salient feature of object orientation. Access to a complex object involves true basic steps: (1) The predicate is evaluated to identify the complex object. (2) The qualified complex object is traversed to retrieve the required components. Over the past few years, several inde... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient organization of large multidimensional arrays

    Publication Year: 1994, Page(s):328 - 336
    Cited by:  Papers (66)  |  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.
  • Parallel approaches to database management

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

    Abstract only given, as follows. A variety of parallel approaches have been used to support database processing across a spectrum of machine architectures. We begin by describing areas where parallelism is potentially important in dealing with very large databases, including loading, query/update, and database administration. We then discuss hardware tradeoffs, including multicomputers versus mult... View full abstract»

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