By Topic

Parallel and Distributed Information Systems, 1996., Fourth International Conference on

Date 18-20 Dec. 1996

Filter Results

Displaying Results 1 - 25 of 26
  • Proceedings of the Fourth International Conference on Parallel and Distributed Information Systems [front matter]

    Publication Year: 1996, Page(s):iii - vii
    Request permission for commercial reuse | PDF file iconPDF (201 KB)
    Freely Available from IEEE
  • Author index

    Publication Year: 1996, Page(s): 295
    Request permission for commercial reuse | PDF file iconPDF (54 KB)
    Freely Available from IEEE
  • Scrambling query plans to cope with unexpected delays

    Publication Year: 1996, Page(s):208 - 219
    Cited by:  Papers (9)  |  Patents (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1264 KB)

    Accessing data from numerous widely distributed sources poses significant new challenges for query optimization and execution. Congestion and failures in the network can introduce highly variable response times for wide area data access. The paper is an initial exploration of solutions to this variability. We introduce a class of dynamic, run time query plan modification techniques that we call qu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • dSCAM: finding document copies across multiple databases

    Publication Year: 1996, Page(s):68 - 79
    Cited by:  Papers (4)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1124 KB)

    The advent of the Internet has made the illegal dissemination of copyrighted material easy. An important problem is how to automatically detect when a “new” digital document is “suspiciously close” to existing ones. The SCAM project at Stanford University has addressed this problem when there is a single registered-document database. However, in practice, test documents may... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Transient versioning for consistency and concurrency in client-server systems

    Publication Year: 1996, Page(s):274 - 285
    Cited by:  Papers (2)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1044 KB)

    Synchronization and cache consistency limit the performance of data-shipping client-server systems. Both the problems arise because existing methods treat cached data as replicated data. The paper proposes a new method using transient versioning concepts to reduce the effect of these problems. Copies of data in different client caches are treated as different versions of the data. Multiple version... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient approach to discovering knowledge from large databases

    Publication Year: 1996, Page(s):8 - 18
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (976 KB)

    We study two problems: mining association rules and mining sequential patterns in a large database of customer transactions. The problem of mining association rules focuses on discovering large itemsets where a large itemset is a group of items which appear together in a sufficient number of transactions; while the problem of mining sequential patterns focuses on discovering large sequences where ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptable, efficient, and modular coordination of distributed extended transactions

    Publication Year: 1996, Page(s):262 - 273
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1160 KB)

    The authors describe a method for building a variety of coordination protocols as well as distributed extended transaction primitives. The method is called open coordination protocol (OCP), and is applied to construct many variants of commit-transaction, as well as distributed split-transaction and distributed join-group. OCP adopts a modular decomposition of popular coordination protocols (e.g., ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Data warehousing features in Informix OnLine XPS

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

    Summary form only given, as follows. The data warehousing application domain is an important area of focus for Informix's OnLine XPS massively parallel server. Fast query processing is a central requirement in this domain. Use of indexes has traditionally been an important query processing technique, helping to reduce response times and increase throughput. The data warehousing environment, charac... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hash based parallel algorithms for mining association rules

    Publication Year: 1996, Page(s):19 - 30
    Cited by:  Papers (29)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1000 KB)

    We propose four parallel algorithms (NPA, SPA, HPA and HPA-ELD) for mining association rules on shared nothing parallel machines to improve its performance. In NPA, candidate itemsets are just copied amongst all the processors, which can lead to memory overflow for large transaction databases. The remaining three algorithms partition the candidate itemsets over the processors. If it is partitioned... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The query execution engine in Tandem's new ServerWare SQL product

    Publication Year: 1996, Page(s):289 - 291
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (192 KB)

    Tandem has re-written its SQL compiler and its query execution engine into a new product that will be available on multiple operating systems. The new product uses a novel query execution engine and the authors highlight the unique aspects of the new engine. ServerWare SQL uses a data flow and scheduler driven task model to execute queries. Tasks communicate either via in-memory queues or via inte... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Making views self-maintainable for data warehousing

    Publication Year: 1996, Page(s):158 - 169
    Cited by:  Papers (30)  |  Patents (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1228 KB)

    A data warehouse stores materialized views over data from one or more sources in order to provide fast access to the integrated data, regardless of the availability of the data sources. Warehouse views need to be maintained in response to changes to the base data in the sources. Except for very simple views, maintaining a warehouse view requires access to data that is not available in the view its... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Capabilities-based query rewriting in mediator systems

    Publication Year: 1996, Page(s):170 - 181
    Cited by:  Papers (10)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1296 KB)

    Users today are struggling to integrate a broad range of information sources providing different levels of query capabilities. Currently, data sources with different and limited capabilities are accessed either by writing rich functional wrappers for the more primitive sources, or by dealing with all sources at a “lowest common denominator”. This paper explores a third approach, in whi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extending TP-monitors for intra-transaction parallelism

    Publication Year: 1996, Page(s):250 - 261
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1084 KB)

    Inter-transaction parallelism, the concurrent execution of independent client transactions, is currently well supported by database systems. Intra-transaction parallelism, the parallel execution of operations within the same transaction, is generally not supported, even though often necessary especially in non-standard applications. The authors show how database operations within the same transact... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Replicated indexes for distributed data

    Publication Year: 1996, Page(s):108 - 119
    Cited by:  Papers (2)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1152 KB)

    The author describes a distributed index structure, in which data is distributed among multiple sites and indexes to the data are replicated over multiple sites. This permits good scalability as storage and accessing load are distributed over the sites and each site with an index replica has fast local access to the index structure, making remote requests at most for data at the leaves of the inde... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance of recovery time improvement algorithms for software RAIDs

    Publication Year: 1996, Page(s):56 - 65
    Cited by:  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (844 KB)

    A software RAID is a RAID implemented purely in software running on a host computer. One problem with software RAIDs is that they do not have access to special hardware such as NVRAM. Thus, software RAIDs may need to check every parity group of an array for consistency following a host crash or power failure. This process of checking parity groups is called recovery, and results in long delays whe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Querying the World Wide Web

    Publication Year: 1996, Page(s):80 - 91
    Cited by:  Papers (61)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1104 KB)

    The World Wide Web is a large, heterogeneous, distributed collection of documents connected by hypertext links. The most common technology currently used for searching the Web depends on sending information retrieval requests to “index servers”. One problem with this is that these queries cannot exploit the structure and topology of the document network. The authors propose a query lan... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A fast distributed algorithm for mining association rules

    Publication Year: 1996, Page(s):31 - 42
    Cited by:  Papers (68)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1116 KB)

    With the existence of many large transaction databases, the huge amounts of data, the high scalability of distributed systems, and the easy partitioning and distribution of a centralized database, it is important to investigate efficient methods for distributed mining of association rules. The study discloses some interesting relationships between locally large and globally large item sets and pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reliable data distribution middleware for large-scale massive data replication

    Publication Year: 1996, Page(s):196 - 205
    Cited by:  Papers (2)  |  Patents (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (872 KB)

    For massive data replication, Infocast, a communication middleware, is proposed. It distributes large data sets to thousands of receivers without any data loss. This paper examines the distributed processing feature of Infocast and also evaluates its performance. Reliability is achieved by an effective receiver-initiated recovery algorithm and server's complete supervision of all receiver states. ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Characterizing reference locality in the WWW

    Publication Year: 1996, Page(s):92 - 103
    Cited by:  Papers (95)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1068 KB)

    The authors propose models for both temporal and spatial locality of reference in streams of requests arriving at Web servers. They show that simple models based on document popularity alone are insufficient for capturing either temporal or spatial locality. Instead, they rely on an equivalent, but numerical, representation of a reference stream: a stack distance trace. They show that temporal loc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed multi-level recovery in main-memory databases

    Publication Year: 1996, Page(s):44 - 55
    Cited by:  Papers (9)  |  Patents (34)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1340 KB)

    The authors present two schemes for concurrency control and recovery in distributed main-memory databases. In the client-server scheme, clients ship log records to the server, which applies the updates to its database copy. In the shared disk scheme, each site broadcasts its updates to other sites. The above enable the schemes to support concurrent updates to the same page at different sites. Both... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Strobe algorithms for multi-source warehouse consistency

    Publication Year: 1996, Page(s):146 - 157
    Cited by:  Papers (32)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1280 KB)

    A warehouse is a data repository containing integrated information for efficient querying and analysis. Maintaining the consistency of warehouse data is challenging, especially if the data sources are autonomous and views of the data at the warehouse span multiple sources. Transactions containing multiple updates at one or more sources, e.g., batch updates, complicate the consistency problem. The ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Building regression cost models for multidatabase systems

    Publication Year: 1996, Page(s):220 - 231
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1060 KB)

    A major challenge for performing global query optimization in a multidatabase system (MDBS) is the lack of cost models for local database systems at the global level. The authors present a statistical procedure based on multiple regression analysis for building cost models for local database systems in an MDBS. Explanatory variables that can be included in a regression model are identified and a m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel query processing strategies for object-oriented temporal databases

    Publication Year: 1996, Page(s):232 - 245
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1300 KB)

    An object-oriented (OO) temporal database management system can better meet the data management requirements of many applications because it not only provides powerful facilities for modeling and processing the structural and behavioral properties of complex objects but also supports the management of temporal data. However, due to the generality and high functionality of an OO system, the append-... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new storage and retrieval method to support editing operations in a multi-disk-based video server

    Publication Year: 1996, Page(s):132 - 141
    Cited by:  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (932 KB)

    Since the storage ordering is assumed the same as the retrieval ordering in all the previous storage placement strategies, there is a requirement of a large amount of file copying or merging operations when users insert/delete some data into/from the media data. The observation is also important for video applications because features, like video editing, require the support of random access on in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • k-RP*s: a scalable distributed data structure for high-performance multi-attribute access

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

    k-RP*s is a new data structure for scalable multicomputer files with multi-attribute (k-d) keys. We discuss the k-RP*s file evolution and search algorithms. Performance analysis shows that a k-RP*s file can be much larger and orders of magnitude faster than a traditional k-d file. The speed-up is especially important for range and partial match searches that are often impractical with traditional ... View full abstract»

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