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
  • 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.
  • Query optimization strategies for browsing sessions

    Publication Year: 1994, Page(s):478 - 487
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (680 KB)

    This paper describes techniques and experimental results to obtain response time improvement for a browsing session, i.e. a sequence of interrelated queries to locate a subset of interest. The optimization technique exploits symbolic analysis of the query interdependencies and retention of (partial) query answers. A prototype browsing session optimizer (BSO) has been constructed that runs as a fro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Storage reclamation and reorganization in client-server persistent object stores

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

    The authors develop and evaluate a number of storage reclamation algorithms for client-server persistent object stores. Experience with a detailed simulation and a prototype implementation in the Exodus storage manager shows that one of the proposed algorithms, the Incremental Partitioned Collector, is complete, maintains transaction semantics, and can be run incrementally and concurrently with cl... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Specification and management of extended transactions in a programmable transaction environment

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

    A Transaction Specification and Management Environment (TSME) is a transaction processing system toolkit that supports the definition and construction of application-specific extended transaction models (ETMs). The TSME provides a transaction specification language that allows a transaction model designer to create implementation-independent specifications of extended transactions. In addition, th... 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.
  • 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.
  • 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 common subexpression exploitation models in multiple-query processing

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

    In multiple-query processing, a subexpression that appears in more than one query is called a common subexpression (CSE). A CSE needs to he evaluated once only to produce a temporary result that can then be used to evaluate all the queries containing the CSE. Therefore, the cost of evaluating the CSE is amortized over the queries requiring its evaluation. Two queries, posed simultaneously to the o... 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.
  • 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.
  • A query sampling method for estimating local cost parameters in a multidatabase system

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

    In a multidatabase system (MDBS), some query optimization information related to local database systems may not be available at the global level because of local autonomy. To perform global query optimization, a method is required to derive the necessary local information. This paper presents a new method that employs a query sampling technique to estimate the cost parameters of an autonomous loca... 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.
  • 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.
  • 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.
  • Capturing design dynamics - the CONCORD approach

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

    `Computer-Supported Cooperative Work' is a young research area considering applications with strong demands on database technology. Design applications need support for cooperation and some means for controlling their inherent dynamics. However, today's CAD systems consisting of a collection of diverse design tools typically do not support these requirements. Therefore, an encompassing processing ... 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.
  • 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.
  • Comparing and synthesizing integrity checking methods for deductive databases

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

    We compare and synthesize different methods for integrity checking in deductive databases. First, we state simplified integrity checking for deductive databases independently of the particular strategy used by different methods found in the literature. In accordance with this statement, we classify integrity checking methods into two main groups: methods with a generation phase without fact access... 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:  Papers (2)  |  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.
  • Disk allocation methods for parallelizing grid files

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

    The grid file is a well known access method for multi-dimensional and spatial data. The response time needed to process path and range queries on the grid file access method can be improved significantly by distributing the data pages over multiple disks. The paper explores the disk allocation methods used to allocate the data pages of grid file among a set of disks, which can be accessed in paral... 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.
  • 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.
  • 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.
  • 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.