By Topic

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
  • 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
  • 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.
  • 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.
  • Content-based multimedia information management

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

    Summary form only given. All image search engines provide mechanisms to search based on keywords and provide the ability to do content-based searching using querying by pictorial example. In this paper, first we present some results from current image databases. Then we present a new approach to exploring image databases. Most of our current results are drawn from image and video asset management ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • ROL: a prototype for deductive object-oriented databases

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

    Summary form only given. ROL (Rule-based Object Language) is a deductive object-oriented database system. It provides a uniform language for defining, querying and manipulating a database. The ROL language integrates important features of deductive databases and object-oriented databases with well-defined declarative semantics. ROL also supports structured values, treating them as first-class citi... View full abstract»

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

    Publication Year: 1998, Page(s):603 - 605
    Request permission for commercial reuse | PDF file iconPDF (96 KB)
    Freely Available from IEEE
  • 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 (16 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.
  • Red Brick VistaTM: 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 (140 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.
  • The effect of buffering on the performance of R-trees

    Publication Year: 1998, Page(s):164 - 171
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (236 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.
  • Methodical restructuring of complex workflow activities

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

    We describe a family of activity-split and activity-join operations with a notion of validity. The key idea of introducing the set of activity-split and activity-join operations is to allow users to restructure ongoing activities in anticipation of uncertainty so that any significant performance loss due to unexpected unavailablity or delay of shared resources can be avoided or reduced through rel... 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 (5)  |  Patents (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1560 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.
  • WebOQL: restructuring documents, databases and Webs

    Publication Year: 1998, Page(s):24 - 33
    Cited by:  Papers (77)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (56 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.
  • Failure handling and coordinated execution of concurrent workflows

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

    Workflow management systems (WFMSs) coordinate the execution of applications distributed over networks. In WFMSs, data inconsistencies can arise due to: the interaction between steps of concurrent threads within a workflow (intra-workflow coordination); the interaction between steps of concurrent workflows (inter-workflow coordination); and the presence of failures. Since these problems have not r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Data-intensive intra- and Internet applications-experiences using Java and CORBA in the World Wide Web

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

    Intra/Internet technology has become a key issue in the development of modern systems. Nowadays, it is no longer sufficient to present static information sheets through the World Wide Web (WWW). Instead, we need interactive applications that may even compute complex results or process large data sets. In this paper, we describe a prototype based on Java and CORBA. Both represent modern concepts th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Active HYpermedia Delivery System (AHYDS) using the PHASME application-oriented DBMS

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

    AHYDS is a hypermedia platform being developed at NACSIS based on the PHASME application-oriented DBMS. The AHYDS is a media delivery platform to support various hypermedia applications. The features of customisability and active behavior enable to support different kinds of heterogeneous hypermedia applications. AHYDS has hypermedia access capabilities through both query language-based and non-qu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coarse indices for a tape-based data warehouse

    Publication Year: 1998, Page(s):231 - 240
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (184 KB)

    Data warehouses allow users to make sense of large quantities of detail data. While most queries can be answered through summary data, some queries can only be answered by accessing the detail data. It is usually not cost-effective to store terabytes of detail data online; instead, the detail data is stored on tape. The problem we address in this paper is how to index tape-based detail data. Conve... 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 (1368 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.
  • Generalizing “search” in generalized search trees

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

    The generalized search tree, or GiST, defines a framework of basic interfaces required to construct a hierarchical access method for database systems. As originally specified, GiST only supports record selection. We show how a small number of additional interfaces enable GiST to support a much larger class of operations. Members of this class, which includes, nearest-neighbor and ranked search, us... 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 (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (52 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.
  • 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 (268 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.
  • ZEBRA image access system

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

    The ZEBRA system, which is part of the VisualHarness platform for managing heterogeneous data, supports three types of access to distributed image repositories: keyword based, attribute based, and image content based. A user can assign different weights (relative importance) to each of the three types, and within the last type of access, to each of the image properties. The image based access comp... 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 (47)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (224 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.
  • Mining association rules: anti-skew algorithms

    Publication Year: 1998, Page(s):486 - 493
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (224 KB)

    Mining association rules among items in a large database has been recognized as one of the most important data mining problems. All proposed approaches for this problem require scanning the entire database at least or almost twice in the worst case. We propose several techniques which overcome the problem of data skew in the basket data. These techniques reduce the maximum number of scans to less ... View full abstract»

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