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
  • Comparing and synthesizing integrity checking methods for deductive databases

    Publication Year: 1994, Page(s):214 - 222
    Cited by:  Papers (2)
    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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • A method for transforming relational schemas into conceptual schemas

    Publication Year: 1994, Page(s):190 - 201
    Cited by:  Papers (14)
    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.
  • 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.
  • A hybrid transitive closure algorithm for sequential and parallel processing

    Publication Year: 1994, Page(s):498 - 505
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (536 KB)

    A new hybrid algorithm is proposed for well-formed path problems including the transitive closure problem. The CPU time for computation is O(ne), and blocking technique is incorporated to reduce the disk I/O cost in disk-resident environment. The new features of the new algorithm are that only parents sets instead of descendant sets are loaded in from disk, and the computation can be parallelized ... 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.
  • Semantics-based multilevel transaction management in federated systems

    Publication Year: 1994, Page(s):452 - 461
    Cited by:  Papers (8)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (844 KB)

    A federated database management system (FDBMS) is a special type of distributed database system that enables existing local databases, in a heterogeneous environment, to maintain a high degree of autonomy. One of the key problems in this setting is the coexistence of local transactions and global transactions, where the latter access and manipulate data of multiple local databases. In modeling FDB... 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 (51)  |  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.
  • 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.
  • 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.
  • The TP-Index: a dynamic and efficient indexing mechanism for temporal databases

    Publication Year: 1994, Page(s):274 - 281
    Cited by:  Papers (11)
    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.
  • 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.
  • 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.
  • On the interaction between ISA and cardinality constraints

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

    ISA and cardinality constraints are among the most interesting types of constraints in data models. ISA constraints are used to establish several forms of containment among classes, and are receiving great attention in moving to object-oriented data models, where classes are organized in hierarchies based on a generalization/specialization principle. Cardinality constraints impose restrictions on ... 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.
  • 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.
  • Disk allocation methods for parallelizing grid files

    Publication Year: 1994, Page(s):243 - 252
    Cited by:  Papers (4)  |  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.