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
  • 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.
  • Active databases for active repositories

    Publication Year: 1994, Page(s):375 - 384
    Cited by:  Papers (4)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (740 KB)

    The various activities necessary for constructing a software product are described by software process models. Many of the actions mentioned there are supported by tools that use a repository in order to create, manipulate, generate, etc. the deliverables. The process is tailored for each project to necessary work and planned with respect to existing resources. This results in a schedule for each ... 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • 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.
  • Implementing calendars and temporal rules in next generation databases

    Publication Year: 1994, Page(s):264 - 273
    Cited by:  Papers (20)  |  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.
  • 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.
  • 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 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.
  • 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.
  • Specification and management of extended transactions in a programmable transaction environment

    Publication Year: 1994, Page(s):462 - 473
    Cited by:  Papers (11)
    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.
  • 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.