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
  • Cost and imprecision in modeling the position of moving objects

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

    Consider a database that represents the location of moving objects, such as taxi-cabs (typical query: “retrieve the cabs that are currently within 1 mile of 33 Michigan Ave., Chicago”), or objects in a battle-field. Existing database management systems (DBMSs) are not well equipped to handle continuously changing data, such as the position of moving objects, since data is assumed to be... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Remote load-sensitive caching for multi-server database systems

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

    The recent dramatic improvements in the performance of commodity hardware has made clusters of workstations or PCs an attractive and economical platform upon which to build scalable database servers. These clusters have large aggregate memory capacities, however, since this global memory is distributed, good algorithms are necessary for memory management, or this large aggregate memory will go und... 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 (8)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (108 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.
  • High dimensional similarity joins: algorithms and performance evaluation

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

    Current data repositories include a variety of data types, including audio, images and time series. State of the art techniques for indexing such data and doing query processing rely on a transformation of data elements into points in a multidimensional feature space. Indexing and query processing then take place in the feature space. We study algorithms for finding relationships among points in m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Back to the future: dynamic hierarchical clustering

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

    Describes a new method for dynamically clustering hierarchical data which maintains good clustering within disk pages in the presence of insertions and deletions. This simple but effective method, which we call Enc, encodes the insertion order of children with respect to their parents and concatenates the insertion numbers to form a compact key for the data. This compact key is stored only in the ... 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.
  • Mining optimized association rules with categorical and numeric attributes

    Publication Year: 1998, Page(s):503 - 512
    Cited by:  Papers (20)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (236 KB)

    Association rules are useful for determining correlations between attributes of a relation and have applications in marketing, financial and retail sectors. Furthermore, optimized association rules are an effective way to focus on the most interesting characteristics involving certain attributes. Optimized association rules are permitted to contain uninstantiated attributes and the problem is to d... 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 (30)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (208 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.
  • Efficient retrieval of similar time sequences under time warping

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

    Fast similarity searching in large time sequence databases has typically used Euclidean distance as a dissimilarity metric. However, for several applications, including matching of voice, audio and medical signals (e.g., electrocardiograms), one is required to permit local accelerations and decelerations in the rate of sequences, leading to a popular, field tested dissimilarity metric called the &... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Processing incremental multidimensional range queries in a direct manipulation visual query environment

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

    We have developed a MultiMedia Visual Information Seeking (MMVIS) Environment designed to support an integrated approach to direct manipulation temporal querying and browsing of temporal relationship results. We address the optimization of queries specified via our visual query interface. Queries in MMVIS are incrementally specified and continuously refined multidimensional range queries. We prese... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Flattening an object algebra to provide performance

    Publication Year: 1998, Page(s):568 - 577
    Cited by:  Papers (12)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (164 KB)

    Algebraic transformation and optimization techniques have been the method of choice in relational query execution, but applying them in object-oriented (OO) DBMSs is difficult due to the complexity of OO query languages. This paper demonstrates that the problem can be simplified by mapping an OO data model to the binary relational model implemented by Monet, a state-of-the-art database kernel. We ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Online generation of association rules

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

    We have a large database consisting of sales transactions. We investigate the problem of online mining of association rules in this large database. We show how to preprocess the data effectively in order to make it suitable for repeated online queries. The preprocessing algorithm takes into account the storage space available. We store the preprocessed data in such a way that online processing may... 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.
  • Mining for strong negative associations in a large database of customer transactions

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

    Mining for association rules is considered an important data mining problem. Many different variations of this problem have been described in the literature. We introduce the problem of mining for negative associations. A naive approach to finding negative associations leads to a very large number of rules with low interest measures. We address this problem by combining previously discovered posit... 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 (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.
  • Point-versus interval-based temporal data models

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

    The association of timestamps with various data items such as tuples or attribute values is fundamental to the management of time varying information. Using intervals in timestamps, as do most data models, leaves a data model with a variety of choices for giving a meaning to timestamps. Specifically, some such data models claim to be point based while other data models claim to be interval based. ... View full abstract»

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

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

    Virtual database (VDB) technology makes external data behave as an extension of an enterprise's relational database (RDBMS) system. VDB technology enables the rapid deployment of applications with at least one of the following characteristics: large numbers of data sources; data sources that are autonomous (i.e. there is no centralized control); or data sources that can have a mixture of structure... View full abstract»

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