Proceedings 14th International Conference on Data Engineering

23-27 Feb. 1998

Filter Results

Displaying Results 1 - 25 of 76
  • Proceedings 14th International Conference on Data Engineering

    Publication Year: 1998
    Request permission for commercial reuse | PDF file iconPDF (619 KB)
    Freely Available from IEEE
  • Representing and querying changes in semistructured data

    Publication Year: 1998, Page(s):4 - 13
    Cited by:  Papers (54)  |  Patents (46)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (129 KB)

    Semistructured data may be irregular and incomplete and does not necessarily conform to a fixed schema. As with structured data, it is often desirable to maintain a history of changes to data, and to query over both the data and the changes. Representing and querying changes in semistructured data is more difficult than in structured data due to the irregularity and lack of schema. We present a mo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimizing regular path expressions using graph schemas

    Publication Year: 1998, Page(s):14 - 23
    Cited by:  Papers (58)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (219 KB)

    Query languages for data with irregular structure use regular path expressions for navigation. This feature is useful for querying data where parts of the structure is either unknown, unavailable to the user, or changes frequently. Naive execution of regular path expressions is inefficient however, because it ignores any structure in the data. We describe two optimization techniques for queries wi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • WebOQL: restructuring documents, databases and Webs

    Publication Year: 1998, Page(s):24 - 33
    Cited by:  Papers (88)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (54 KB)

    The widespread use of the Web has originated several new data management problems, such as extracting data from Web pages and making databases accessible from Web browsers, and has renewed the interest in problems that had appeared before in other contexts, such as querying graphs, semistructured data and structured documents. Several systems and languages have been proposed for solving each of th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Concurrent operations in a distributed and mobile collaborative environment

    Publication Year: 1998, Page(s):36 - 45
    Cited by:  Papers (43)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (72 KB)

    In a distributed groupware system, objects shared by users are subject to concurrency and real time constraints. In order to satisfy these, various concurrency control algorithms have been proposed that exploit the semantic properties of operations (C.A. Ellis and S.J. Gibbs, 1989; A. Karsenty and M. Beaudouin-Lafon, 1993; C. Sun et al., 1996). By ordering concurrent operations, they generally gua... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Grouping techniques for update propagation in intermittently connected databases

    Publication Year: 1998, Page(s):46 - 53
    Cited by:  Papers (6)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (171 KB)

    We consider an environment where one or more servers carry databases that are of interest to a community of clients. The clients are only intermittently connected to the server for brief periods of time. Clients carry a part of the database for their own processing and accumulate local updates while disconnected. We call this the Intermittently Connected Database (ICDB) environment. ICDBs have a w... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cache management for mobile databases: design and evaluation

    Publication Year: 1998, Page(s):54 - 63
    Cited by:  Papers (34)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (781 KB)

    Communication between mobile clients and database servers in a mobile computing environment is via wireless channels with low bandwidth and low reliability. A mobile client could cache its frequently accessed database items into its local storage in order to improve performance of database queries and availability of database items for query processing during disconnection. We describe a mobile ca... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Messaging/queuing in Oracle8/sup TM/

    Publication Year: 1998, Page(s):66 - 68
    Cited by:  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (15 KB)

    There is an ever growing interest in messaging and queuing technology; one needs only to look at the many new products that have been made available within the last few years. Oracle's approach is unique since it represents the only product that offers messaging and queuing fully integrated into a database server, Oracle8/sup TM/. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The new database imperatives

    Publication Year: 1998, Page(s):69 - 72
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (25 KB)

    The market for database systems as well as the science of creating database systems is shifting. The purpose of the paper and presentation is to outline some non conventional perspectives and to derive imperatives. Some of these perspectives will be shared by some, and some will be controversial: SQL as a language; SQL for business; SQL for scientific analysis; distributed computing; database stor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • WWW and the Internet - Did We Miss the Boat?

    Publication Year: 1998, Page(s): 74
    Request permission for commercial reuse | PDF file iconPDF (6 KB)
    Freely Available from IEEE
  • Performance analysis of parallel hash join algorithms on a distributed shared memory machine implementation and evaluation on HP exemplar SPP 1600

    Publication Year: 1998, Page(s):76 - 85
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (160 KB)

    The distributed shared memory (DSM) architecture is considered to be one of the most likely parallel computing environment candidate for the near future because of its ease of system scalability and facilitation for parallel programming. However, a naive program based on shared memory execution on a DSM machine often deteriorates performance, because of the overhead involved for maintaining cache ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallelizing loops in database programming languages

    Publication Year: 1998, Page(s):86 - 93
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1360 KB)

    Database programming languages (DBPLs), fourth generation languages (4GLs) and embedded SQL all include the ability to iterate sequentially through a set/relation. Nested iterators can be used to express joins. Without program analysis, such joins must be evaluated using a tuple-at-a-time join algorithm at a central site, otherwise program semantics may be violated. This paper's analysis often all... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cyclic allocation of two-dimensional data

    Publication Year: 1998, Page(s):94 - 101
    Cited by:  Papers (26)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (263 KB)

    Various proposals have been made for declustering 2D tiled data on multiple I/O devices. Strictly optimal solutions only exist under very restrictive conditions on the tiling of the 2D space or for very few I/O devices. In this paper, we explore allocation methods where no strictly optimal solution exists. We propose a general class of allocation methods, referred to as cyclic allocation methods, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Employing intelligent agents for knowledge discovery

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

    Summary form only given, substantially as follows. Compares and contrasts alternative approaches currently in use as methodologies for 'data mining' and knowledge discovery. Specifically, the author focuses on the use of intelligent agents for mining important relationships and patterns, as well as the value of knowledge induction as a basis for quick and accurate discovery of vital information. B... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Industry applications of data mining: challenges and opportunities

    Publication Year: 1998
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2 KB)

    Summary form only given, as follows. Data mining applications deployed in industry are aimed at satisfying two problems organizations face: customer intimacy and better utilization of data assets. These applications can be divided into those that use micro-mining, i.e. single-mining-component desktop systems, and those who use macro-mining, i.e. multi-component server-based systems. The macro-mini... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fuzzy triggers: incorporating imprecise reasoning into active databases

    Publication Year: 1998, Page(s):108 - 115
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (51 KB)

    Traditional event-condition-action triggers (active database rules) include a Boolean predicate as a trigger condition. We propose fuzzy triggers whereby fuzzy inference is utilized in the condition evaluation. In this way, approximate reasoning may be integrated with a traditional crisp database. The new approach paves the way for intuitive expression of application semantics of imprecise nature,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Graph structured views and their incremental maintenance

    Publication Year: 1998, Page(s):116 - 125
    Cited by:  Papers (32)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (201 KB)

    Studies the problem of maintaining materialized views of graph structured data. The base data consists of records containing identifiers of other records. The data could represent traditional objects (with methods, attributes and a class hierarchy), but it could also represent a lower-level data structure. We define simple views and materialized views for such graph structured data, analyzing opti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Query folding with inclusion dependencies

    Publication Year: 1998, Page(s):126 - 133
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (101 KB)

    Query folding is a technique for determining how a query may be answered using a given set of resources, which may include materialized views, cached results of previous queries or queries answerable by other databases. The power of query folding can be considerably enhanced by taking into account integrity constraints that are known to hold on base relations. This paper describes an extension of ... View full abstract»

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

    Publication Year: 1998, Page(s):134 - 141
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (210 KB)

    Considers the problem of querying the data in applications such as spreadsheets and word processors. This problem has several motivations from the perspective of data integration, interoperability and OLAP. We provide an architecture for realizing interoperability among such diverse applications and address the challenges that arise specifically in the context of querying data stored in spreadshee... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Data logging: a method for efficient data updates in constantly active RAIDs

    Publication Year: 1998, Page(s):144 - 153
    Cited by:  Papers (9)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (261 KB)

    RAIDs (Redundant Arrays of Independent Disks) are a set of disks organized to achieve parallel I/O to multiple disks and to provide tolerance of disk failures. RAIDs offer these advantages at the cost of additional space and additional disk I/O for writes. Previous methods of reducing this I/O overhead suffered from such problems as requiring periods during which data is reorganized and not availa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Persistent applications using generalized redo recovery

    Publication Year: 1998, Page(s):154 - 163
    Cited by:  Papers (6)  |  Patents (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (714 KB)

    We describe how to recover applications after system crashes using database recovery. Earlier efforts, based on frequent application checkpoints and/or logging values read, are very expensive. We treat application state as a cached object and log application execution as operations in the recovery framework of D. Lomet and M. Tuttle (1995). Logging application execution does not require logging th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The effect of buffering on the performance of R-trees

    Publication Year: 1998, Page(s):164 - 171
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (228 KB)

    Past R tree studies have focused on the number of nodes visited as a metric of query performance. Since database systems usually include a buffering mechanism, we propose that the number of disk accesses is a more realistic measure of performance. We develop a buffer model to analyze the number of disk accesses required for spatial queries using R trees. The model can be used to evaluate the quali... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Red Brick Vista/sup TM/: aggregate computation and management

    Publication Year: 1998, Page(s):174 - 177
    Cited by:  Papers (4)  |  Patents (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (132 KB)

    Aggregate query processing in large data warehouses is computationally intensive. Precomputation is an approach that can be used to speed up aggregate queries. However, in order to make precomputation a truly viable solution to the aggregate query processing problem, it is important to identify the best set of aggregates to precompute and to use these precomputed aggregates effectively. The Red Br... View full abstract»

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

    Publication Year: 1998, Page(s):178 - 179
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (13 KB)

    The core challenges associated with enterprise OLAP are how to structure the database and how to build a decision support architecture that allows for complex analysis and qualification. The primary components of an OLAP system-the database and the analysis engine-must be capable of handling large amounts of data in varying structures. Warehouses will continue to grow and contain data that is diff... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Ending the ROLAP/MOLAP debate: usage based aggregation and flexible HOLAP

    Publication Year: 1998
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2 KB)

    Summary form only given, as follows. Over the past few years, OLAP vendors have engaged in a debate regarding relational versus multidimensional data stores. This debate has obscured the more significant problems facing today's OLAP customers: managing the exponential growth generated by multidimensional pre-aggregations, and architectural support for a wide array of OLAP data models. Microsoft di... View full abstract»

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