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
  • 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.
  • 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.
  • 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.
  • Applying signatures for forward traversal query processing in object-oriented databases

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

    Forward traversal methods are used to process queries having nested predicates in object-oriented databases. To expedite the forward traversal, a signature replication technique is proposed. Object signature is a signature formed by values of all atomic attributes defined in the object. When an object refers to other objects through its attribute, the object signature of the referred object is sto... 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.
  • Implementing calendars and temporal rules in next generation databases

    Publication Year: 1994, Page(s):264 - 273
    Cited by:  Papers (18)  |  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.
  • Performing group-by before join [query processing]

    Publication Year: 1994, Page(s):89 - 100
    Cited by:  Papers (7)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (788 KB)

    Assume that we have an SQL query containing joins and a group-by. The standard way of evaluating this type of query is to first perform all the joins and then the group-by operation. However, it may be possible to perform the group-by early, that is, to push the group-by operation past one or more joins. Early grouping may reduce the query processing cost by reducing the amount of data participati... 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • On the interaction between ISA and cardinality constraints

    Publication Year: 1994, Page(s):204 - 213
    Cited by:  Papers (6)  |  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.
  • 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.
  • 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.
  • 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.