By Topic

Data Engineering, 2000. Proceedings. 16th International Conference on

Date Feb. 29 2000-March 3 2000

Filter Results

Displaying Results 1 - 25 of 103
  • Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073)

    Publication Year: 2000
    Save to Project icon | Request Permissions | PDF file iconPDF (1540 KB)  
    Freely Available from IEEE
  • Data Mining: Niche Market or Killer App?

    Publication Year: 2000 , Page(s): 361
    Save to Project icon | Request Permissions | PDF file iconPDF (51 KB)  
    Freely Available from IEEE
  • XML + Databases = ? (panel session)

    Publication Year: 2000 , Page(s): 657
    Save to Project icon | Request Permissions | PDF file iconPDF (83 KB)  
    Freely Available from IEEE
  • Tutorial 1: Web Information Retrieval

    Publication Year: 2000 , Page(s): 693
    Cited by:  Papers (8)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (5 KB)  

    Summary form only given, as follows. The Web explosion offers a bonanza of algorithmic problems. In particular, information retrieval in the Web context requires methods and ideas that have not been addressed in the classic IR literature. This tutorial will survey emerging techniques for IR in the Web context and discuss some of the pertinent open problems. The list of topics includes search engine technology, ranking and classification methods, Web measurements (usage, size, connectivity) and new graph and data structure problems arising in the Web IR context. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tutorial 2: Mobile and Wireless Database Access for Pervasive Computing

    Publication Year: 2000 , Page(s): 694 - 695
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (10 KB)  

    Summary form only given, as follows. We are in the midst of a wireless and mobile revolution. In the near future, a typical computing environment - business, personal, scientific or educational - will provide wireless network connectivity between powerful data servers and mobile, sometimes disconnected, computers and devices. This has created exciting opportunities for developing a wide range of innovative database applications and systems. However, an open question remains: What kind of system will be capable of offering scalable data services and exhibit scalable performance? Besides advances in communications and hardware, does achieving pervasive mobile computing require innovative theories and paradigms in data management or new data engineering techniques? The objective of this tutorial is to provide an answer to the above questions by presenting the current state-of-the-research and contrasting it with the state-of-the-practice. Towards this, it will provide an overview of the commercial-state-of-the-art for supporting mobile database access and present a summary of the significant research advances in theories and techniques for mobile and wireless data access. It will also discuss some future directions in the context of pervasive and invisible computing applications. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tutorial 3: Data Mining with Decision Trees

    Publication Year: 2000 , Page(s): 696
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (5 KB)  

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tutorial 4: Directories: Managing Data for Networked Applications

    Publication Year: 2000 , Page(s): 697
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (4 KB)  

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tutorial 5: Indexing high-dimensional spaces: database support for next decade's applications

    Publication Year: 2000 , Page(s): 698 - 699
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (10 KB)  

    Summary form only given. The tutorial is structured as follows: In the first section, we describe two examples of new database applications, which demonstrate the need for efficient query processing techniques in highdimensional spaces. In the second section, we discuss the effects occurring in high-dimensional spaces ?? first from a pure mathematical point of view and then from a database perspective. Next, we describe the different approaches for modeling the costs of processing queries on high-dimensional data. The description of the different approaches demonstrates nicely what happens if we ignore the special properties of high-dimensional spaces. In the fourth section, we then provide a structured overview of the proposed querying and indexing techniques, discussing their advantages and drawbacks. In this section, we also cover a number of additional techniques dealing with optimization and parallelization. In concluding the tutorial, we try to stir further research activities by presenting a number of interesting research problems. View full abstract»

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

    Publication Year: 2000 , Page(s): 701 - 703
    Save to Project icon | Request Permissions | PDF file iconPDF (23 KB)  
    Freely Available from IEEE
  • Rules of thumb in data engineering

    Publication Year: 2000 , Page(s): 3 - 10
    Cited by:  Papers (14)  |  Patents (5)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (64 KB)  

    This paper reexamines the rules of thumb for the design of data storage systems. Briefly, it looks at storage, processing, and networking costs, ratios, and trends with a particular focus on performance and price/performance. Amdahl's ratio laws for system design need only slight revision after 35 years-the major change being the increased use of RAM. An analysis also indicates storage should be used to cache both database and Web data to save disk bandwidth, network bandwidth, and people's time. Surprisingly, the 5-minute rule for disk caching becomes a cache-everything rule for Web caching View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient Storage of XML Data

    Publication Year: 2000 , Page(s): 198
    Cited by:  Papers (6)  |  Patents (7)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (12 KB)  

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient Query Refinement in Multimedia Databases

    Publication Year: 2000 , Page(s): 196
    Cited by:  Papers (6)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (20 KB)  

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The IDEAL approach to Internet-based negotiation for e-business

    Publication Year: 2000 , Page(s): 666 - 667
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (56 KB)  

    With the emergence of e-business as the next killer application for the Web, automating bargaining-type negotiations between clients (i.e., buyers and sellers) has become increasingly important. With IDEAL (Internet based Dealmaker for e-business), we have developed an architecture and framework, including a negotiation protocol, for automated negotiations among multiple IDEAL servers. The main components of IDEAL are a constraint satisfaction processor (CSP) to evaluate a proposal, an Event-Trigger-Rule (ETR) server for managing and triggering the execution of rules which make up the negotiation strategy (rules can be updated at run-time to deal with the dynamic nature of negotiations), and a cost-benefit analysis to help in the selection of alternative strategies. We have implemented a fully functional prototype system of IDEAL to demonstrate automated negotiations among buyers and suppliers participating in a supply chain View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • ACQ: An Automatic Clustering and Querying Approach for Large Image Databases

    Publication Year: 2000 , Page(s): 191
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (120 KB)  

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic Histograms: Capturing Evolving Data Sets

    Publication Year: 2000 , Page(s): 86
    Cited by:  Papers (9)  |  Patents (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (12 KB)  

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Interactive-Time Similarity Search for Large Image Collections Using Parallel VA-Files

    Publication Year: 2000 , Page(s): 197
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (16 KB)  

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • READY: a high performance event notification service

    Publication Year: 2000 , Page(s): 668 - 669
    Cited by:  Papers (1)  |  Patents (12)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (28 KB)  

    READY is an event notification service that provides efficient, decoupled, and asynchronous event notifications. READY supports: consumer specifications that match over single and compound event patterns; communication sessions that manage quality of service for event delivery; grouping constructs for sessions and specifications; and event zones and boundary routers that bound the scope of event distribution and control the mapping of events across zones View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An extensible Framework for Data Cleaning

    Publication Year: 2000 , Page(s): 312
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (16 KB)  

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient mining of constrained correlated sets

    Publication Year: 2000 , Page(s): 512 - 521
    Cited by:  Papers (11)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (188 KB)  

    Studies the problem of efficiently computing correlated item sets satisfying given constraints. We call them valid correlated item sets. It turns out that constraints can have subtle interactions with correlated item sets, depending on their underlying properties. We show that, in general, the set of minimal valid correlated item sets does not coincide with that of minimal correlated item sets that are valid, and we characterize classes of constraints for which these sets coincide. We delineate the meaning of these two spaces and give algorithms for computing them. We also give an analytical evaluation of their performance and validate our analysis with a detailed experimental evaluation View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A multimedia information server with mixed workload scheduling

    Publication Year: 2000 , Page(s): 670 - 671
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (44 KB)  

    In contrast to specialized video servers, advanced multimedia applications for tele-shopping, tele-teaching and news-on-demand exhibit a mixed workload with massive access to conventional, “discrete” data such as text document, images and indexes as well as requests for “continuous data” such as video. The paper briefly describes the prototype of a multimedia information server that stores discrete and continuous data on a shared disk pool and is able to handle a mixed workload in a very efficient way View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient searches for similar subsequences of different lengths in sequence databases

    Publication Year: 2000 , Page(s): 23 - 32
    Cited by:  Papers (18)  |  Patents (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (388 KB)  

    We propose an indexing technique for fast retrieval of similar subsequences using time warping distances. A time warping distance is a more suitable similarity measure than the Euclidean distance in many applications, where sequences may be of different lengths or different sampling rates. Our indexing technique uses a disk-based suffix tree as an index structure and employs lower-bound distance functions to filter out dissimilar subsequences without false dismissals. To make the index structure compact and thus accelerate the query processing, we convert sequences of continuous values to sequences of discrete values via a categorization method and store only a subset of suffixes whose first values are different from their preceding values. The experimental results reveal that our proposed technique can be a few orders of magnitude faster than sequential scanning View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mining Bases for Association Rules Using Closed Sets

    Publication Year: 2000 , Page(s): 307
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (28 KB)  

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scalable algorithms for large temporal aggregation

    Publication Year: 2000 , Page(s): 145 - 154
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (148 KB)  

    The ability to model time-varying nature is essential to many database applications such as data warehousing and mining. However, the temporal aspects provide many unique characteristics and challenges for query processing and optimization. Among the challenges is computing temporal aggregates, which is complicated by having to compute temporal grouping. In this paper, we introduce a variety of temporal aggregation algorithms that overcome major drawbacks of previous work. First, for small-scale aggregations, both the worst-case and average-case processing time have been improved significantly. Second, for large-scale aggregations, the proposed algorithms can deal with a database that is substantially larger than the size of available memory View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Power conservative multi-attribute queries on data broadcast

    Publication Year: 2000 , Page(s): 157 - 166
    Cited by:  Papers (12)  |  Patents (12)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (136 KB)  

    Studies power conservation techniques for multi-attribute queries on wireless data broadcast channels. Indexing data on broadcast channels can improve the client filtering capability, while clustering and scheduling can reduce both the access time and the tune-in time. Thus, indexing techniques should be coupled with clustering and scheduling methods to reduce the battery power consumption of mobile computers. In this study, three indexing schemes for multi-attribute queries, namely the index tree, signature and hybrid index, are discussed. We develop cost models for these three indexing schemes and evaluate their performance based on multi-attribute queries on wireless data broadcast channels View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • DISIMA: an object-oriented approach to developing an image database system

    Publication Year: 2000 , Page(s): 672 - 673
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (28 KB)  

    Most image database prototypes and products focus mainly on similarity searches over syntactic features of images. DISIMA aims at providing querying on both syntactic and semantic features of images. The content of an image is viewed as a set of salient objects (regions of interest). Salient objects are organized into two levels: physical salient objects that store syntactic features and logical salient objects that give the semantics. DISIMA integrates a declarative query language (MOQL) and a visual query language (VisualMOQL) View full abstract»

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